[Flutter] 基礎架構
- 2023.08.19
- Flutter
lib/main.dart This file contains the main entry point and the application widgets. lib/config.dart This file contains the environment settings. pubspec.yaml This file contains the package configurati ...
受保護的內容: 家人喜歡吃的東西
- 2023.08.18
- 日常生活
受密碼保護的文章不會產生內容摘要。
Leetcode # 1335. Minimum Difficulty of a Job Schedule
- 2023.08.18
- ★★★ Hard Dynamic Programming LeetCode
https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule Solution: Top-Down DP n := len(jobDifficulty) Time Complexity: O((d * n) * n) = O(d * (n ** 2)) recursion call stack: O(d * n) for i ...
日本語のビジネスメールの書き方
- 2023.08.18
- Japanese
Format 件名 (Title)：【{自分の所属する組織名}】{用件}について 本文 (Body)： {宛名：[{組織名}][{部署名}][{役職}]{名前}様} お世話になっております (冒頭の挨拶)。[{組織名}の]{名前}です。 {本メールの結論} {詳細内容} よろしくお願いいたします (結びの挨拶)。 {署名 (簽名檔；Signature Line/Block)} 冒頭の挨拶の例 お世 ...
Leetcode # 1615. Maximal Network Rank
https://leetcode.com/problems/maximal-network-rank Solution E := number of edges = len(cities) V := number of vertexes/nodes = len(roads) Time Complexity: O(E + V ** 2) Space Complexity: O(E) (The inp ...
Leetcode # 1909. Remove One Element to Make the Array Strictly Increasing
https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing Solution n := len(nums) Ni := nums[i] i := [1, n – 1] 「如果我們從 nums 刪除一個節點後，nums 為嚴格遞增」 如果 nums 原本不是嚴格遞增 但符合題 ...
Leetcode # 239. ⭐️ Sliding Window Maximum
- 2023.08.16
- ★★★ Hard deque LeetCode Sliding Window
https://leetcode.com/problems/sliding-window-maximum First Solution Time Complexity: O((n – k) * log(k)) Space Complexity: O(k) (The input and output generally do not count towards the space com ...
[Python] 測量片段代碼執行所需時間
- 2023.08.16
- Python
timeit timeit timeit.timeit( stmt='pass', setup='pass', timer=<default timer>, number=1000000, globals=None ) repeat timeit.repeat( stmt='pass', setup='pass', timer=<default t ...
Leetcode # 86. Partition List
- 2023.08.15
- ★★ Medium LeetCode Linked List
https://leetcode.com/problems/partition-list Solution ge_cur.next = cur ge_cur = cur → ge_cur = ge_cur.next = cur ⇒ 1. ge_cur ← cur 2. ge_cur.next ≡ cur.next ← cur ⇒ loop ge_cur.next = ge_cur = cur ⇒ ...
關於 2D 座標 About 2D Coordinate
- 2023.08.15
- Coordinate Programming Techniques / Tools Python
Naming grid is a m × n matrix m := len(grid) n := len(grid[0]) $$ grid = \left| \begin{aligned} & a_{0, 0} & \quad & a_{0, 1} & \quad & a_{0, 2} & \quad & … & \qu ...
