We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0c22a53 commit 5982d36Copy full SHA for 5982d36
1372.二叉树中的最长交错路径.js
@@ -0,0 +1,33 @@
1
+/**
2
+ * Definition for a binary tree node.
3
+ * function TreeNode(val) {
4
+ * this.val = val;
5
+ * this.left = this.right = null;
6
+ * }
7
+ */
8
9
+ * @param {TreeNode} root
10
+ * @return {number}
11
12
+var longestZigZag = function(root) {
13
+ let result = 0;
14
+ function dfs(node, direction, step) {
15
+ if (!node) {
16
+ return;
17
+ }
18
+
19
+ step++;
20
+ result = Math.max(result, step);
21
22
+ if (direction === 'l') {
23
+ dfs(node.right, 'r', step);
24
+ dfs(node.left, 'l', 0);
25
+ } else {
26
+ dfs(node.left, 'l', step);
27
+ dfs(node.right, 'r', 0);
28
29
30
+ dfs(root, 'l', -1);
31
+ dfs(root, 'r', -1);
32
+ return result;
33
+};
0 commit comments