iT邦幫忙

leetcode相關文章
共有 1110 則文章
LeetCode Top 100 Liked 系列 第 59 篇

技術 [Day 58] Word Break (Medium)

139. Word Break Solution 1: DFS (TLE) class Solution: def wordBreak(self, s:...

LeetCode Top 100 Liked 系列 第 58 篇

技術 [Day 57] Linked List Cycle II (Medium)

142. Linked List Cycle II Solution 1: HashSet class Solution: def detectCycl...

LeetCode Top 100 Liked 系列 第 57 篇

技術 [Day 56] Sliding Window Maximum (Hard)

239. Sliding Window Maximum (Hard) Solution 1: Brute Force Time Complexity: O()...

LeetCode Top 100 Liked 系列 第 56 篇

技術 [Day 55] Find First and Last Position of Element in Sorted Array (Medium)

34. Find First and Last Position of Element in Sorted Array Solution 1: Recursiv...

LeetCode Top 100 Liked 系列 第 55 篇

技術 [Day 54 - 2] Construct Binary Tree from Preorder and Inorder Traversal (Medium)

105. Construct Binary Tree from Preorder and Inorder Traversal Solution 1: Recur...

LeetCode Top 100 Liked 系列 第 54 篇

技術 [Day 54 - 1] Binary Tree Maximum Path Sum (Hard)

124. Binary Tree Maximum Path Sum Solution 1: DFS + Recursive # Definition for a...

LeetCode Top 100 Liked 系列 第 53 篇

技術 [Day 53] Validate Binary Search Tree (Medium)

98. Validate Binary Search Tree Solution 1: DFS class Solution: def _isValid...

LeetCode Top 100 Liked 系列 第 52 篇

技術 [Day 52] Linked List Cycle (Easy)

141. Linked List Cycle Solution 1: Hash class Solution: def hasCycle(self, h...

LeetCode Top 100 Liked 系列 第 51 篇

技術 [Day 51] Move Zeroes (Easy)

283. Move Zeroes Solution 1: Two Pointers class Solution: def moveZeroes(sel...

LeetCode Top 100 Liked 系列 第 50 篇

技術 [Day 50] First Missing Positive (Hard)

41. First Missing Positive Solution 1: Sort class Solution: def firstMissing...

LeetCode Top 100 Liked 系列 第 49 篇

技術 [Day 49] String to Integer (Medium)

8. String to Integer (atoi) Solution 1: Brute-Force def myAtoi(self, s: str)...

LeetCode Top 100 Liked 系列 第 48 篇

技術 [Day 48] Kth Largest Element in an Array (Medium)

215. Kth Largest Element in an Array Solution 1: Sort class Solution: def fi...

LeetCode Top 100 Liked 系列 第 47 篇

技術 [Day 47] Maximum Product Subarray (Medium)

152. Maximum Product Subarray Solution 1: DP class Solution: def maxProduct(...

LeetCode Top 100 Liked 系列 第 46 篇

技術 [Day 46] Zigzag Conversion (Medium)

6. Zigzag Conversion Solution 1: 2D-Array + Simulation (模擬 Z 字形移動) class Solutio...

LeetCode Top 100 Liked 系列 第 45 篇

技術 [Day 45] Reverse Nodes in k-Group (Hard)

25. Reverse Nodes in k-Group Solution 1: Iterative class Solution: def rever...

LeetCode Top 100 Liked 系列 第 44 篇

技術 [Day 44] Lowest Common Ancestor of a Binary Tree (Medium)

236. Lowest Common Ancestor of a Binary Tree Solution 1: DFS class Solution:...

LeetCode Top 100 Liked 系列 第 43 篇

技術 [Day 43] Sort List (Medium)

148. Sort List Solution 1: Merge Sort # Definition for singly-linked list. # cla...

LeetCode Top 100 Liked 系列 第 42 篇

技術 [Day 42] Unique Binary Search Trees (Medium)

96. Unique Binary Search Trees Solution 1: DP class Solution: def numTrees(s...

LeetCode Top 100 Liked 系列 第 41 篇

技術 [Day 41] Next Permutation (Medium)

31. Next Permutation Solution 1: Two Pointer class Solution: ""&qu...

LeetCode Top 100 Liked 系列 第 40 篇

技術 [Day 40] Subsets (Medium)

78. Subsets Solution 1: Bitwise class Solution(object): def subsets(self, nu...

LeetCode Top 100 Liked 系列 第 39 篇

技術 [Day 39] Number of Islands (Medium)

200. Number of Islands Solution 1: DFS + Bitmap class Solution: def numIslan...

LeetCode Top 100 Liked 系列 第 38 篇

技術 [Day 38] Minimum Window Substring (Hard)

76. Minimum Window Substring Solution 1: Slide Window + Hash from collections im...

LeetCode Top 100 Liked 系列 第 37 篇

技術 [Day 37] Jump Game (Medium)

55. Jump Game Solution 1: DP (Tail -> Head) class Solution: def canJump(s...

LeetCode Top 100 Liked 系列 第 36 篇

技術 [Day 36] Intersection of Two Linked Lists (Easy)

160. Intersection of Two Linked Lists Solution 1: Brute-Force class Solution:...

LeetCode Top 100 Liked 系列 第 35 篇

技術 [Day 35] 122. Best Time to Buy and Sell Stock II (Medium)

122. Best Time to Buy and Sell Stock II Solution 1: DP Time Complexity: O(N)Spa...

LeetCode Top 100 Liked 系列 第 34 篇

技術 [Day 34] Find the Duplicate Number (Medium)

287. Find the Duplicate Number Solution 1: Brute-Force (TLE) class Solution:...

LeetCode Top 100 Liked 系列 第 33 篇

技術 [Day 33] Longest Valid Parentheses (Hard)

32. Longest Valid Parentheses Solution 1: Stack class Solution: def longestV...

LeetCode Top 100 Liked 系列 第 32 篇

技術 [Day 32] Coin Change (Medium)

322. Coin Change Solution 1: DP (Amount outer loop) class Solution: def coin...

LeetCode Top 100 Liked 系列 第 31 篇

技術 [Day 31] Letter Combinations of a Phone Number (Medium)

17. Letter Combinations of a Phone Number Solution 1: Recursive + DFS class Solu...

鐵人賽 自我挑戰組 DAY 30
LeetCode Top 100 Liked 系列 第 30 篇

技術 [Day 30] Merge k Sorted Lists (Hard)

23. Merge k Sorted Lists Question You are given an array of k linked-lists lists...