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

设置2个指针，cur 和next。

当cur的值与next的值相等时，cur.next= next.next   更新next = next.next;

当cur的值与next的值不等时，cur = next   更新next = next.next;

 public class Solution {
     public ListNode deleteDuplicates(ListNode head) {
         if(head == null ||head.next == null) return head;
         ListNode cur = head;
         ListNode next = head.next;
         while(next != null){
             if(cur.val == next.val)
                 cur.next = next.next;
             else cur = next;
         next = next.next;
         }
         return head;
     }