LeetCode 刷题
在JackZhao98项目基础上实现的自动获取LeetCode历史ac
- retriever.py: 获取所有ac,存入文件夹中
- generate_readme.py: 能够自动生成readme.md
# | Title | Difficulty | runtime | memory |
---|---|---|---|---|
1 | Two Sum | Easy | 4756 ms | 13.7 MB |
2 | Add Two Numbers | Medium | 80 ms | 14.1 MB |
3 | Longest Substring Without Repeating Characters | Medium | 40 ms | 12.1 MB |
4 | Median of Two Sorted Arrays | Hard | 156 ms | 14.6 MB |
5 | Longest Palindromic Substring | Medium | 1036 ms | 13.7 MB |
10 | Regular Expression Matching | Hard | 48 ms | 14.2 MB |
11 | Container With Most Water | Medium | 128 ms | 14.4 MB |
14 | Longest Common Prefix | Easy | 32 ms | 13.9 MB |
15 | 3Sum | Medium | 1300 ms | 17.5 MB |
17 | Letter Combinations of a Phone Number | Medium | 24 ms | 12.7 MB |
18 | 4Sum | Medium | 1496 ms | 14 MB |
19 | Remove Nth Node From End of List | Medium | 32 ms | 12.8 MB |
32 | Longest Valid Parentheses | Hard | 36 ms | 14.2 MB |
34 | Find First and Last Position of Element in Sorted Array | Medium | 104 ms | 15.1 MB |
36 | Valid Sudoku | Medium | 108 ms | 13.9 MB |
39 | Combination Sum | Medium | 52 ms | 14 MB |
40 | Combination Sum II | Medium | 40 ms | 14.2 MB |
44 | Wildcard Matching | Hard | 812 ms | 22.7 MB |
46 | Permutations | Medium | 48 ms | 14 MB |
47 | Permutations II | Medium | 48 ms | 14.4 MB |
51 | N-Queens | Hard | 160 ms | 14.5 MB |
52 | N-Queens II | Hard | 152 ms | 14.2 MB |
53 | Maximum Subarray | Easy | 96 ms | 12.4 MB |
62 | Unique Paths | Medium | 44 ms | 13.7 MB |
63 | Unique Paths II | Medium | 56 ms | 13.8 MB |
64 | Minimum Path Sum | Medium | 184 ms | 13.3 MB |
69 | Sqrt(x) | Easy | 44 ms | 11.8 MB |
70 | Climbing Stairs | Easy | 20 ms | 11.9 MB |
75 | Sort Colors | Medium | 40 ms | 12 MB |
76 | Minimum Window Substring | Hard | 104 ms | 14.6 MB |
77 | Combinations | Medium | 460 ms | 15.7 MB |
78 | Subsets | Medium | 36 ms | 14.2 MB |
79 | Word Search | Medium | 288 ms | 15.4 MB |
88 | Merge Sorted Array | Easy | 40 ms | 13.1 MB |
90 | Subsets II | Medium | 40 ms | 14.3 MB |
93 | Restore IP Addresses | Medium | 332 ms | 14.1 MB |
94 | Binary Tree Inorder Traversal | Medium | 32 ms | 13.9 MB |
97 | Interleaving String | Hard | 40 ms | 14.3 MB |
106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | 364 ms | 18.8 MB |
111 | Minimum Depth of Binary Tree | Easy | 92 ms | 15 MB |
115 | Distinct Subsequences | Hard | 44 ms | 14.3 MB |
120 | Triangle | Medium | 44 ms | 12.9 MB |
121 | Best Time to Buy and Sell Stock | Easy | 92 ms | 12.8 MB |
122 | Best Time to Buy and Sell Stock II | Easy | 92 ms | 12.7 MB |
123 | Best Time to Buy and Sell Stock III | Hard | 3440 ms | 64.3 MB |
127 | Word Ladder | Hard | 536 ms | 14.8 MB |
131 | Palindrome Partitioning | Medium | 72 ms | 14.5 MB |
139 | Word Break | Medium | 40 ms | 12.8 MB |
140 | Word Break II | Hard | 120 ms | 12.6 MB |
141 | Linked List Cycle | Easy | 64 ms | 18.4 MB |
144 | Binary Tree Preorder Traversal | Medium | 40 ms | 13.9 MB |
152 | Maximum Product Subarray | Medium | 56 ms | 14 MB |
153 | Find Minimum in Rotated Sorted Array | Medium | 44 ms | 11.9 MB |
167 | Two Sum II - Input array is sorted | Easy | 40 ms | 13.6 MB |
174 | Dungeon Game | Hard | 72 ms | 15 MB |
179 | Largest Number | Medium | 44 ms | 13.9 MB |
188 | Best Time to Buy and Sell Stock IV | Hard | 220 ms | 25.3 MB |
198 | House Robber | Medium | 24 ms | 12 MB |
205 | Isomorphic Strings | Easy | 44 ms | 13.9 MB |
208 | Implement Trie (Prefix Tree) | Medium | 168 ms | 31.3 MB |
212 | Word Search II | Hard | 380 ms | 32.4 MB |
213 | House Robber II | Medium | 24 ms | 11.7 MB |
215 | Kth Largest Element in an Array | Medium | 116 ms | 12.3 MB |
216 | Combination Sum III | Medium | 32 ms | 14.1 MB |
221 | Maximal Square | Medium | 212 ms | 13.8 MB |
234 | Palindrome Linked List | Easy | 64 ms | 31.3 MB |
241 | Different Ways to Add Parentheses | Medium | 56 ms | 14.2 MB |
242 | Valid Anagram | Easy | 40 ms | 12.5 MB |
264 | Ugly Number II | Medium | 152 ms | 12.8 MB |
278 | First Bad Version | Easy | 20 ms | 11.7 MB |
279 | Perfect Squares | Medium | 6780 ms | 12.7 MB |
282 | Expression Add Operators | Hard | 1012 ms | 14.6 MB |
300 | Longest Increasing Subsequence | Medium | 1204 ms | 12.7 MB |
309 | Best Time to Buy and Sell Stock with Cooldown | Medium | 36 ms | 12.9 MB |
312 | Burst Balloons | Hard | 336 ms | 14.7 MB |
322 | Coin Change | Medium | 1120 ms | 12.1 MB |
337 | House Robber III | Medium | 56 ms | 15.9 MB |
343 | Integer Break | Medium | 32 ms | 12.6 MB |
345 | Reverse Vowels of a String | Easy | 76 ms | 14.2 MB |
347 | Top K Frequent Elements | Medium | 284 ms | 15.2 MB |
350 | Intersection of Two Arrays II | Easy | 32 ms | 14 MB |
367 | Valid Perfect Square | Easy | 28 ms | 13.9 MB |
368 | Largest Divisible Subset | Medium | 432 ms | 12.8 MB |
376 | Wiggle Subsequence | Medium | 40 ms | 13.8 MB |
377 | Combination Sum IV | Medium | 48 ms | 12.9 MB |
387 | First Unique Character in a String | Easy | 40 ms | 12 MB |
392 | Is Subsequence | Easy | 252 ms | 17.4 MB |
395 | Longest Substring with At Least K Repeating Characters | Medium | 28 ms | 12.3 MB |
406 | Queue Reconstruction by Height | Medium | 180 ms | 12.2 MB |
412 | Fizz Buzz | Easy | 40 ms | 12.6 MB |
416 | Partition Equal Subset Sum | Medium | 744 ms | 12.7 MB |
435 | Non-overlapping Intervals | Medium | 72 ms | 17.6 MB |
438 | Find All Anagrams in a String | Medium | 120 ms | 14.8 MB |
445 | Add Two Numbers II | Medium | 84 ms | 14 MB |
448 | Find All Numbers Disappeared in an Array | Easy | 13043 ms | 44 MB |
451 | Sort Characters By Frequency | Medium | 68 ms | 15.8 MB |
452 | Minimum Number of Arrows to Burst Balloons | Medium | 1064 ms | 17.5 MB |
454 | 4Sum II | Medium | 296 ms | 34.2 MB |
455 | Assign Cookies | Easy | 336 ms | 13.4 MB |
461 | Hamming Distance | Easy | 8 ms | 25.9 MB |
494 | Target Sum | Medium | 928 ms | 14.3 MB |
513 | Find Bottom Left Tree Value | Medium | 44 ms | 17.2 MB |
518 | Coin Change 2 | Medium | 272 ms | 13.9 MB |
524 | Longest Word in Dictionary through Deleting | Medium | 732 ms | 16.9 MB |
525 | Contiguous Array | Medium | 808 ms | 16.8 MB |
540 | Single Element in a Sorted Array | Medium | 72 ms | 12.8 MB |
543 | Diameter of Binary Tree | Easy | 4 ms | 29.2 MB |
565 | Array Nesting | Medium | 144 ms | 15.8 MB |
567 | Permutation in String | Medium | 76 ms | 13.7 MB |
581 | Shortest Unsorted Continuous Subarray | Medium | 22 ms | 29.3 MB |
583 | Delete Operation for Two Strings | Medium | 344 ms | 17.6 MB |
599 | Minimum Index Sum of Two Lists | Easy | 112 ms | 12.2 MB |
605 | Can Place Flowers | Easy | 328 ms | 12.4 MB |
617 | Merge Two Binary Trees | Easy | 6 ms | 30.8 MB |
633 | Sum of Square Numbers | Medium | 124 ms | 13.2 MB |
648 | Replace Words | Medium | 288 ms | 21.2 MB |
664 | Strange Printer | Hard | 656 ms | 14.3 MB |
665 | Non-decreasing Array | Medium | 396 ms | 12.4 MB |
670 | Maximum Swap | Medium | 16 ms | 11.7 MB |
680 | Valid Palindrome II | Easy | 188 ms | 13.4 MB |
687 | Longest Univalue Path | Medium | 412 ms | 18.8 MB |
695 | Max Area of Island | Medium | 116 ms | 14.1 MB |
712 | Minimum ASCII Delete Sum for Two Strings | Medium | 1108 ms | 18.4 MB |
718 | Maximum Length of Repeated Subarray | Medium | 3496 ms | 39.9 MB |
724 | Find Pivot Index | Easy | 124 ms | 12.5 MB |
739 | Daily Temperatures | Medium | 436 ms | 15.1 MB |
745 | Find Smallest Letter Greater Than Target | Easy | 220 ms | 13.5 MB |
747 | Min Cost Climbing Stairs | Easy | 88 ms | 13.9 MB |
753 | Open the Lock | Medium | 2928 ms | 14.9 MB |
768 | Partition Labels | Medium | 40 ms | 12 MB |
777 | Toeplitz Matrix | Easy | 104 ms | 13.7 MB |
782 | Jewels and Stones | Easy | 36 ms | 6.5 MB |
792 | Binary Search | Easy | 332 ms | 15.1 MB |
800 | Letter Case Permutation | Medium | 52 ms | 14.2 MB |
811 | Number of Subarrays with Bounded Maximum | Medium | 404 ms | 15.2 MB |
813 | All Paths From Source to Target | Medium | 84 ms | 13 MB |
853 | Most Profit Assigning Work | Medium | 340 ms | 14.7 MB |
872 | Split Array into Fibonacci Sequence | Medium | 32 ms | 14.1 MB |
878 | Shifting Letters | Medium | 168 ms | 14.5 MB |
891 | Score After Flipping Matrix | Medium | 48 ms | 14 MB |
923 | Super Egg Drop | Hard | 2436 ms | 33.4 MB |
928 | Surface Area of 3D Shapes | Easy | 64 ms | 11.9 MB |
951 | Partition Array into Disjoint Intervals | Medium | 172 ms | 15.3 MB |
967 | Minimum Falling Path Sum | Medium | 108 ms | 14.6 MB |
971 | Shortest Bridge | Medium | 428 ms | 17.1 MB |
1013 | Fibonacci Number | Easy | 28 ms | 14 MB |
1081 | Video Stitching | Medium | 76 ms | 14 MB |
1111 | Minimum Score Triangulation of Polygon | Medium | 164 ms | 14.5 MB |
1236 | N-th Tribonacci Number | Easy | 28 ms | 14.2 MB |
1250 | Longest Common Subsequence | Medium | 432 ms | 22.5 MB |
1290 | Make Array Strictly Increasing | Hard | 756 ms | 14.5 MB |
1322 | Minimum Moves to Reach Target with Rotations | Hard | 9 ms | 39.2 MB |
1330 | Longest Arithmetic Subsequence of Given Difference | Medium | 520 ms | 27.5 MB |