因為害怕打針而領取的藥物
- 2022.10.21
- 日常生活
ロラゼパム(蘿拉西泮) 0.5ml *3
A1go
聲樂課* 2022/09/10
呼吸練習 將雙手貼在肋骨處 拇指以外的四指扶住肋骨下緣 確保吐氣時肋骨不向內縮 然後做以下三種練習 吸氣 4 秒後吐氣 6 秒 用鼻子快速吐氣 30 次 用嘴巴快速吐氣並唱： ha * 4 + hi * 4 + hu * 4 + he * 4 + ho * 4 共 3 sets
聲樂課* 2022/07/30
- 2022.07.30
- 聲樂
發聲練習 唱 12345432, 12345432, 123454321 一開始是唱 u~, o~, a~； 因為 u 的位置錯誤改唱 o~, a~, u~ 體會 u 的正確位置
Leetcode # 139. Word Break
- 2022.07.22
- Dynamic Programming
https://leetcode.com/problems/word-break/ Dynamic Programming Time Complexity: O(len(s) ^ 3) Space Complexity: O(len(s)) ※ 上述複雜度也能以 Recursion wt/ Memoization 或 Depth-First Search（以 word 為節點單位）達成 class ...
Leetcode # 42. Trapping Rain Water
- 2022.07.21
- LeetCode
https://leetcode.com/problems/trapping-rain-water/ Solution Time Complexity: O(len(height)) Space Complexity: O(1) class Solution: def trap(self, height: List[int]) -> int: i, j = 0, len(height) - ...
Leetcode # 746. Min Cost Climbing Stairs
- 2022.07.21
- LeetCode
https://leetcode.com/problems/min-cost-climbing-stairs/ Solution Time Complexity: O(n) Space Complexity: O(1) ※ 參考 Leet Code #198. House Robber class Solution: def minCostClimbingStairs(self, cost: L ...
Leetcode # 92. Reverse Linked List II
- 2022.07.21
- LeetCode Linked List
https://leetcode.com/problems/reverse-linked-list-ii/ Solution 注意和 Leetcode # 206. Reverse Linked List 相同的多重賦值順序問題 Time Complexity: O(n) Space Complexity: O(1) class Solution: def reverseBetween(self, ...
[Python] 多重賦值 (Multiple Assignment) 時的計算順序
- 2022.07.21
- Multiple Assignment Python
用一個等號同時為多個變數賦值 x = a, y = b x, y = a, b 計算順序 a, b = c, d 計算 c, d 賦值 c 給 a 賦值 d 給 b 實現「數值交換 (Swap)」 a, b = b, a 因為在賦值給 a, b 之前，已經先計算過了 b, a 所以在賦值給 b 時，不會因為 a 已經改變過數值而被影響 因為計算順序而出錯的範例 Leetcode # 203. ...
Leetcode # 792. Number of Matching Subsequences
- 2022.07.21
- LeetCode
https://leetcode.com/problems/number-of-matching-subsequences/ Brute-force (Time Limit Exceeded) Time Complexity: O(len(s) * len(words)) 在檢查 s 的每一個字元時 都要遍歷 words 一次 浪費太多不必要的時間 class Solution: def numM ...
Leetcode # 1110. Delete Nodes And Return Forest
- 2022.07.20
- Depth-First Search LeetCode Tree
https://leetcode.com/problems/delete-nodes-and-return-forest/ Solution class Solution: def delNodes(self, root: Optional[TreeNode], to_delete: List[int]) -> List[TreeNode]: to_delete = set(to_delet ...
