剑指Offer 18 删除链表的节点

删除链表的节点

在一个排序的链表中，存在重复的结点，请删除该链表中重复的结点，重复的结点不保留，返回链表头指针。 例如，链表1->2->3->3->4->4->5 处理后为 1->2->5

class Solution:
    def deleteDuplication(self, pHead):
        if pHead == None or pHead.next == None:
            return pHead
        n = pHead.next
        if pHead.val == n.val:
            while n and pHead.val == n.val:
                n = n.next
            return self.deleteDuplication(n)
        else:
            pHead.next = self.deleteDuplication(pHead.next)
            return pHead
        # write code here

 

leetcode上的Java版本，此题对比原题有改动：

class Solution {
    public ListNode deleteNode(ListNode head, int val) {
        if (head == null) {
            return null;
        }
        ListNode dHead = new ListNode(-1);
        dHead.next = head;
        ListNode temp = dHead;
        while (temp.next != null) {
            int cur = temp.next.val;
            if (cur == val) {
                temp.next = temp.next.next;
                return dHead.next;
            }
            temp = temp.next;
        }
        return null;
    }
}