首页 > 其他 > 详细

Leetcode-Remove Duplicates from Sorted List

时间:2014-11-16 08:11:21      阅读:174      评论:0      收藏:0      [点我收藏+]

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.

Solution:

 1 /**
 2  * Definition for singly-linked list.
 3  * public class ListNode {
 4  *     int val;
 5  *     ListNode next;
 6  *     ListNode(int x) {
 7  *         val = x;
 8  *         next = null;
 9  *     }
10  * }
11  */
12 public class Solution {
13     public ListNode deleteDuplicates(ListNode head) {
14         if (head==null || head.next==null) return head;
15         ListNode preHead = new ListNode(-1);
16         preHead.next = head;
17         ListNode cur = head;
18         ListNode pre = preHead;
19         
20         while (cur.next!=null){
21             if (cur.val==cur.next.val){
22                 while (cur.val==cur.next.val){
23                     cur.next = cur.next.next;
24                     if (cur.next==null)
25                         break;
26                 }
27             } else {
28                 pre = cur;
29                 cur = cur.next;
30             }
31         }
32 
33         return preHead.next;           
34         
35     }
36 }

 

Leetcode-Remove Duplicates from Sorted List

原文:http://www.cnblogs.com/lishiblog/p/4100962.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!