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 d39daa8 commit 8879d53Copy full SHA for 8879d53
2018.12.08-leetcode105/Sunny.md
@@ -0,0 +1,30 @@
1
+```java
2
+class Solution {
3
+
4
+ private int i = 0;
5
6
+ public TreeNode buildTree(int[] preorder, int[] inorder) {
7
+ if (preorder == null || preorder.length == 0)
8
+ return null;
9
+ int val = preorder[i];
10
+ int index = inorder.length - 1;
11
+ for (; index >= 0; index--) {
12
+ if (inorder[index] == val) {
13
+ break;
14
+ }
15
16
+ if (index >= 0) {
17
+ TreeNode node = new TreeNode(val);
18
+ i++;
19
+ if (inorder.length > 1 && i < preorder.length) {
20
+ node.left = buildTree(preorder, Arrays.copyOfRange(inorder, 0, index));
21
+ if (i < preorder.length) {
22
+ node.right = buildTree(preorder, Arrays.copyOfRange(inorder, index+1, inorder.length));
23
24
25
+ return node;
26
27
28
29
+}
30
+```
0 commit comments