[Algorithm] In-Place
- 2023.08.04
- Algorithm
In-Place Algorithm In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional to the input size. In other ...
Leetcode # 3. Longest Substring Without Repeating Characters
- 2023.08.04
- ★★ Medium LeetCode Sliding Window
https://leetcode.com/problems/longest-substring-without-repeating-characters Solution: Sliding Window Time Complexity: O(len(s)) Space Complexity: O(26) = O(1) (26 lowercase letters) (The input and ou ...
[Algorithm] Two pointers | Sliding Window
- 2023.08.04
- Floyd's tortoise and hare Sliding Window Two Pointers
Two Pointers 收縮型 One Input, Opposite Ends (相反的兩端：[left → … ← right]) left 和 right 兩個 pointer 為 opposite ends (相反的兩端；起始於起點和終點，並越來越靠近) Template def fn(arr): ans = 0 left, right = 0, len(arr) - 1 w ...
Leetcode # 424. Longest Repeating Character Replacement
- 2023.08.04
- ★★ Medium LeetCode Sliding Window
https://leetcode.com/problems/longest-repeating-character-replacement Solution: Sliding Window Time Complexity: O(len(s)) Space Complexity: O(len(s)) (The input and output generally do not count towar ...
Leetcode # 17. Letter Combinations of a Phone Number
https://leetcode.com/problems/letter-combinations-of-a-phone-number Solution n = len(digits) Time Complexity: O(4 * (4 ** 2) * (4 ** 3) * … * (4 ** n)) = O((4 ** n) * n) Space Complexity: O(n) ( ...
[発音記号] 「I 和 i」「U 和 u」的差別
- 2023.08.02
- English
発音記号：「I 和 i」「U 和 u」的差別 I U (ʊ) 嘴型較為放鬆 it, pick influence i u 短而急促 happy, money put, book Ref WIKIPEDIA: 発音記号 米山 明日香 (2021). 英語「発音記号」の鬼50講. WIKIPEDIA: Vowel
Leetcode # 2361. Minimum Costs Using the Train Line
https://leetcode.com/problems/minimum-costs-using-the-train-line Solution n := len(regular) == len(express) prev[0/1] := 前一站為止留在 regular/express 車廂上的最小 cost Time Complexity: O(n) Space Complexity: O(1 ...
Leetcode # 46. Permutations
- 2023.08.02
- ★★ Medium Backtracking LeetCode Memoization Permutation Recursion
https://leetcode.com/problems/permutations Solution Time Complexity: O(n * n!) n := len(nums) nums 的排列有 n! 種，每一種的長度皆為 n Space Complexity: O(n) recursion call stack 的最大 depth 為 n output 所使用的空間不計入 space ...
聲樂課* 2023/08/02
- 2023.08.02
- 聲樂
一週心得 「聲帶作動發聲需要的氣息」和「維持 appoggio 需要的氣息」 唱低音時，placement 相對升高 唱母音 i 的方法： 用 u 的嘴形唱 可以適當嘴唇施力露出牙齒增加體感 發聲的位置在聲帶 共鳴的位置在咽喉 發聲練習 唱 a-e-i-o-u 口腔維持同樣的張開，只動舌頭 如果太緊繃的話： 活動上下顎放鬆舌頭 彈舌：唱 1-2-3-2-1
Catalan Number
- 2023.08.02
- Catalan Number Mathematics
Ref WIKIPEDIA: Catalan Number
