自己1:采用遍历链表的方法来逐一对比值,将值相等的元素删除。
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def removeElements(self, head, val):
"""
:type head: ListNode
:type val: int
:rtype: ListNode
"""
head_ = ListNode(-1)
head_.next = head
pre = head_
curr = pre.next
while curr:
if curr.val == val:
curr = curr.next
pre.next = curr
else:
curr = curr.next
pre = pre.next
return head_.next