基於內觀的認知治療 🚫 勿在憂鬱發作期間實行本練習 關於「憂鬱」 憂鬱症的盛行率 約有 12% 的男性 與 20% 的女性，在一生中會罹患重鬱症 (major depression) 重鬱症的第一次發作通常在 25 歲左右 有相當高比例的人在兒童期晚期或青春期，就經歷第一次完全發作 (full episode) 隨時都有約 5% 的人，正在經歷非常嚴重的憂鬱症 憂鬱可能會一直持續下去 15% ~ ...
橫（一） 豎 撇捺 豎鉤 斜鉤 臥勾 豎曲勾 走之底（辶 ㄔㄨㄛˋ） 四點火（灬 ㄏㄨㄛˇ） 宀 ㄇㄧㄢˊ / 點橫鉤（冖 ㄇㄧˋ）
Problem https://leetcode.com/problems/power-of-three Solution ⚠️ 注意 if 順序 if n == 1: return True if n < 1 or n % 3 != 0: return False if n < 1 or n % 3 != 0: return False if n == 1: return True ...
Problem https://leetcode.com/problems/reordered-power-of-2 Solution The leading digit is not zero. ⇒ 只要檢驗與 n 等長的 2k 1 <= n <= 109 ⇒ ∀ i = 0, 1, 2, …, 9; Counter(str(n))[str(i)] ≤ 9 x_code ...
Problem https://leetcode.com/problems/range-product-queries-of-powers Solution 求模倒數：費馬小定理 ⚠️ 用 pow(a, p – 2, p) 取代 (a ** (p – 2)) % p (products[l – 1] ** MODULUS_MINUS_2) % MODULUS p ...
Problem https://leetcode.com/problems/find-the-maximum-number-of-fruits-collected Solution: Bottom-Up DP (Tabulation) The children will make exactly n - 1 moves to reach the room (n - 1, n - 1) ⇒ chil ...
Problem https://leetcode.com/problems/find-smallest-common-element-in-all-rows Solution: Binary Search Time Complexity: O(len(mat) * log(len(mat[0]))) Space Complexity: O(1) (The input and output gene ...
Problem https://leetcode.com/problems/power-of-two Solution Time Complexity: O(log(n)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class Solution ...
Problem https://leetcode.com/problems/binary-tree-vertical-order-traversal Solution: BFS Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not count towar ...
Problem https://leetcode.com/problems/fruit-into-baskets Solution: Sliding Window Time Complexity: O(len(fruits)) Space Complexity: O(1) (The input and output generally do not count towards the space ...
