Leetcode # 213. House Robber II
https://leetcode.com/problems/house-robber-ii Solution _rob() := 必定搶最後一間的收益 結果 := max(搶最後一間, 不搶最後一間) = max(搶最後一間 and 不搶第一間, 不搶最後一間) = max(_rob(nums[1:]), robs(nums[:-1])) Time Complexity: O ...
Leetcode # 740. Delete and Earn
https://leetcode.com/problems/delete-and-earn Solution Time Complexity: O(len(nums)) Space Complexity: O(len(counter)) (The input and output generally do not count towards the space complexity.) class ...
Leetcode # 1137. N-th Tribonacci Number
- 2023.08.08
- ★ Easy Dynamic Programming LeetCode
https://leetcode.com/problems/n-th-tribonacci-number Solution Time Complexity: O(n) Space Complexity: O(n) (The input and output generally do not count towards the space complexity.) class Solution: d ...
Leetcode # 2808. Minimum Seconds to Equalize a Circular Array
https://leetcode.com/contest/biweekly-contest-110/problems/minimum-seconds-to-equalize-a-circular-array/ Solution 解這題的心路歷程 找平均值 ⇒ [8,13,3,3] → 找眾數.⇒ [1,11,11,11,19,12,8,7,19] → 接觸到鄰居最多的數 ⇒ [8,14,10,6 ...
[macOS] zsh: command not found
echo $SHELL ⇒ /bin/zsh nano ~/.zshrc export PATH=${PATH}:...新的路徑... 重新開機 或 source .zshrc
Leetcode # 1145. Binary Tree Coloring Game
- 2023.08.05
- ★★ Medium Binary Tree LeetCode
https://leetcode.com/problems/binary-tree-coloring-game Solution Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not count towards the space complexity. ...
Leetcode # 79. Perfect Squares
https://leetcode.com/problems/perfect-squares Solution 問題所求的是合成數字 n 所需 perfect square 最小數量 故，此題 dp[l] := l 個 perfect square 能合成出來的數 = [e + ps for e in dp[l – 1] for ps in pss] pss := [1, 4, 9, ...
Leetcode # 438. Find All Anagrams in a String
- 2023.08.05
- ★★ Medium Hash Table LeetCode Sliding Window
https://leetcode.com/problems/find-all-anagrams-in-a-string Solution: Sliding Window with HashMap Time Complexity: O(len(s)) Space Complexity: O(len(p)) (The input and output generally do not count to ...
Leetcode # 139. Word Break
- 2023.08.04
- ★★ Medium Dynamic Programming LeetCode
https://leetcode.com/problems/word-break Solution dp[i] := ∃ j < i s.t. dp[j] == True and s[j:i] in words dp[0] := True n := len(s) m := len(wordDict) k := max([len(w) for w in wordDict]) Time Comp ...
Leetcode # 209. Minimum Size Subarray Sum
https://leetcode.com/problems/minimum-size-subarray-sum Solution: Sliding Window Time Complexity: O(len(nums)) Space Complexity: O(1) (The input and output generally do not count towards the space com ...
