[LeetCode]longest univalue path (완료)

문제 링크

문제 풀이

Recursive하게 짜는 방법 고민

Class 내 global 변수(전역 변수) 놓고 푸는 방법 고민


# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object): def longestUnivaluePath(self, root): """ :type root: TreeNode :rtype: int """ self.result = 0 def traverse(node) : if not node : return 0

        left, right = traverse(node.left), traverse(node.right)

        if node.left and node.val == node.left.val :
            left_len = left + 1
        else :
            left_len = 0

        if node.right and node.val == node.right.val :
            right_len = right + 1
        else :
            right_len = 0

        self.result = max(self.result, left_len + right_len)
        return max(left_len, right_len)

    traverse(root)
    return self.result

yeonghwanjeon / coding_practice

[LeetCode]longest univalue path (완료) #58