序号 |
题目 |
算法 |
数据结构 |
1 |
Clone Graph |
BFS |
哈希表 |
2 |
Word Ladder II |
BFS |
哈希表 |
3 |
Surrounded Regions |
BFS |
矩阵 |
4 |
Word Ladder |
BFS |
N/A |
5 |
Binary Tree Level Order Traversal |
BFS|前序遍历 |
队列 |
6 |
BinaryTreeLevelOrderTraversalII |
BFS|前序遍历 |
队列 |
7 |
Binary Tree Zigzag Level Order Traversal |
BFS|前序遍历 |
队列 |
8 |
Implement strStr() |
KMP算法 |
N/A |
9 |
Copy List with Random Pointer |
N/A |
哈希表 |
10 |
Remove Duplicates from Sorted Array |
N/A |
哈希表 |
11 |
Remove Duplicates from Sorted Array II |
N/A |
哈希表 |
12 |
Set Matrix Zeroes |
N/A |
哈希表 |
13 |
Anagrams |
N/A |
哈希表 |
14 |
First Missing Positive |
N/A |
哈希表 |
15 |
Two Sum |
N/A |
哈希表 |
16 |
Evaluate Reverse Polish Notation |
N/A |
堆栈 |
17 |
Largest Rectangle in Histogram |
N/A |
堆栈 |
18 |
Minimum Window Substring |
N/A |
堆栈 |
19 |
Simplify Path |
N/A |
堆栈 |
20 |
Longest Valid Parentheses |
N/A |
堆栈 |
21 |
Valid Parentheses |
N/A |
堆栈 |
22 |
Container With Most Water |
N/A |
堆栈 |
23 |
Best Time to Buy and Sell Stock |
N/A |
数组 |
24 |
Best Time to Buy and Sell Stock II |
N/A |
数组 |
25 |
Best Time to Buy and Sell Stock III |
N/A |
数组 |
26 |
Length of Last Word |
N/A |
数组 |
27 |
Search Insert Position |
N/A |
数组 |
28 |
Search for a Range |
N/A |
数组 |
29 |
Spiral Matrix |
N/A |
矩阵 |
30 |
Spiral Matrix II |
N/A |
矩阵 |
31 |
LRU Cache |
N/A |
链表 |
32 |
Reorder List |
N/A |
链表 |
33 |
Linked List Cycle |
N/A |
链表 |
34 |
Linked List Cycle II |
N/A |
链表 |
35 |
Reverse Linked List II |
N/A |
链表 |
36 |
Partition List |
N/A |
链表 |
37 |
Remove Duplicates from Sorted List |
N/A |
链表 |
38 |
Remove Duplicates from Sorted List II |
N/A |
链表 |
39 |
Merge Two Sorted Lists |
N/A |
链表 |
40 |
Rotate List |
N/A |
链表 |
41 |
Reverse Nodes in k-Group |
N/A |
链表 |
42 |
Swap Nodes in Pairs |
N/A |
链表 |
43 |
Remove Nth Node From End of List |
N/A |
链表 |
44 |
Text Justification |
N/A |
队列 |
45 |
Candy |
N/A |
N/A |
46 |
Valid Palindrome |
N/A |
N/A |
47 |
Plus One |
N/A |
N/A |
48 |
Valid Number |
N/A |
N/A |
49 |
Add Binary |
N/A |
N/A |
50 |
Insert Interval |
N/A |
N/A |
51 |
Merge Intervals |
N/A |
N/A |
52 |
Multiply Strings |
N/A |
N/A |
53 |
Trapping Rain Water |
N/A |
N/A |
54 |
Valid Sudoku |
N/A |
N/A |
55 |
Roman to Integer |
N/A |
N/A |
56 |
Integer to Roman |
N/A |
N/A |
57 |
Palindrome Number |
N/A |
N/A |
58 |
Reverse Integer |
N/A |
N/A |
59 |
ZigZag Conversion |
N/A |
N/A |
60 |
Add Two Numbers |
N/A |
N/A |
61 |
Median of Two Sorted Arrays |
N/A |
N/A |
62 |
String to Integer (atoi) |
STL函数 |
N/A |
63 |
Next Permutation |
STL经典算法 |
N/A |
64 |
Recover Binary Search Tree |
中序遍历 |
二叉树 |
65 |
3Sum |
二分查找 |
N/A |
66 |
3Sum Closest |
二分查找 |
N/A |
67 |
4Sum |
二分查找 |
N/A |
68 |
Single Number |
位运算 |
N/A |
69 |
Single Number II |
位运算 |
N/A |
70 |
Construct Binary Tree from Preorder and Inorder Traversal |
前序中序遍历 |
N/A |
71 |
Binary Tree Preorder Traversal |
前序遍历 |
二叉树 |
72 |
Flatten Binary Tree to Linked List |
前序遍历 |
二叉树 |
73 |
Interleaving String |
动态规划 |
二叉树 |
74 |
Unique Binary Search Trees |
动态规划 |
二叉树 |
75 |
Word Break |
动态规划 |
N/A |
76 |
Word Break II |
动态规划 |
N/A |
77 |
Palindrome Partitioning |
动态规划 |
N/A |
78 |
Palindrome Partitioning II |
动态规划 |
N/A |
79 |
Triangle |
动态规划 |
N/A |
80 |
Distinct Subsequences |
动态规划 |
N/A |
81 |
Decode Ways |
动态规划 |
N/A |
82 |
Scramble String |
动态规划 |
N/A |
83 |
Maximal Rectangle |
动态规划 |
N/A |
84 |
Edit Distance |
动态规划 |
N/A |
85 |
Climbing Stairs |
动态规划 |
N/A |
86 |
Minimum Path Sum |
动态规划 |
N/A |
87 |
Unique Paths |
动态规划 |
N/A |
88 |
Unique Paths II |
动态规划 |
N/A |
89 |
Jump Game |
动态规划 |
N/A |
90 |
Jump Game II |
动态规划 |
N/A |
91 |
Maximum Subarray |
动态规划 |
N/A |
92 |
Wildcard Matching |
动态规划 |
N/A |
93 |
Substring with Concatenation of All Words |
动态规划 |
N/A |
94 |
Sort List |
合并排序 |
链表 |
95 |
Merge Sorted Array |
合并排序 |
N/A |
96 |
Construct Binary Tree from Inorder and Postorder Traversal |
后序中序遍历 |
N/A |
97 |
Binary Tree Postorder Traversal |
后续遍历 |
二叉树 |
98 |
Combinations |
回溯 |
N/A |
99 |
Permutation Sequence |
回溯 |
N/A |
100 |
N-Queens |
回溯 |
N/A |
101 |
N-Queens II |
回溯 |
N/A |
102 |
Permutations |
回溯 |
N/A |
103 |
Permutations II |
回溯 |
N/A |
104 |
Combination Sum |
回溯 |
N/A |
105 |
Combination Sum II |
回溯 |
N/A |
106 |
Sudoku Solver |
回溯 |
N/A |
107 |
Longest Substring Without Repeating Characters |
回溯 |
N/A |
108 |
Max Points on a Line |
循环遍历 |
N/A |
109 |
Longest Common Prefix |
循环遍历 |
N/A |
110 |
Longest Palindromic Substring |
循环遍历 |
N/A |
111 |
Insertion Sort List |
插入排序 |
链表 |
112 |
Rotate Image |
矢量旋转与平移 |
N/A |
113 |
Longest Consecutive Sequence |
类BFS |
哈希表 |
114 |
Search in Rotated Sorted Array |
类二分查找 |
N/A |
115 |
Search in Rotated Sorted Array II |
类二分查找 |
N/A |
116 |
Sqrt(x) |
类二分查找 |
N/A |
117 |
Pow(x, n) |
类二进制 |
N/A |
118 |
Divide Two Integers |
类二进制 |
N/A |
119 |
Gas Station |
类合并排序 |
N/A |
120 |
Merge k Sorted Lists |
类外排序 |
N/A |
121 |
Sort Colors |
类快速排序 |
N/A |
122 |
Remove Element |
类快速排序 |
N/A |
123 |
Search a 2D Matrix |
类杨氏矩阵 |
N/A |
124 |
Restore IP Addresses |
背包问题 |
N/A |
125 |
Sum Root to Leaf Numbers |
递归 |
二叉树 |
126 |
Binary Tree Maximum Path Sum |
递归 |
二叉树 |
127 |
opulating Next Right Pointers in Each Node |
递归 |
二叉树 |
128 |
Populating Next Right Pointers in Each Node II |
递归 |
二叉树 |
129 |
Path Sum |
递归 |
二叉树 |
130 |
Path Sum II |
递归 |
二叉树 |
131 |
Maximum Depth of Binary Tree |
递归 |
二叉树 |
132 |
Minimum Depth of Binary Tree |
递归 |
二叉树 |
133 |
Balanced Binary Tree |
递归 |
二叉树 |
134 |
Symmetric Tree |
递归 |
二叉树 |
135 |
Same Tree |
递归 |
二叉树 |
136 |
Validate Binary Search Tree |
递归 |
二叉树 |
137 |
Unique Binary Search Trees II |
递归 |
二叉树 |
138 |
Binary Tree Inorder Traversal |
递归 |
二叉树 |
139 |
Pascal's Triangle |
递归 |
N/A |
140 |
Pascal's Triangle II |
递归 |
N/A |
141 |
Convert Sorted List to Binary Search Tree |
递归 |
N/A |
142 |
Convert Sorted Array to Binary Search Tree |
递归 |
N/A |
143 |
Subsets |
递归 |
N/A |
144 |
Subsets II |
递归 |
N/A |
145 |
Gray Code |
递归 |
N/A |
146 |
Word Search |
递归 |
N/A |
147 |
Count and Say |
递归 |
N/A |
148 |
Generate Parentheses |
递归 |
N/A |
149 |
Letter Combinations of a Phone Number |
递归 |
N/A |
150 |
Regular Expression Matching |
递归 |
N/A |
转自:http://blog.csdn.net/lanxu_yy/article/details/17848219
分享到:
相关推荐
《leetcode-solutions》,刷算法题,需要有一定的英文阅读能力。。。
Algorithm-LeetCode-Sol-Res.zip,干净,易懂的解决方案和资源,为leetcode在线判断算法问题。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
IDEA 插件,lettcode刷题,leetcode-editor7.4版本下载进行本地导入(直接将压缩包拖进IDEA即可)
Algorithm-leetcode-spider.zip,leetcode公司,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
在IDE中解决LeetCode问题,支持leetcode.com与leetcode-cn.com,满足基本的做题需求。 理论上支持: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio。
leetcode leetcode-cli-plugins leetcode-cli 的第 3 方插件。 什么是 如何使用 如何使用 插件 名称 描述 增强的命令 按公司或标签过滤问题 list 不要在同一台计算机上使 Chrome 的会话过期 login 不要在同一台...
leetcode 答案解析 golang解答
解题思路思路和LeetCode-python 503.下一个更大元素 II一致,只是这里求的是下标的距离,而不是数值倒序搜索,用到栈,栈里存储索引情况1:若栈为
leetcode中文版leetcode作弊 leetcode-cheat 的发布 它是什么 ? 这是一个chrome 扩展,可以帮助您更高效地使用 leetcode。您可以从 重要: leetcode-cheat 现在只支持中文版。 也就是说不完全支持leetcode.com,但是...
leetcode-helper-1.7.1
leetcode-tag-dynamic programming
vscode提交leetcode Leetcode刷题存档 准备 vscode 安装 leetcode 插件 添加leetcode到bin ln -s ~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/vsc-leetcode-cli/bin/leetcode /usr/local/...
leetcode-python答案汇总,呕血总结. You are never too old to learn.
leetcode-editor,在ide中做leetcode练习,支持leetcode.com和leetcode-cn.com,以满足练习的基本需求。理论上支持:intellij idea phpstorm webstorm pycharm rubymine appcode clion goland datagrip rider mps ...
示例1输入:[[1,0,1],[0,0,0],[1,0,1]]输出:2解释:海洋区域 (1, 1) 和所有陆地区域之间的距离都达到最大,最大距离为 2。解题思路
leetcode-tag-Tree
leetcode-tag-Stack
leetcode 2 和 c leetcode-cli 注意:这个存储库是为了临时使用而分叉的。 注意:从 webbrowser 复制 cookie 并使用leetcode user -c可以临时修复不能。 一个享受 leetcode 的高效 cli 工具! 非常感谢 leetcode.com...
Algorithm-LeetCode-Solution-From-GuaZiDou.zip,Leetcode解决方案Gitbook,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
leetcode-tag-array