Leetcode
2020.05.01 20:27

# 687. Longest Univalue Path

조회 수 389 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

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

#### 단축키

Prev이전 문서

Next다음 문서

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

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. 720. Longest Word in Dictionary

2. 225. Implement Stack using Queues

3. 56. Merge Intervals

4. 844. Backspace String Compare

5. 222. Count Complete Tree Nodes

6. 697. Degree of an Array

7. 605. Can Place Flowers

8. 724. Find Pivot Index

9. 448. Find All Numbers Disappeared in an Array

10. 628. Maximum Product of Three Numbers

11. 532. K-diff Pairs in an Array

12. 897. Increasing Order Search Tree

13. 872. Leaf-Similar Trees

14. 876. Middle of the Linked List

15. 203. Remove Linked List Elements

16. 997. Find the Town Judge

17. 270. Closest Binary Search Tree Value

18. 687. Longest Univalue Path

19. 783. Minimum Distance Between BST Nodes

20. 235. Lowest Common Ancestor of a Binary Search Tree

Board Pagination Prev 1 2 3 4 Next
/ 4