别人的做法,,,,
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def removeElements(self, head: ListNode, val: int) -> ListNode: dummy = ListNode(0) dummy.next = head prev = dummy last = prev.next while last : if last.val == val: prev.next = last.next last = prev.next else: prev = prev.next last = prev.next return dummy.next
执行用时 :108 ms, 在所有 python3 提交中击败了27.51%的用户
内存消耗 :16.9 MB, 在所有 python3 提交中击败了12.81%的用户