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.
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29 |
/** * 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){ ListNode currentFirst = head; ListNode currentNode = head.next; while(currentNode != null){ if(currentFirst.val != currentNode.val){ currentFirst.next = currentNode; currentFirst = currentFirst.next; } currentNode = currentNode.next; } if(currentFirst.next != null) currentFirst.next = null; } return
head; }} |
leetcode--Remove Duplicates from Sorted List,布布扣,bubuko.com
leetcode--Remove Duplicates from Sorted List
原文：http://www.cnblogs.com/averillzheng/p/3767603.html