Remove Duplicates from Sorted List - Linked List - Easy - LeetCode

Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

Input: 1->1->2 Output: 1->2 Example 2:

Input: 1->1->2->3->3 Output: 1->2->3

/**
 * Definition for singly-linked list.
 * public class ListNode {
 * public int val;
 * public ListNode next;
 * public ListNode(int val=0, ListNode next=null) {
 * this.val = val;
 * this.next = next;
 * }
 * }
 */
public class Solution {
 public ListNode DeleteDuplicates(ListNode head) {
 if(head == null){
 return head;
 }
 ListNode temp = head;
 while(temp.next!=null){
 if(temp.val==temp.next.val){
 temp.next=temp.next.next;
 }
 else{
 temp=temp.next;
 }
 }
 
 return head;
 }
}

Time Complexity: O(n)

Space Complexity: O(1)