Remove Duplicates from Sorted List -LeetCode

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.

 

已犯错误： 27行。加上27的原因是当duplicate出现在尾节点时，需要将尾节点删掉。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if(head==null) return null;
        ListNode cur=head.next;
        ListNode prev=head;
        
        while(cur!=null){
            if(cur.val==prev.val){
                cur=cur.next;
                continue;
            }
            prev.next=cur;
            prev=prev.next;
            cur=cur.next;
        }
        prev.next=null;
        return head;
    }
}