2015年03月_yoohoosome

原创 [刷题]Remove Node in Binary Search Tree

[LintCode]Remove Node in Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-03-31 22:29:45 345

原创 [刷题]Search Range in Binary Search Tree

[LintCode]Search Range in Binary Search Tree VERSION I /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(i

2015-03-30 19:15:22 395

原创 [刷题]Insert Node in a Binary Search Tree

[LintCode]Insert Node in a Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val)

2015-03-30 18:50:20 298 1

原创 [刷题]Binary Tree Zigzag Level Order Traversal

[LintCode]Binary Tree Zigzag Level Order Traversal /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int va

2015-03-26 17:42:28 310 1

原创 [刷题]Binary Tree Level Order Traversal II

[LintCode]Binary Tree Level Order Traversal II /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) {

2015-03-26 17:17:48 304 1

原创 [刷题]Lowest Common Ancestor

[LintCode]Lowest Common Ancestor /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * th

2015-03-23 21:44:36 344 1

原创 [刷题]Binary Tree Maximum Path Sum

[LintCode]Binary Tree Maximum Path Sum /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-03-23 19:42:35 447 1

原创 [刷题]Balanced Binary Tree

[LintCode]Balanced Binary Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.v

2015-03-23 17:03:30 333 1

原创 [刷题]Maximum Depth of Binary Tree

[LintCode]Maximum Depth of Binary Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-03-23 14:46:59 322 1

原创 [刷题]Binary Tree Postorder Traversal

[LintCode]Binary Tree Postorder Traversal /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-03-22 17:21:58 302 1

原创 [刷题]Binary Tree Inorder Traversal

[LintCode]Binary Tree Inorder Traversal /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-03-22 17:17:26 289 1

原创 [刷题]Binary Tree Preorder Traversal

[LintCode]Binary Tree Preorder Traversal 答案 /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-03-22 16:06:03 295 1

原创 [刷题]Binary Tree Level Order Traversal

[LintCode]Binary Tree Level Order Traversal 答案 /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val

2015-03-22 11:40:23 264 1

class Solution { /** * @param nums: A list of integers. * @return: A list of permutations. */ public ArrayList permute(ArrayList nums) { // 2015-3-18 ArrayList rst = new ArrayList<>(); if (nums == nul

2015-03-20 18:05:40 281 1

willshine19的专栏