Given a sorted linked list, delete all duplicates such that each element appear only once.node
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.app
/**
* 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 node = head;
//ListNode current = node;
while(node.next != null){
if(node.val != node.next.val)
node = node.next;
else
node.next = node.next.next;
}
return head;
}
}code