摘要：
public int subarraySum(int[] nums, int k) { int len = nums.length, ans = 0, pre = 0; Map<Integer, Integer> map = new HashMap<>(); map.put(0,1); for(in 阅读全文
摘要：
public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> res = new ArrayList(); if(root == null) return res; Deque<TreeNode> q = new 阅读全文
摘要：
public List<Integer> largestValues(TreeNode root) { List<Integer> list = new ArrayList(); if(root == null) return list; Deque<TreeNode> q = new Linked 阅读全文
摘要：
public List<Integer> rightSideView(TreeNode root) { List<Integer> list = new ArrayList(); if(root == null) return list; Deque<TreeNode> q = new Linked 阅读全文
摘要：
public List<List<Integer>> levelOrder(Node root) { List<List<Integer>> res = new ArrayList(); if(root == null) return res; Deque<Node> q = new LinkedL 阅读全文
摘要：
public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> res = new ArrayList(); if(root == null) return res; Deque<TreeNode> q = new 阅读全文
摘要：
public Node connect(Node root) { Deque<Node> q = new LinkedList(); if(root == null) return root; q.offer(root); while(!q.isEmpty()) { int size = q.siz 阅读全文
摘要：
public int maxDepth(TreeNode root) { int ans = 0; if(root == null) return 0; Deque<TreeNode> q = new LinkedList(); q.offer(root); while(!q.isEmpty()) 阅读全文
摘要：
public Node connect(Node root) { if(root == null) return root; Deque<Node> q = new LinkedList(); q.offer(root); while(!q.isEmpty()) { int size = q.siz 阅读全文
摘要：
public int minDepth(TreeNode root) { int depth = 0; if(root == null) return depth; Deque<TreeNode> q = new LinkedList(); q.offer(root); while(!q.isEmp 阅读全文