83. Remove Duplicates from Sorted List

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

Example 3:

Input: 1->1->1
Output: 1

题目本身很简单，但是处理链表的套路要学会：

1.使用辅助指针

2.使用递归

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if(head == null || head.next == null)
            return head;
        if(head.val == head.next.val) {
            //移动head头
            while(head != null && head.next != null&& head.val == head.next.val) {
                head = head.next;
            }
            head.next = deleteDuplicates(head.next);
        }else{
            head.next = deleteDuplicates(head.next);
        }
        return head;
    }

public static ListNode deleteDuplicatesV2(ListNode head) {
    ListNode current = head;
    while(current != null && current.next != null) {
        if(current.next.val == current.val) {
            current.next = current.next.next;
        } else {
            current = current.next;
        }
    }
    return head;
}

}