Anrys的博客

剑指offer--69 II 二叉树的最近公共祖先题目代码结果题目代码class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if (root == null) return null; if (root == p || root == q) return root; //两个递归返回的是root！

剑指offer--26树的子结构题目代码结果题目代码class Solution { public boolean isSubStructure(TreeNode A, TreeNode B) { if (B == null || A == null) return false; if (A.val == B.val && (helper(A.left, B.left) && helper(A.right, B.right)))

java刷题--200岛屿数量题目代码结果题目代码class Solution { public int numIslands(char[][] grid) { int islandNum = 0; for(int i = 0; i < grid.length; i++){ for(int j = 0; j < grid[0].length; j++){ if(grid[i][j] == '1

java刷题-剑指offer 07 重建二叉树题目代码结果题目代码class Solution { public TreeNode buildTree(int[] preorder, int[] inorder) { int n = preorder.length; if (n == 0) return null; int rootVal = preorder[0], rootIndex = 0; for (int i = 0;

java刷题--剑指offer 10 青蛙跳台阶问题题目代码结果题目代码class Solution { public int numWays(int n) { if(n==0) return 1; int f1 = 1, f2 = 1; for(int i = 2; i < n+1; i++) { int temp = (f1 + f2)%1000000007; f1 = f2 ;

java刷题--77 组合题目代码结果题目代码public class Solution { List<List<Integer>> ans = new ArrayList<>(); public List<List<Integer>> combine(int n, int k) { dfs(k, 1, n-k+1,new ArrayList<Integer>()); //k用来监视是否达到长度要

java刷题--47 全排列II题目代码结果题目代码public class Solution { List<List<Integer>> res = new ArrayList<List<Integer>>(); public List<List<Integer>> permuteUnique(int[] nums) { if(nums==null || nums.length==0) retu

java刷题--111 二叉树的最小深度题目代码结果题目代码class Solution { public int minDepth(TreeNode root) { if(root==null) return 0; if(root.left==null && root.right!=null) return 1+minDepth(root.right); if(root.right==null && root.

java刷题--104二叉树的最大深度题目代码结果题目代码class Solution { public int maxDepth(TreeNode root) { if (root == null) return 0; int left = maxDepth(root.left); int right = maxDepth(root.right); return Math.max(left, right) +