码迷,mamicode.com
首页 > 其他好文 > 详细

lintcode-easy-Remove Duplicates from Sorted List

时间:2016-03-06 09:55:15      阅读:137      评论:0      收藏:0      [点我收藏+]

标签:

Given a sorted linked list, delete all duplicates such that each element appear only once.

Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

/**
 * Definition for ListNode
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param ListNode head is the head of the linked list
     * @return: ListNode head of linked list
     */
    public static ListNode deleteDuplicates(ListNode head) { 
        // write your code here
        if(head == null || head.next == null)
            return head;
        
        ListNode new_head = new ListNode(head.val);
        ListNode p1 = new_head;
        ListNode p2 = head.next;
        
        while(p2 != null){
            if(p2.val == p1.val){
                p2 = p2.next;
            }
            else{
                p1.next = new ListNode(p2.val);
                p1 = p1.next;
                p2 = p2.next;
            }
        }
        
        return new_head;
    }  
}

 

lintcode-easy-Remove Duplicates from Sorted List

标签:

原文地址:http://www.cnblogs.com/goblinengineer/p/5246544.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!