Remove Duplicates from Sorted List

 

题目：

 

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.

思路：

用两个指针p和q，开始时q处在p的后一位，当p的值和q的值相等时，q往后移，不等时p.next = q，然后把p指向q，q再往后移一位，重复前面的过程，q等于null时结束，具体代码如下：

 

/**
 * 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) {
        if(head == null) {
            return null;
        }
        ListNode p = head,q = head;
        while(q != null) {
            q = q.next;//放在这里没放在下面是为了防止当q为null时空指针异常
            while(q != null && p.val == q.val) {
                q = q.next;
            }
            p.next = q;
            p = q;
        }
        return head;
    }
}

 

也可以只用一个指针，代码如下（Python实现）：

 

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        t = head
        while t != None:
            while t.next != None and t.val == t.next.val:
                t.next = t.next.next
            t = t.next # 这时t和t.next指向同一个元素
            if t != None:
                t.next = t.next
        return head