/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode temp = head;
if(temp==null){
return temp;
}else if(temp.next==null){
return temp;
}
ListNode prev = temp;
temp = temp.next;
while(temp!=null){
if(temp.val == prev.val){
prev.next = temp.next;
temp = temp.next;
}else{
prev = temp;
temp = temp.next;
}
}
return head;
}
}
Related Posts
Meet the Microsoft Graph Product Group Leaders 28th November 3PM GMT
Register Now Microsoft Reactor | Microsoft Developer What is this event about? Don’t forget to submit your project…
Code faster with custom VScode snippets
Code snippets are templates that make it easier to enter repeating code patterns and who better than yourself…