summary Archives - Huahua's Tech Road https://zxi.mytechroad.com/blog/tag/summary/ Fri, 02 Nov 2018 16:35:56 +0000 en hourly 1 https://wordpress.org/?v=6.0.8 https://zxi.mytechroad.com/blog/wp-content/uploads/2017/09/cropped-photo-32x32.jpg summary Archives - Huahua's Tech Road https://zxi.mytechroad.com/blog/tag/summary/ 32 32 花花酱 LeetCode DP Summary 动态规划总结 https://zxi.mytechroad.com/blog/dynamic-programming/leetcode-dp-summary/ https://zxi.mytechroad.com/blog/dynamic-programming/leetcode-dp-summary/#respond Fri, 02 Nov 2018 06:18:52 +0000 https://zxi.mytechroad.com/blog/?p=4233 Summary: Input size / sub-problem size / sub-problem complexity / time complexity / space complexity [crayon-6651028720d6b209839550/] [crayon-6651028720d72814549348/]   Summary and slides

The post 花花酱 LeetCode DP Summary 动态规划总结 appeared first on Huahua's Tech Road.

]]>

Summary: Input size / sub-problem size / sub-problem complexity / time complexity / space complexity

Category 1.1

Input: O(n)
Sub-problems: O(n)
Each sub-problem depends on O(1) smaller problems
Time complexity: O(n)
Space complexity: O(n) -> O(1)
dp[i] := solution of A[1->i] // prefix

Template

dp = new int[n + 1]
for i = 1 to n:
  dp[i] = f(A[i], dp[i-1], dp[i-2], ...)
return dp[n]

 

Summary and slides

The post 花花酱 LeetCode DP Summary 动态规划总结 appeared first on Huahua's Tech Road.

]]> https://zxi.mytechroad.com/blog/dynamic-programming/leetcode-dp-summary/feed/ 0