筱维の码场

public class test19{ public TreeNode invertTree(TreeNode root) { if(root == null) return root; if(root.left == null && root.right == null) return root; TreeNode temp = root.le...

public class test20{ public List<Integer> spiralOrder(int[][] matrix) { List answer = new ArrayList(); if(matrix.length == 0) return answer; int rows = m...

public class test25 { public boolean hasPathSum(TreeNode root, int sum) { if(root == null) return false; if(root.left == null && root.right == null && ...