Time O(n). Space O(1).
Tag Archives: Dynamic Programming
Longest Palindromic Subsequence – Python 3 (Week 17 – 11)
Space, Time O(n^2).
Largest Divisible Subset – Python 3 (Week 17 – 10)
Time O(n^2). Space O(n).
Longest Increasing Subsequence – Python 3 (Week 17 – 09)
Time O(n^2). Space O(n).
Regular Expression Matching – Python 3 (Week 17 – 07)
Time, Space O(mn).
Wildcard Matching – Python 3 (Week 17 – 06)
Time, Space O(len(s)*len(p)).
Triangle – Python 3 (Week 17 – 05)
Solution 1 Divide Conquer + Memoization Time O(n^2). Space O(n) or O(n^2).
步步发财 