Scribbling

LeetCode: 117. Populating Next Right Pointers in Each Node II 본문

Computer Science/Coding Test

LeetCode: 117. Populating Next Right Pointers in Each Node II

focalpoint 2021. 11. 3. 20:07 
"""
# Definition for a Node.
class Node:
    def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
        self.val = val
        self.left = left
        self.right = right
        self.next = next
"""

class Solution:
    def connect(self, root: 'Node') -> 'Node':
        self.helper(root)
        return root
        
    def helper(self, node):
        if not node:
            return
        leftmost, prev = None, None
        cur = node
        while cur:
            if cur.left:
                if not leftmost:
                    leftmost, prev = cur.left, cur.left
                else:
                    prev.next = cur.left
                    prev = cur.left
            if cur.right:
                if not leftmost:
                    leftmost, prev = cur.right, cur.right
                else:
                    prev.next = cur.right
                    prev = cur.right
            cur = cur.next   
        self.helper(leftmost)

 

저작자표시

'Computer Science > Coding Test' 카테고리의 다른 글

LeetCode: 122. Best Time to Buy and Sell Stock II  (0) 2021.11.03
LeetCode: 120. Triangle  (0) 2021.11.03
프로그래머스: 징검다리  (0) 2021.11.03
프로그래머스: 입국심사  (0) 2021.11.02
LeetCode: 116. Populating Next Right Pointers in Each Node  (0) 2021.11.02
'Computer Science/Coding Test' Related Articles more