Update _687.java (fishercoder1534#25)

jianminchen · fishercoder1534 · commit 15c6ec169579 · 2018-10-19T23:19:50.000-07:00
change dfs function name to meaningful name, calculateLongestUnivaluePathFromRootToLeaves, and also additional calculation of max univalue path cross the root node should be specified somehow, one or two comments should be very helpful.
diff --git a/src/main/java/com/fishercoder/solutions/_687.java b/src/main/java/com/fishercoder/solutions/_687.java
@@ -47,7 +47,9 @@ public int longestUnivaluePath(TreeNode root) {
             }
             return result[0];
         }
-
+        
+        // calculate longest univalue path from root to leaves
+        // In addition, the maximum univalue path cross the root node is calculated and then global maximum is udpated.
         private int dfs(TreeNode root, int[] result) {
             int leftPath = root.left == null ? 0 : dfs(root.left, result);
             int rightPath = root.right == null ? 0 : dfs(root.right, result);

Original file line number	Diff line number	Diff line change
`@@ -47,7 +47,9 @@ public int longestUnivaluePath(TreeNode root) {`
`47`	`47`	`}`
`48`	`48`	`return result[0];`
`49`	`49`	`}`
`50`		`-`
	`50`	`+`
	`51`	`+ // calculate longest univalue path from root to leaves`
	`52`	`+ // In addition, the maximum univalue path cross the root node is calculated and then global maximum is udpated.`
`51`	`53`	`private int dfs(TreeNode root, int[] result) {`
`52`	`54`	`int leftPath = root.left == null ? 0 : dfs(root.left, result);`
`53`	`55`	`int rightPath = root.right == null ? 0 : dfs(root.right, result);`