Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example
Given 1->2->3->3->4->4->5
, return 1->2->5
.
Given 1->1->1->2->3
, return 2->3
.
/** * Definition for ListNode * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ public class Solution { /** * @param ListNode head is the head of the linked list * @return: ListNode head of the linked list */ public static ListNode deleteDuplicates(ListNode head) { if (head == null){ return head; } ListNode dummy = new ListNode(0); dummy.next = head; ListNode cur = dummy; while (cur.next != null && cur.next.next != null){ if (cur.next.val == cur.next.next.val){ int temp = cur.next.val; while (cur.next != null && cur.next.val == temp){ cur.next = cur.next.next; } } else { cur = cur.next; } } return dummy.next; } }
[LintCode] Remove Duplicates from Sorted List II
原文:http://www.cnblogs.com/tritritri/p/4971219.html