Problem
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
Solution
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var deleteDuplicates = function(head) {
var now = head;
while (now) {
if (now.next && now.next.val === now.val) {
now.next = now.next.next;
} else {
now = now.next;
}
}
return head;
};
Explain:
nope.
Complexity:
- Time complexity : O(n).
- Space complexity : O(1).