LeetCode题目分类
数组
- 1.两数之和(Two Sum)E
- 46. 全排列(Permutations)M
- 47. 全排列 II(Permutations II)M
- 53. 最大子数组和(Maximum Subarray)E
- 54. 螺旋矩阵(Spiral Matrix)M
- 56. 合并区间(Merge Intervals)M
- 88. 合并两个有序数组(Merge Sorted Array)E
- 121. 买卖股票的最佳时机(Best Time to Buy and Sell Stock)E
- 200. 岛屿数量(Number of Islands)M
- 300. 最长上升子序列(Longest Increasing Subsequence)M
- 704. 二分查找(Binary Search)E
栈
- 20. 有效的括号(Valid Parentheses)E
- 94. 二叉树的中序遍历(Binary Tree Inorder Traversal)E
- 144. 二叉树的前序遍历(Binary Tree Preorder Traversal)E
- 145. 二叉树的后序遍历(Binary Tree Postorder Traversal)E
- 206.反转链表(Reverse Linked List)E
- 232. 用栈实现队列(Implement Queue using Stacks)E
队列
- 102. 二叉树的层序遍历(Binary Tree Level Order Traversal)M
- 103. 二叉树的锯齿形层次遍历(Binary Tree Zigzag Level Order Traversal)M
- 232. 用栈实现队列(Implement Queue using Stacks)E
链表
- 2.两数相加(Add Two Numbers)M
- 21. 合并两个有序链表(Merge Two Sorted Lists)E
- 25. K 个一组翻转链表(Reverse Nodes in k-Group)H
- 141. 环形链表(Linked List Cycle)E
- 160. 相交链表(Intersection of Two Linked Lists)E
- 206.反转链表(Reverse Linked List)E
哈希表
- 1.两数之和(Two Sum)E
- 3.无重复字符的最长子串(Longest Substring Without Repeating Characters)M
- 141. 环形链表(Linked List Cycle)E
- 160. 相交链表(Intersection of Two Linked Lists)E
字符串
- 3.无重复字符的最长子串(Longest Substring Without Repeating Characters)M
- 5. 最长回文子串(Longest Palindromic Substring)M
- 20. 有效的括号(Valid Parentheses)E
- 415. 字符串相加(Add Strings)E
- 1143. 最长公共子序列(Longest Common Subsequence)M
树
- 94. 二叉树的中序遍历(Binary Tree Inorder Traversal)E
- 102. 二叉树的层序遍历(Binary Tree Level Order Traversal)M
- 103. 二叉树的锯齿形层次遍历(Binary Tree Zigzag Level Order Traversal)M
- 124. 二叉树中的最大路径和(Binary Tree Maximum Path Sum)H
- 144. 二叉树的前序遍历(Binary Tree Preorder Traversal)E
- 145. 二叉树的后序遍历(Binary Tree Postorder Traversal)E
- 236. 二叉树的最近公共祖先(Lowest Common Ancestor of a Binary Tree)M
矩阵
并查集
数据结构设计
动态规划
- 5. 最长回文子串(Longest Palindromic Substring)M
- 53. 最大子数组和(Maximum Subarray)E
- 70. 爬楼梯(Climbing Stairs)E
- 121. 买卖股票的最佳时机(Best Time to Buy and Sell Stock)E
- 300. 最长上升子序列(Longest Increasing Subsequence)M
- 509. 斐波那契数(Fibonacci Number)E
- 1143. 最长公共子序列(Longest Common Subsequence)M
递归
回溯
分治
双指针
- 88. 合并两个有序数组(Merge Sorted Array)E
- 141. 环形链表(Linked List Cycle)E
- 160. 相交链表(Intersection of Two Linked Lists)E
深度遍历
- 94. 二叉树的中序遍历(Binary Tree Inorder Traversal)E
- 102. 二叉树的层序遍历(Binary Tree Level Order Traversal)M
- 103. 二叉树的锯齿形层次遍历(Binary Tree Zigzag Level Order Traversal)M
- 124. 二叉树中的最大路径和(Binary Tree Maximum Path Sum)H
- 144. 二叉树的前序遍历(Binary Tree Preorder Traversal)E
- 200. 岛屿数量(Number of Islands)M
- 145. 二叉树的后序遍历(Binary Tree Postorder Traversal)E
- 236. 二叉树的最近公共祖先(Lowest Common Ancestor of a Binary Tree)M
广度遍历
- 102. 二叉树的层序遍历(Binary Tree Level Order Traversal)M
- 103. 二叉树的锯齿形层次遍历(Binary Tree Zigzag Level Order Traversal)M
- 200. 岛屿数量(Number of Islands)M
记忆化搜索
二分查找
滑动窗口
模拟
数学算法
- 2.两数相加(Add Two Numbers)M
- 69. x 的平方根(Sqrt(x))E
- 70. 爬楼梯(Climbing Stairs)E
- 415. 字符串相加(Add Strings)E
- 509. 斐波那契数(Fibonacci Number)E