83. Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

删除已经排序的list的重复val的node，保证每个val只出现一次。注意这里list已经排好序，所以只需要判断currNode和currNode.next的val相不相等，想等的话把currNode.next删除就好。代码如下：

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

如果这道题给的list没有排序，那么就要用到hashset来判断这个val有没有出现过，代码如下：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        HashSet<Integer> hs = new HashSet<Integer>();
        ListNode fakeHead = new ListNode(-1);
        fakeHead.next = head;
        ListNode currNode = fakeHead;
        while (currNode != null && currNode.next != null) {
            if (hs.contains(currNode.next.val)) {
                currNode.next = currNode.next.next;
            } else {
                hs.add(currNode.next.val);
                currNode = currNode.next;
            }
        }
        return fakeHead.next;
    }
}