Remove all elements from a linked list of integers that have value val.
Example:
Input: 1->2->6->3->4->5->6, val = 6 Output: 1->2->3->4->5
Solution
1. 사실 아직 잘 이해가 가지않는다. LinkedList를 공부하고 다시풀어보자.
#(3) Remove Linked List Elements
# Definition for singly-linked list.
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class Solution:
def removeElements(self, head: ListNode, val: int) -> ListNode:
dummy = ListNode(0)
dummy.next = head
node = dummy
while node.next:
if node.next.val == val:
node.next = node.next.next
else:
node = node.next
return dummy.next
'알고리즘 > LeetCode' 카테고리의 다른 글
[LeetCode] Binary Tree Zigzag Level Order Traversal (0) | 2020.07.23 |
---|---|
[LeetCode] Word Search (0) | 2020.07.22 |
[LeetCode] Add Binary (0) | 2020.07.20 |
[LeetCode] Course Schedule II (0) | 2020.07.19 |
[LeetCode] Top K Frequent Elements (0) | 2020.07.18 |
댓글