forked from hongtaocai/code_interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinorder_postorder.java
More file actions
executable file
·31 lines (30 loc) · 1.02 KB
/
inorder_postorder.java
File metadata and controls
executable file
·31 lines (30 loc) · 1.02 KB
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
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
// Start typing your Java solution below
// DO NOT write main() function
if(inorder.length==0 || postorder.length==0) return null;
int middle = postorder[postorder.length-1];
int index = -1;
for(int i=0;i<inorder.length;i++){
if(inorder[i]==middle){
index = i;
break;
}
}
TreeNode left = buildTree(Arrays.copyOfRange(inorder,0,index), Arrays.copyOfRange(postorder,0,index));
TreeNode right = buildTree(Arrays.copyOfRange(inorder,index+1,inorder.length), Arrays.copyOfRange(postorder,index,postorder.length-1));
TreeNode current = new TreeNode(middle);
current.left = left;
current.right = right;
return current;
}
}