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 ...
Naming Convention 命名規則
- 2023.08.15
- Programming Techniques / Tools
- NamingConvention
Naming Convention Python Class and Function/Method (UpperCamelCase) Constant (CAPITALIZED_WITH_UNDERSCORES) Others (lowercase_separated_by_underscores) Underscore Before a Name (name_) Avoid Keyword C ...
Leetcode # 490. The Maze
- 2023.08.15
- ★★ Medium Breadth-First Search LeetCode
https://leetcode.com/problems/the-maze Solution m := len(maze) n := len(maze[0]) Time Complexity: O(m * n) Space Complexity: O(m * n) (The input and output generally do not count towards the space com ...
Leetcode # 215. Kth Largest Element in an Array
https://leetcode.com/problems/kth-largest-element-in-an-array Solution n := len(nums) Time Complexity: O(n * log(k)) Space Complexity: O(k) (The input and output generally do not count towards the spa ...
Leetcode # 2369. Check if There is a Valid Partition For The Array
- 2023.08.14
- @lru_cache ★★ Medium functools LeetCode Memoization Recursion
https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array Solution n := len(nums) Time Complexity: O(3 ** n)O(n) (due to memoization) Space Complexity: O(n) (The input and output ...
