Problem https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold Solution: Sliding Window First Solution Time Complexity: O(len(arr)) Space Complexit ...
Problem https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists Solution: Sliding Window [Time Limit Exceeded 86 / 88 testcases passed] all_nums := list(itertools.chain.from_itera ...
Problem https://leetcode.com/problems/count-subarrays-with-fixed-bounds fixed_bound_subarray := nums[i:j]; 0 <= i, j < len(nums); i <= j min(fixed_bound_subarray) == minK ≡ (∀ num ∈ fixed_bou ...
Problem https://leetcode.com/problems/max-consecutive-ones-ii 相關例題 Leetcode # 485. Max Consecutive Ones Leetcode # 1004. Max Consecutive Ones III Solution Time Complexity: O(len(nums)) Space Complexit ...
Problem https://leetcode.com/problems/max-consecutive-ones-iii 相關例題 Leetcode # 485. Max Consecutive Ones Solution: Sliding Window Time Complexity: O(len(nums)) Space Complexity: O(1) (The input and ou ...
Problem https://leetcode.com/problems/max-consecutive-ones Solution Time Complexity: O(len(nums)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) cla ...
Problem https://leetcode.com/problems/max-consecutive-ones-iii Solution: Greedy Method k := sideLength 當 square 橫向移動 grid[i:i + k, j].count(1) == grid[i:i + k, j + k].count(1) 同理，縱向移動時， grid[i, j:j ...
Problem https://leetcode.com/problems/minimum-penalty-for-a-shop Solution Time Complexity: O(len(customers)) Space Complexity: O(1) (The input and output generally do not count towards the space compl ...
Definition Prefix Sum The sums of prefixes (running totals). $$ y_i = \sum^i_{k = 0}{x_k} $$ 前 i 個 xk 的總和 Prefix ex: breakfast bre 是 breakfast 的 prefix 相關例題 不用確實計算 Prefix Sum 的例子 Leetcode # 2483. Mini ...
Problem https://leetcode.com/problems/maximum-average-subarray-i Solution Time Complexity: O(len(nums)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity ...
