摘要：
List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> levelOrder(TreeNode root) { if(root == null) return res; Deque<TreeNode> queue 阅读全文
posted @ 2020-08-17 23:30
欣姐姐
阅读(111)
评论(0)
推荐(0)
摘要：
class Solution { public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> res = new ArrayList<>(); if(root == null) return res; Queu 阅读全文
posted @ 2020-08-17 22:23
欣姐姐
阅读(96)
评论(0)
推荐(0)
摘要：
public int[] levelOrder(TreeNode root) { Deque<TreeNode> deque = new ArrayDeque<>(); ArrayList<Integer> res = new ArrayList<>(); if(root != null){ deq 阅读全文
posted @ 2020-08-17 22:11
欣姐姐
阅读(82)
评论(0)
推荐(0)
摘要：
public boolean validateStackSequences(int[] pushed, int[] popped) { int m = pushed.length; int n = popped.length; if(m!=n) return false; if(m == 1) re 阅读全文
posted @ 2020-08-17 21:15
欣姐姐
阅读(171)
评论(0)
推荐(0)
浙公网安备 33010602011771号