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.Solution:
/**
* 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) {
ListNode pointer = head;
while(pointer!=null && pointer.next!=null)
{
if (pointer.val== pointer.next.val)
pointer.next= pointer.next.next;
else
pointer = pointer.next;
}
return head;
}
}
No comments :
Post a Comment