摘要：
class Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> levelOrder(TreeNode root) { dfs(root,1); return res; } public 阅读全文
posted @ 2020-07-10 11:27
Sexyomaru
阅读(101)
评论(0)
推荐(0)
摘要：
方法一：递归 class Solution { public boolean isSymmetric(TreeNode root) { if(root == null) return true; return isSame(root.left,root.right); } public boolea 阅读全文
posted @ 2020-07-10 11:19
Sexyomaru
阅读(72)
评论(0)
推荐(0)
摘要：
class Solution { public ListNode reverseBetween(ListNode head, int m, int n) { if(m == 1) { ListNode node = reverse(head,n); return node; } head.next 阅读全文
posted @ 2020-07-10 10:39
Sexyomaru
阅读(77)
评论(0)
推荐(0)
浙公网安备 33010602011771号