mirror of
https://github.com/Snailclimb/JavaGuide
synced 2025-06-20 22:17:09 +08:00
50 lines
1.8 KiB
Markdown
50 lines
1.8 KiB
Markdown
# 数组
|
||
|
||
704.二分查找：https://leetcode.cn/problems/binary-search/
|
||
|
||
80.删除有序数组中的重复项II：https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii
|
||
|
||
977.有序数组的平方：https://leetcode.cn/problems/squares-of-a-sorted-array/
|
||
|
||
# 链表
|
||
|
||
707.设计链表：https://leetcode.cn/problems/design-linked-list/
|
||
|
||
206.反转链表：https://leetcode.cn/problems/reverse-linked-list/
|
||
|
||
92.反转链表II：https://leetcode.cn/problems/reverse-linked-list-ii/
|
||
|
||
61.旋转链表：https://leetcode.cn/problems/rotate-list/
|
||
|
||
# 栈与队列
|
||
|
||
232.用栈实现队列：https://leetcode.cn/problems/implement-queue-using-stacks/
|
||
|
||
225.用队列实现栈：https://leetcode.cn/problems/implement-stack-using-queues/
|
||
|
||
347.前K个高频元素：https://leetcode.cn/problems/top-k-frequent-elements/
|
||
|
||
239.滑动窗口最大值：https://leetcode.cn/problems/sliding-window-maximum/
|
||
|
||
# 二叉树
|
||
|
||
105.从前序与中序遍历构造二叉树：https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
|
||
|
||
117.填充每个节点的下一个右侧节点指针II：https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii
|
||
|
||
236.二叉树的最近公共祖先：https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
|
||
|
||
129.求根节点到叶节点数字之和：https://leetcode.cn/problems/sum-root-to-leaf-numbers/
|
||
|
||
102.二叉树的层序遍历：https://leetcode.cn/problems/binary-tree-level-order-traversal/
|
||
|
||
530.二叉搜索树的最小绝对差：https://leetcode.cn/problems/minimum-absolute-difference-in-bst/
|
||
|
||
# 图
|
||
|
||
200.岛屿数量：https://leetcode.cn/problems/number-of-islands/
|
||
|
||
207.课程表：https://leetcode.cn/problems/course-schedule/
|
||
|
||
210.课程表II：https://leetcode.cn/problems/course-schedule-ii/
|