Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given
Given
Given
1->1->2, return 1->2.Given
1->1->2->3->3, return 1->2->3.
01 public ListNode deleteDuplicates(ListNode head) {
02 if(head==null || head.next==null)
03 {
04 return head;
05 }
06 ListNode curr=head;
07 ListNode temp=null;
08 while(curr!=null)
09 {
10 temp=curr.next;
11 while(temp!=null && temp.val==curr.val)
12 {
13 temp=temp.next;
14 }
15 curr.next=temp;
16 curr=curr.next;
17 }
18 return head;
19 }
02 if(head==null || head.next==null)
03 {
04 return head;
05 }
06 ListNode curr=head;
07 ListNode temp=null;
08 while(curr!=null)
09 {
10 temp=curr.next;
11 while(temp!=null && temp.val==curr.val)
12 {
13 temp=temp.next;
14 }
15 curr.next=temp;
16 curr=curr.next;
17 }
18 return head;
19 }
没有评论:
发表评论