首页 > 其他 > 详细

LeetCode-Remove Duplicates from Sorted List

时间:2016-05-05 00:17:13      阅读:170      评论: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.

这道题考察链表的操作,不难

/**
 * 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 dummy=new ListNode(0);
        dummy.next=head;
        ListNode dp=dummy.next;
        ListNode previous=null;
        while(dp!=null){
            if(previous!=null){
                if(dp.val==previous.val){
                    previous.next=dp.next;
                }
                else{
                    previous=dp;
                }
            }
            else{
                previous=dp;
            }
            dp=dp.next;
        }
        return dummy.next;
    }
}

 

LeetCode-Remove Duplicates from Sorted List

原文:http://www.cnblogs.com/incrediblechangshuo/p/5460287.html

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