Difficulty: Easy
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
1 2
| Input: 1->1->2 Output: 1->2
|
Example 2:
1 2
| Input: 1->1->2->3->3 Output: 1->2->3
|
Solution
Language: Java
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
|
class Solution { public ListNode deleteDuplicates(ListNode head) { if (head == null) { return null; } ListNode cur = head; while (cur != null && cur.next != null) { if (cur.next.val == cur.val) { cur.next = cur.next.next; } else { cur = cur.next; } } return head; } }
|