Problem https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone Solution Time Complexity: O(len(seats) * log(len(seats))) Space Complexity: O(len(seats)) (The input and output generally ...
Problem https://leetcode.com/problems/max-chunks-to-make-sorted 把 arr 分成數個 chunk, [sorted(chunk) for chunk in chunks] == sorted(arr) Solution: PrefixMax and SuffixMin Arrays prefix := arr[0 : i] suffi ...
Problem https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop ∀ i in range(prices), If ∃ js = [j for j in range(i + 1, len(prices)) if (j > i and prices[j] <= prices[i])] ...
Problem https://leetcode.com/problems/construct-string-with-repeat-limit Solution Time Complexity: O(len(s)) Space Complexity: O(1) (The input and output generally do not count towards the space compl ...
Problem https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i Solution Time Complexity: O(len(nums)) + k * log(len(num))) Space Complexity: O(len(nums)) (The input and ou ...
Problem https://leetcode.com/problems/maximum-average-pass-ratio Solution: Priority Queue Priority Queue 裡面要放甚麼？ the pass ratios the number of total students the gains in the pass ratio Code Time Comp ...
for i, (a, b, c) in enumerate(list_x)
Problem https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements Solution: Sorting Sort by Multiple Keys Time Complexity: O(len(nums) * log(len(nums))) Space Complexity: O(len(n ...
Problem https://leetcode.com/problems/take-gifts-from-the-richest-pile Solution Time Complexity: O(len(gifts)) Space Complexity: O(len(gifts)) (The input and output generally do not count towards the ...
Function def function(): ... Method class 底下有 method 和 attribute (屬性), 即 method 便是 class 的 member function (成員函式) class c: def method(): ...
