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.
給定一個(gè)排好序的鏈表鸽凶，刪除所有重復(fù)的元素呐籽。
算法分析
本題重點(diǎn)在給定的鏈表已經(jīng)排序碍遍，因此只要從頭開始刪除重復(fù)的元素即可美侦，即current.val == current.next.next，就刪除，current.next = current.next.next梦裂。
Java代碼
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode current = head;
while (current != null && current.next != null) {//
if (current.val != current.next.val) {
current = current.next;
} else {
current.next = current.next.next;
}
}
return head;
}
}
