203. Remove Linked List Elements【E】【70】【leetcode】

sscssz

于 2016-03-19 15:19:35 发布

阅读量711

点赞数

分类专栏： leetcode Python 算法链表数据结构文章标签： leetcode python 链表

本文链接：https://blog.csdn.net/sscssz/article/details/50931186

版权

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

这个就是很plain地把它删掉，有两个地方需要注意

一个是需要加一个previous的节点

另一个是如果开头是val的话，怎么处理

class Solution(object):
    def removeElements(self, head, val):

        #h = head
        prv = ListNode(0)
        while head and head.val == val:
            head = head.next
        h = head
        while h:
            while h and h.val == val:
                prv.next = h.next
                #prv = prv.next
                h = h.next
                continue
            prv = h
            if h:
                h = h.next
        return head