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 ...
一週心得 唱義大利歌曲時，音階中間的母音盡可能唱長 發聲練習 鼓起臉頰吹氣，氣要維持細而強，吹氣瞬間腹部微縮再向外張
一週心得 張嘴時如果不是縱向，會導致咽腔空間堵塞、空氣無法流通、進而無法產生共鳴 張嘴時記得是平行而非扇形 提起顴骨製造咽腔空間時，僅需微微抬起（眼睛微瞇程度）即可 發聲練習 唱TA-TA-TA, TA~~; 5-3-1, 5~3~1~ 空氣猛烈地衝出顱外，再讓聲音輕輕地著陸在臉頰上 大腿內側、屁股、屁股下方夾緊 唱每一個TA時都將腹部向外張 注意始終保持住一致的共鳴空間
