leetcode 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.

/**
 * 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) {
    if(head == null) {
      return null;
    }
    if(head.next == null) {
      return head;
    }

    // 保存第一个节点
    ListNode first = head;
    ListNode cur = head;
    ListNode next = null;
    // 循环直到倒数第一个节点
    while(cur.next != null) {
      next = cur.next;
      // 如果相等就连接下一个
      if(next.val == cur.val) {
        cur.next = next.next;
      }
      // 不相等，那okay，把当前节点设置为后续节点继续进行判断
      else {
        cur = cur.next;
      }
    }
    return first;
  }
}