https://leetcode.com/problems/search-insert-position/ Solution Time Complexity: O(log(len(nums))) Space Complexity: O(1) class Solution: def searchInsert(self, nums: List[int], target: int) -> int: ...
發聲練習1 肩膀環繞至後方 兩掌互推並與胸口保持一段不小的距離， 雙臂將肋骨往左右撐開 下半身箭步（一前一後）深蹲 隨著發聲慢慢更下沉 發聲練習2 肩膀環繞至後方， 雙手向前伸但不往上，使胸口向內縮 背部肩胛骨向外綣起 雙手做抱蛋狀 雙腳與肩同寬 足弓成弓狀，腳趾與腳跟穩穩抓住地面 屁股向後，尾椎至頭部呈一直線
https://leetcode.com/problems/contains-duplicate/ Solution Sorting Time Complexity: O(n * log(n)) Space Complexity: O(1) with heap sort Worst case space complexity is O(n) and best case O(1) with sort ...
https://leetcode.com/problems/first-bad-version/ Solution Time Complexity: O(log(n)) Space Complexity: O(1) class Solution: def firstBadVersion(self, n: int) -> int: if isBadVersion(1): return 1 go ...
https://leetcode.com/problems/rotate-image/ Solution Time Complexity: O(M) Space Complexity: O(1) class Solution: def rotate(self, matrix: List[List[int]]) -> None: """ Do not return anything, modify ...
https://leetcode.com/problems/next-permutation/ Solution Step. 1 由最尾端找起，找到第一個下降的點 nums[i] Step.2 如果 nums[i] 存在，則和 nums[j] 交換 $$\mathop{\arg\min}_{j > i}{\{nums[j]\,|\,nums[j]>nums[i]\}}$$ Step.3 ...
https://leetcode.com/problems/3sum/ Solution Time Complexity: O(n ^ 2) Space Complexity: O(n) class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: dups = set() #duplicates ans = ...
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/submissions/ Solution numbers is a 1-indexed array of integers that is already sorted in non-decreasing order Time Complexity: O(n) Space ...
https://leetcode.com/problems/longest-consecutive-sequence/ Solution 只在 nums 沒有 num – 1 時向上尋找 Time Complexity: O(n) Space Complexity: O(n) class Solution: def longestConsecutive(self, nums: List ...
https://leetcode.com/problems/two-sum/ Solution class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: checked_nums = {} for i, num in enumerate(nums): if target - num ...
