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

LeetCode#203 Count Prime

时间:2015-07-17 16:01:00      阅读:102      评论:0      收藏:0      [点我收藏+]

标签:

Problem Definition:

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

Solution: 构造一个头节点

def removeElements(self, head, val):
        fake=ListNode(0)
        fake.next=head
        pb=fake
        p=head
        while p!=None:
            if p.val==val:
                pb.next=p.next #delete
            else:
                pb=p           #skip
            p=p.next
        return fake.next

 

LeetCode#203 Count Prime

标签:

原文地址:http://www.cnblogs.com/acetseng/p/4654550.html

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