LeetCode – Remove Duplicates from Sorted List II (Java)
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example, given 1->1->1->2->3, return 2->3.
Java Solution
public ListNode deleteDuplicates(ListNode head) { ListNode t = new ListNode(0); t.next = head; ListNode p = t; while(p.next!=null&&p.next.next!=null){ if(p.next.val == p.next.next.val){ int dup = p.next.val; while(p.next!=null&&p.next.val==dup){ p.next = p.next.next; } }else{ p=p.next; } } return t.next; } |
<pre><code> String foo = "bar"; </code></pre>
-
Swati Mewara
-
Aditya Vutukuri
-
Ankit Shah
-
Ankit Shah