Lintcode LinkedList 113 Remove Duplicates from Sorted List II

Java Version
不能只写while (node.next.next!=null) 否则下述情况不成立，因为node为2，2的next为null就要终止
0->1->2->3->3->4->4->null
不能单单考虑下述情况
0->1->2->3->3->3->4->null

不同于 Lintcode 112 Remove Duplicates from Sorted List if(node->val == node->next->val) 本结点和下一个比较

if (node.next.val == node.next.next.val) 是比较node的下一个和下下个

/**

• 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) {
    // write your code here
    ListNode dummy = new ListNode(0);
    if (head == null) {
        return null;
    }
    dummy.next = head;
    ListNode node = dummy;
    while (node.next != null && node.next.next!=null) {
        if (node.next.val == node.next.next.val) {
            int val = node.next.val;
            while(node.next!=null && node.next.val == val)
            node.next = node.next.next;
        } else {
            node = node.next;
        }
    }
    return dummy.next;

}

}

C++ version 注意C++ NULL 而不是null

/**

• Definition of ListNode

• class ListNode {

• public:

• int val;

• ListNode *next;

• ListNode(int val) {

• this->val = val;

• this->next = NULL;

• }

• }*/

class Solution{public:

/**
 * @param head: The first node of linked list.
 * @return: head node
 */
ListNode * deleteDuplicates(ListNode *head) {
    // write your code here
    ListNode * dummy = new ListNode(0);
    dummy->next = head;
    head = dummy;
    while(head->next!=NULL && head->next->next!=NULL){
        if(head->next->val == head->next->next->val){
            int val = head->next->val;
            while(head->next!=NULL && head->next->val == val)
            head->next = head->next->next;
        }
        else
        head = head->next;
    }
    return dummy->next;
}

};