合集-LeetCode Hot100
摘要：1.两数之和 https://leetcode.cn/problems/two-sum/description/?envType=study-plan-v2&envId=top-100-liked public int[] twoSum(int[] nums, int target) { HashM
阅读全文
摘要：283. 移动零 https://leetcode.cn/problems/move-zeroes/description/?envType=study-plan-v2&envId=top-100-liked public void moveZeroes(int[] nums) { int r =
阅读全文
摘要：73. 矩阵置零 https://leetcode.cn/problems/set-matrix-zeroes/description/?envType=study-plan-v2&envId=top-100-liked public void setZeroes(int[][] matrix) {
阅读全文
摘要：35. 搜索插入位置 https://leetcode.cn/problems/search-insert-position/description/?envType=study-plan-v2&envId=top-100-liked public int searchInsert(int[] nu
阅读全文
摘要：215. 数组中的第K个最大元素 https://leetcode.cn/problems/kth-largest-element-in-an-array/description/?envType=study-plan-v2&envId=top-100-liked public int findKt
阅读全文
摘要：155. 最小栈 https://leetcode.cn/problems/min-stack/description/?envType=study-plan-v2&envId=top-100-liked class MinStack { Deque<Integer> deque; Priority
阅读全文
摘要：53. 最大子数组和 https://leetcode.cn/problems/maximum-subarray/description/?envType=study-plan-v2&envId=top-100-liked public int maxSubArray(int[] nums) { i
阅读全文
摘要：160. 相交链表 https://leetcode.cn/problems/intersection-of-two-linked-lists/description/?envType=study-plan-v2&envId=top-100-liked public ListNode getInte
阅读全文
摘要：70. 爬楼梯 https://leetcode.cn/problems/climbing-stairs/description/?envType=study-plan-v2&envId=top-100-liked public int climbStairs(int n) { if (n <= 1
阅读全文
摘要：94. 二叉树的中序遍历 https://leetcode.cn/problems/binary-tree-inorder-traversal/description/?envType=study-plan-v2&envId=top-100-liked // 递归 // List<Integer>
阅读全文
浙公网安备 33010602011771号