摘要： 160. 相交链表 https://leetcode.cn/problems/intersection-of-two-linked-lists/description/?envType=study-plan-v2&envId=top-100-liked public ListNode getInte 阅读全文

摘要： 53. 最大子数组和 https://leetcode.cn/problems/maximum-subarray/description/?envType=study-plan-v2&envId=top-100-liked public int maxSubArray(int[] nums) { i 阅读全文

摘要： 155. 最小栈 https://leetcode.cn/problems/min-stack/description/?envType=study-plan-v2&envId=top-100-liked class MinStack { Deque<Integer> deque; Priority 阅读全文

摘要： 513. 找树左下角的值 https://leetcode.cn/problems/find-bottom-left-tree-value/description/ public int findBottomLeftValue(TreeNode root) { int val = 0; Deque< 阅读全文

摘要： 215. 数组中的第K个最大元素 https://leetcode.cn/problems/kth-largest-element-in-an-array/description/?envType=study-plan-v2&envId=top-100-liked public int findKt 阅读全文

摘要： 110. 平衡二叉树 https://leetcode.cn/problems/balanced-binary-tree/description/ public boolean isBalanced(TreeNode root) { int balance = balance(root); retu 阅读全文

摘要： 35. 搜索插入位置 https://leetcode.cn/problems/search-insert-position/description/?envType=study-plan-v2&envId=top-100-liked public int searchInsert(int[] nu 阅读全文

摘要： 104. 二叉树的最大深度 https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/ public int maxDepth(TreeNode root) { return max(root); } public i 阅读全文

摘要： 226. 翻转二叉树 https://leetcode.cn/problems/invert-binary-tree/description/ public TreeNode invertTree(TreeNode root) { invert(root); return root; } publi 阅读全文

摘要： 二叉树的递归遍历 递归三要素：确定递归函数的参数和返回值，确定终止条件，确定单层递归的逻辑 144. 二叉树的前序遍历 https://leetcode.cn/problems/binary-tree-preorder-traversal/description/ public List<Integ 阅读全文