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

.

思想：如果temp.next存在，temp.val==temp.next.val  则temp.next=temp.next.next; 且continue跳过temp=temp.next否则当结尾为三个重复数字时会忽略一个，比如455777

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