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
.
先写了一个用extra space的方法,
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null)
return null;
ListNode newHead = new ListNode(head.val);
ListNode previous = newHead;
ListNode node = head;
while(node.next != null){
node = node.next;
if(node.val == previous.val)
continue;
else{
ListNode newNode = new ListNode(node.val);
previous.next = newNode;
previous = newNode;
}
}
return newHead;
}
}
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null)
return null;
ListNode node = head;
while(node.next != null){
if(node.val == node.next.val){
node.next = node.next.next;
}
else{
node = node.next;
}
}
return head;
}
}