LeetCode All in One 题目汇总

228 Summary Ranges 21.10% Easy
227 Basic Calculator II 18.00% Medium
226 Invert Binary Tree 35.40% Easy
225 Implement Stack using Queues 29.60% Medium
224 Basic Calculator 15.80% Medium
223 Rectangle Area 25.60% Easy
222 Count Complete Tree Nodes 19.40% Medium
221 Maximal Square 20.30% Medium
220 Contains Duplicate III 15.30% Medium
219 Contains Duplicate II 25.60% Easy
218 The Skyline Problem 16.20% Hard
217 Contains Duplicate 35.90% Easy
216 Combination Sum III 27.70% Medium
215 Kth Largest Element in an Array 27.30% Medium
214 Shortest Palindrome 16.80% Hard
213 House Robber II 26.30% Medium
212 Word Search II 15.00% Hard
211 Add and Search Word - Data structure design 20.70% Medium
210 Course Schedule II 19.30% Medium
209 Minimum Size Subarray Sum 22.90% Medium
208 Implement Trie (Prefix Tree) 24.80% Medium
207 Course Schedule 21.70% Medium
206 Reverse Linked List 31.50% Easy
205 Isomorphic Strings 24.20% Easy
204 Count Primes 19.00% Easy
203 Remove Linked List Elements 25.80% Easy
202 Happy Number 31.40% Easy
201 Bitwise AND of Numbers Range 23.30% Medium
200 Number of Islands 21.90% Medium
199 Binary Tree Right Side View 27.10% Medium
198 House Robber 28.80% Easy
191 Number of 1 Bits 37.30% Easy
190 Reverse Bits 28.40% Easy
189 Rotate Array 17.80% Easy
188 Best Time to Buy and Sell Stock IV 17.30% Hard
187 Repeated DNA Sequences 19.50% Medium
186 Reverse Words in a String II 31.10% Medium
179 Largest Number 15.70% Medium
174 Dungeon Game 17.70% Hard
173 Binary Search Tree Iterator 29.30% Medium
172 Factorial Trailing Zeroes 28.40% Easy
171 Excel Sheet Column Number 36.50% Easy
170 Two Sum III - Data structure design 24.70% Easy
169 Majority Element 35.00% Easy
168 Excel Sheet Column Title 18.10% Easy
167 Two Sum II - Input array is sorted 43.30% Medium
166 Fraction to Recurring Decimal 12.70% Medium
165 Compare Version Numbers 15.20% Easy
164 Maximum Gap 24.40% Hard
163 Missing Ranges 24.10% Medium
162 Find Peak Element 31.50% Medium
161 One Edit Distance 24.00% Medium
160 Intersection of Two Linked Lists 28.70% Easy
159 Longest Substring with At Most Two Distinct Characters 30.20% Hard
158 Read N Characters Given Read4 II - Call multiple times 22.30% Hard
157 Read N Characters Given Read4 29.80% Easy
156 Binary Tree Upside Down 34.30% Medium
155 Min Stack 18.50% Easy
154 Find Minimum in Rotated Sorted Array II 31.90% Hard
153 Find Minimum in Rotated Sorted Array 33.30% Medium
152 Maximum Product Subarray 19.40% Medium
151 Reverse Words in a String 15.10% Medium
150 Evaluate Reverse Polish Notation 21.10% Medium
149 Max Points on a Line 12.60% Hard
148 Sort List 22.00% Medium
147 Insertion Sort List 26.40% Medium
146 LRU Cache 15.00% Hard
145 Binary Tree Postorder Traversal 32.40% Hard
144 Binary Tree Preorder Traversal 36.30% Medium
143 Reorder List 21.00% Medium
142 Linked List Cycle II 31.40% Medium
141 Linked List Cycle 36.30% Medium
140 Word Break II 17.70% Hard
139 Word Break 23.00% Medium
138 Copy List with Random Pointer 25.10% Hard
137 Single Number II 35.00% Medium
136 Single Number 45.10% Medium
135 Candy 20.50% Hard
134 Gas Station 25.70% Medium
133 Clone Graph 24.00% Medium
132 Palindrome Partitioning II 19.70% Hard
131 Palindrome Partitioning 26.70% Medium
130 Surrounded Regions 14.60% Medium
129 Sum Root to Leaf Numbers 30.30% Medium
128 Longest Consecutive Sequence 29.40% Hard
127 Word Ladder 19.30% Medium
126 Word Ladder II 12.90% Hard
125 Valid Palindrome 22.00% Easy
124 Binary Tree Maximum Path Sum 21.50% Hard
123 Best Time to Buy and Sell Stock III 23.90% Hard
122 Best Time to Buy and Sell Stock II 38.30% Medium
121 Best Time to Buy and Sell Stock 32.60% Medium
120 Triangle 27.40% Medium
119 Pascal‘s Triangle II 29.40% Easy
118 Pascal‘s Triangle 30.10% Easy
117 Populating Next Right Pointers in Each Node II 32.00% Hard
116 Populating Next Right Pointers in Each Node 36.20% Medium
115 Distinct Subsequences 26.30% Hard
114 Flatten Binary Tree to Linked List 28.80% Medium
113 Path Sum II 26.60% Medium
112 Path Sum 29.80% Easy
111 Minimum Depth of Binary Tree 29.10% Easy
110 Balanced Binary Tree 32.00% Easy
109 Convert Sorted List to Binary Search Tree 27.90% Medium
108 Convert Sorted Array to Binary Search Tree 34.00% Medium
107 Binary Tree Level Order Traversal II 31.10% Easy
106 Construct Binary Tree from Inorder and Postorder Traversal 26.80% Medium
105 Construct Binary Tree from Preorder and Inorder Traversal 26.40% Medium
104 Maximum Depth of Binary Tree 45.10% Easy
103 Binary Tree Zigzag Level Order Traversal 26.40% Medium
102 Binary Tree Level Order Traversal 29.30% Easy
101 Symmetric Tree 31.60% Easy
100 Same Tree 41.80% Easy
99 Recover Binary Search Tree 24.30% Hard
98 Validate Binary Search Tree 20.60% Medium
97 Interleaving String 20.80% Hard
96 Unique Binary Search Trees 36.00% Medium
95 Unique Binary Search Trees II 28.00% Medium
94 Binary Tree Inorder Traversal 36.20% Medium
93 Restore IP Addresses 21.00% Medium
92 Reverse Linked List II 26.10% Medium
91 Decode Ways 16.40% Medium
90 Subsets II 27.70% Medium
89 Gray Code 32.80% Medium
88 Merge Sorted Array 29.70% Easy
87 Scramble String 24.20% Hard
86 Partition List 27.50% Medium
85 Maximal Rectangle 22.00% Hard
84 Largest Rectangle in Histogram 22.60% Hard
83 Remove Duplicates from Sorted List 34.50% Easy
82 Remove Duplicates from Sorted List II 25.00% Medium
81 Search in Rotated Sorted Array II 31.40% Medium
80 Remove Duplicates from Sorted Array II 30.50% Medium
79 Word Search 20.30% Medium
78 Subsets 28.20% Medium
77 Combinations 30.90% Medium
76 Minimum Window Substring 18.90% Hard
75 Sort Colors 32.60% Medium
74 Search a 2D Matrix 31.60% Medium
73 Set Matrix Zeroes 31.40% Medium
72 Edit Distance 26.20% Hard
71 Simplify Path 20.00% Medium
70 Climbing Stairs 34.40% Easy
69 Sqrt(x) 23.10% Medium
68 Text Justification 14.60% Hard
67 Add Binary 24.70% Easy
66 Plus One 30.40% Easy
65 Valid Number 11.40% Hard
64 Minimum Path Sum 32.20% Medium
63 Unique Paths II 28.00% Medium
62 Unique Paths 32.80% Medium
61 Rotate List 21.70% Medium
60 Permutation Sequence 22.80% Medium
59 Spiral Matrix II 31.80% Medium
58 Length of Last Word 28.00% Easy
57 Insert Interval 21.40% Hard
56 Merge Intervals 22.40% Hard
55 Jump Game 27.00% Medium
54 Spiral Matrix 20.80% Medium
53 Maximum Subarray 34.50% Medium
52 N-Queens II 35.80% Hard
51 N-Queens 26.50% Hard
50 Pow(x, n) 26.70% Medium
49 Anagrams 24.30% Medium
48 Rotate Image 31.90% Medium
47 Permutations II 25.80% Hard
46 Permutations 31.90% Medium
45 Jump Game II 24.20% Hard
44 Wildcard Matching 15.00% Hard
43 Multiply Strings 21.00% Medium
42 Trapping Rain Water 30.00% Hard
41 First Missing Positive 22.90% Hard
40 Combination Sum II 25.20% Medium
39 Combination Sum 27.90% Medium
38 Count and Say 25.20% Easy
37 Sudoku Solver 21.80% Hard
36 Valid Sudoku 27.20% Easy
35 Search Insert Position 35.40% Medium
34 Search for a Range 27.50% Medium
33 Search in Rotated Sorted Array 28.80% Hard
32 Longest Valid Parentheses 20.90% Hard
31 Next Permutation 25.00% Medium
30 Substring with Concatenation of All Words 19.40% Hard
29 Divide Two Integers 15.00% Medium
28 Implement strStr() 22.20% Easy
27 Remove Element 32.10% Easy
26 Remove Duplicates from Sorted Array 31.30% Easy
25 Reverse Nodes in k-Group 25.50% Hard
24 Swap Nodes in Pairs 32.50% Medium
23 Merge k Sorted Lists 21.10% Hard
22 Generate Parentheses 32.60% Medium
21 Merge Two Sorted Lists 32.70% Easy
20 Valid Parentheses 26.50% Easy
19 Remove Nth Node From End of List 27.10% Easy
18 4Sum 21.70% Medium
17 Letter Combinations of a Phone Number 25.80% Medium
16 3Sum Closest 26.90% Medium
15 3Sum 16.90% Medium
14 Longest Common Prefix 25.50% Easy
13 Roman to Integer 34.00% Easy
12 Integer to Roman 33.80% Medium
11 Container With Most Water 32.00% Medium
10 Regular Expression Matching 20.70% Hard
9 Palindrome Number 28.30% Easy
8 String to Integer (atoi) 13.00% Easy
7 Reverse Integer 25.10% Easy
6 ZigZag Conversion 21.80% Easy
5 Longest Palindromic Substring 20.70% Medium
4 Median of Two Sorted Arrays 17.40% Hard
3 Longest Substring Without Repeating Characters 20.60% Medium
2 Add Two Numbers 21.10% Medium
1 Two Sum 17.70% Medium
时间: 2024-10-21 09:37:05

LeetCode All in One 题目汇总的相关文章

leetcode 单链表相关题目汇总

  leetcode-19-Remove Nth From End of List—移除链表中倒数第n个元素 leetcode-21-Merge Two Sorted Lists—两个已排序链表归并 leetcode-23-Merge k Sorted Lists—k个已排序链表归并 leetcode-24-Swap Nodes in Pairs—链表中元素两两一组交换 leetcode-25-Reverse Nodes in K-Group—链表中元素k个一组逆序 leetcode-61-Ro

LeetCode 十月份题目汇总

开源地址:点击该链接 前言 十月份共有60道题目,全部属于 Easy 难度的,所以公众号中分享出来的并不多,只是挑了一些感觉还可以的才分享了出来,这60道题目我按照不同类别进行了分类整理,所有源码以及对应的解题思路均匀开源到 GitHub,公众号内回复"LeetCode"获取,具体题目如下. 题目分类 数组 0001_two_sum 0026_remove_duplicates_from_sorted_array 0027_remove_element 0035_search_inse

LeetCode 11月第2周题目汇总

开源地址:点击该链接 前言 最近比较忙,这周几乎没有刷题,只刷了6道题~ 题目汇总 0387_first_unique_character_in_a_string类似的题目比较多了,字符串中找出特别的那一个,由于字符串数目有限,所以直接使用哈希表即可,使用 unordered_map 会有点慢,直接使用数组比较快:第一次遍历统计每个字符的数量,第二次遍历找出第一个只出现一次的字符即可. 0389_find_the_difference题目是找出两个字符串中唯一一个不同的字符是什么,这个题目和 0

剑指 Offer 题目汇总索引

剑指 Offer 总目录:(共50道大题) 1. 赋值运算符函数(或应说复制拷贝函数问题) 2. 实现 Singleton 模式 (C#) 3.二维数组中的查找 4.替换空格               时间:O(n) 空间:O(1) 5.从尾到头打印链表 6. 重建二叉树          && 二叉树的各种遍历(BFS,DFS,DLR,LDR,LRD) 7.用两个栈实现队列 8.旋转数组的最小数字 9.斐波那契数列第 n 项        时间O(lgn) 10.一个整数的二进制表示中

HTML5面试题目汇总(二)

HTML5面试题目汇总(二) 标签: javascript 2016-07-19 10:15 639人阅读 评论(0) 收藏 举报  分类: javascript(16)  1.怎样添加.移除.移动.复制.创建和查找节点? 1)创建新节点 createDocumentFragment() //创建一个DOM片段 createElement() //创建一个具体的元素 createTextNode() //创建一个文本节点 2)添加.移除.替换.插入 appendChild() //添加 remo

线段树题目汇总

区间合并部分: POJ 3667 Hotel 求某大于等于a的最长区间 #include <cstdio> #include <cstring> #include <algorithm> #include <iostream> #define LEN 50001<<2 using namespace std; struct Line_tree { //分别表示以当前区间为左端点的最长连续空白区间,为右端点的最长连续空白区间,该区间的最长连续空白区

NYOJ 搜索题目汇总 NYOJ 20、21、27、42、58、82、202、284、325、353、488、491、523、592、722

NYOJ 搜索题目汇总 NYOJ 20 #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<vector> #include<algorithm> using namespace std; int pre[100005]; vector<int>v[100005];//存储每个结点相邻的边 void DFS(int

力扣题目汇总(加一,旋转数组,整数反转)

力扣题目汇总(加一,旋转数组,整数反转) 加一 1.题目描述 给定一个由整数组成的非空数组所表示的非负整数,在该数的基础上加一. 最高位数字存放在数组的首位, 数组中每个元素只存储一个数字. 你可以假设除了整数 0 之外,这个整数不会以零开头. 示例 1: 输入: [1,2,3] 输出: [1,2,4] 解释: 输入数组表示数字 123. 示例 2: 输入: [4,3,2,1] 输出: [4,3,2,2] 解释: 输入数组表示数字 4321. 2.解题思路 #错误思路 列表最后一位加1,判断最后

力扣题目汇总(转换成小写字母,唯一摩尔斯密码,有序数组平方)

力扣题目汇总(转换成小写字母,唯一摩尔斯密码,有序数组平方) 转换成小写字母 1.题目描述 实现函数 ToLowerCase(),该函数接收一个字符串参数 str,并将该字符串中的大写字母转换成小写字母,之后返回新的字符串. 示例 1: 输入: "Hello" 输出: "hello" 示例 2: 输入: "here" 输出: "here" 示例 3: 输入: "LOVELY" 输出: "lovel