Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given
Given
For example,
Given
1->1->2
, return 1->2
.Given
1->1->2->3->3
, return 1->2->3
.Solution:
public ListNode deleteDuplicates(ListNode head) {
if(head == null)
return head;
ListNode pre = head;
ListNode cur = head.next;
while(cur!=null)
{
if(cur.val==pre.val)
{
cur = cur.next;
pre.next = cur;
}
else
{
pre = pre.next;
cur = cur.next;
}
}
return head;
}
No comments:
Post a Comment