摘要：
public class Solution { public TreeNode buildTree(int[] inorder, int[] postorder) { return buildTree(inorder, 0, inorder.length-1, postorder, 0, postorder.length-1); } private TreeNo... 阅读全文
posted @ 2017-09-29 12:30
Weiyu Wang
阅读(109)
评论(0)
推荐(0)
摘要：
public class Solution { public TreeNode buildTree(int[] preorder, int[] inorder) { return buildTree(preorder, 0, preorder.length-1, inorder, 0, inorder.length); } private TreeNode bu... 阅读全文
posted @ 2017-09-29 12:12
Weiyu Wang
阅读(119)
评论(0)
推荐(0)
摘要：
class Solution { public List> zigzagLevelOrder(TreeNode root) { List> res=new ArrayList>(); if(root==null) return res; Queue queue=new LinkedList(); Li... 阅读全文
posted @ 2017-09-29 11:36
Weiyu Wang
阅读(119)
评论(0)
推荐(0)
摘要：
class Solution { public List> levelOrder(TreeNode root) { List> res=new ArrayList>(); if(root==null) return res; Queue queue=new LinkedList(); queue.ad... 阅读全文
posted @ 2017-09-29 11:27
Weiyu Wang
阅读(121)
评论(0)
推荐(0)
摘要：
class Solution { public void recoverTree(TreeNode root) { TreeNode cur=root,pre=null,node1=null,node2=null, p=null; while(cur!=null) { if(cur.left!=null) ... 阅读全文
posted @ 2017-09-29 10:01
Weiyu Wang
阅读(105)
评论(0)
推荐(0)
摘要：
public class Solution { public boolean isValidBST(TreeNode root) { Stack stack=new Stack(); TreeNode cur=null; while(root!=null||!stack.isEmpty()) { ... 阅读全文
posted @ 2017-09-29 06:32
Weiyu Wang
阅读(143)
评论(0)
推荐(0)
摘要：
class Solution { public boolean isInterleave(String s1, String s2, String s3) { if(s1.length()+s2.length()!=s3.length()) return false; boolean [][] dp=new boolean[s1.l... 阅读全文
posted @ 2017-09-29 06:20
Weiyu Wang
阅读(121)
评论(0)
推荐(0)
摘要：
public class Solution { public int numTrees(int n) { int[] dp=new int[n+1]; dp[0]=1; dp[1]=1; for(int i=2;i<=n;i++) for(int j=1;j<=i;j++) ... 阅读全文
posted @ 2017-09-29 02:30
Weiyu Wang
阅读(130)
评论(0)
推荐(0)
摘要：
class Solution { public List generateTrees(int n) { if(n==0) return new ArrayList(); return generateTrees(1, n); } private List generateTrees(int i, int j) { ... 阅读全文
posted @ 2017-09-29 02:19
Weiyu Wang
阅读(145)
评论(0)
推荐(0)
摘要：
public class Solution { public List inorderTraversal(TreeNode root) { List res=new ArrayList(); Stack stack=new Stack(); while(root!=null||!stack.isEmpty()) { ... 阅读全文
posted @ 2017-09-29 02:01
Weiyu Wang
阅读(167)
评论(0)
推荐(0)
摘要：
class Solution { public List restoreIpAddresses(String s) { List res=new ArrayList(); restoreIpAddresses("", 0, 0, s, res); return res; } private void restoreIpAdd... 阅读全文
posted @ 2017-09-29 01:52
Weiyu Wang
阅读(176)
评论(0)
推荐(0)
浙公网安备 33010602011771号