
Linked List, Easy
Question
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
|
Answer
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
|
* Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class { public ListNode deleteDuplicates(ListNode head) { if(head == null || head.next==null) return head; ListNode temp = head; while(temp!=null&&temp.next!=null){ if(temp.val == temp.next.val) temp.next = temp.next.next; else temp = temp.next; } return head; } }
|
Recursive
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
|
* Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class { public ListNode deleteDuplicates(ListNode head) { if(head == null || head.next==null) return head; head.next = deleteDuplicates(head.next); return head.val==head.next.val ? head.next : head; } }
|
Running time: O(n)
近期评论