Time O(n). Space O(1).
Category Archives: Uncategorized
Course Schedule – Python 3 (Week 10 – 12)
Same to Course Schedule II.
Course Schedule II – Python 3 (Week 10 – 11)
Solution 1 Time O(n). Space O(n). Solution 2 Time O(n). Space O(n).
Window Sum – Python 3 (Week 10 – 10)
Solution 1 Time O(n). Space O(1). Solution 2 Time O(n). Space O(1).
Rectangle Overlap – Python 3 (Week 10 – 09)
Time O(1). Space O(1).
Maximum Subtree – Python 3 (Week 10 – 08)
Time complexity is O(n). Space complexity is O(n).
LeetCode 409 LintCode 627 – Python 3 (Week 10 – 07)
Time complexity is O(n). We need to count each letter. Space complexity is O(1). Time complexity is O(n). Space complexity is O(1).
步步发财 