Leetcode

# 687. Longest Univalue Path

by hooni posted May 01, 2020
?

#### 단축키

Prev이전 문서

Next다음 문서

ESC닫기

크게 작게 위로 아래로 댓글로 가기 인쇄

Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.

The length of path between two nodes is represented by the number of edges between them.

Example 1:

Input:

```              5
/ \
4   5
/ \   \
1   1   5
```

Output: 2

Example 2:

Input:

```              1
/ \
4   5
/ \   \
4   4   5
```

Output: 2

Note: The given binary tree has not more than 10000 nodes. The height of the tree is not more than 1000.

```/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
class Solution {
int length;

public int longestUnivaluePath(TreeNode root) {
if(root == null){
return 0;
}

length = 0;
findLength(root);

return length;
}

public int findLength(TreeNode node){
if(node == null){
return 0;
}

int left = findLength(node.left);
int right = findLength(node.right);

int currLeft = 0;
int currRight = 0;

if(node.left != null && node.left.val == node.val){
currLeft = left + 1;
}

if(node.right != null && node.right.val == node.val){
currRight = right + 1;
}

if(length < currLeft + currRight){
length = currLeft + currRight;
}

return Math.max(currLeft, currRight);
}
}
```

1 2 3 4