8. String to Integer (atoi) Solution 1: Brute-Force def myAtoi(self, s: str)...
215. Kth Largest Element in an Array Solution 1: Sort class Solution: def fi...
152. Maximum Product Subarray Solution 1: DP class Solution: def maxProduct(...
6. Zigzag Conversion Solution 1: 2D-Array + Simulation (模擬 Z 字形移動) class Solutio...
25. Reverse Nodes in k-Group Solution 1: Iterative class Solution: def rever...
236. Lowest Common Ancestor of a Binary Tree Solution 1: DFS class Solution:...
148. Sort List Solution 1: Merge Sort # Definition for singly-linked list. # cla...
96. Unique Binary Search Trees Solution 1: DP class Solution: def numTrees(s...
31. Next Permutation Solution 1: Two Pointer class Solution: ""&qu...
78. Subsets Solution 1: Bitwise class Solution(object): def subsets(self, nu...
200. Number of Islands Solution 1: DFS + Bitmap class Solution: def numIslan...
76. Minimum Window Substring Solution 1: Slide Window + Hash from collections im...
55. Jump Game Solution 1: DP (Tail -> Head) class Solution: def canJump(s...
160. Intersection of Two Linked Lists Solution 1: Brute-Force class Solution:...
122. Best Time to Buy and Sell Stock II Solution 1: DP Time Complexity: O(N)Spa...
287. Find the Duplicate Number Solution 1: Brute-Force (TLE) class Solution:...
32. Longest Valid Parentheses Solution 1: Stack class Solution: def longestV...
322. Coin Change Solution 1: DP (Amount outer loop) class Solution: def coin...
17. Letter Combinations of a Phone Number Solution 1: Recursive + DFS class Solu...
23. Merge k Sorted Lists Question You are given an array of k linked-lists lists...
13. Roman to Integer Question Roman numerals are represented by seven different...
先說感言:我認為這三十天內最麻煩的不是每天勤分不懈的寫題目,而是寫一篇可以給人看得懂的文章(好啦,我知道有部份我寫得有點潦草),題目基本上就算沒有鐵人賽,我也會...
39. Combination Sum Question Given an array of distinct integers candidates and...
84. Largest Rectangle in Histogram Question Given an array of integers heights r...
LeetCode 75 Level 1 - Day 15 Heap 題目連結 難易度:Medium 692. Top K Frequent Words...
101. Symmetric Tree Question Given the root of a binary tree, check whether it i...
LeetCode 75 Level 1 - Day 15 Heap 1046. Last Stone Weight 題目連結 難易度:Easy 題目敘述...
LeetCode 75 Level 1 - Day 14 Stack 394. Decode String 題目連結 難易度:Medium 題目敘述...
46. Permutations Question Given an array nums of distinct integers, return all t...
註:因為有NDA的關係(就算沒有也是保護一下公司)面試篇每一篇都不會把確切的題目打出來(我看每個人的心得文都有提到題目類型,感覺分享題目類型還是ok的)難度不會...