-
Notifications
You must be signed in to change notification settings - Fork 120
/
Copy path0687-LongestUnivaluePath.cs
56 lines (48 loc) · 1.52 KB
/
0687-LongestUnivaluePath.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
//-----------------------------------------------------------------------------
// Runtime: 172ms
// Memory Usage: 44.5 MB
// Link: https://leetcode.com/submissions/detail/358747421/
//-----------------------------------------------------------------------------
using System;
namespace LeetCode
{
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class _0687_LongestUnivaluePath
{
private int result = 0;
public int LongestUnivaluePath(TreeNode root)
{
result = 0;
GetLenght(root);
return result;
}
private int GetLenght(TreeNode node)
{
if (node == null) return 0;
var leftLength = GetLenght(node.left);
var rightLength = GetLenght(node.right);
if (node.left != null && node.left.val == node.val)
leftLength++;
else
leftLength = 0;
if (node.right != null && node.right.val == node.val)
rightLength++;
else
rightLength = 0;
result = Math.Max(result, leftLength + rightLength);
return Math.Max(leftLength, rightLength);
}
}
}