Description:

Solution:

For this problem, we are gonna use hashmap.
ex) nums = [1, 2, 3], target = 4
dp[0] = 1
dp[1] = dp[1] + dp[1-1] + dp[1-2] + dp[1-3] = 0 + 1 + 0 + 0 = 1
dp[2] = dp[2] + dp[2-1] + dp[2-2] + dp[2-3] = 0 + 1 + 1 + 0 = 2
dp[3] = dp[3] + dp[3-1] + dp[3-2] + dp[3-3] = 0 + 2 + 1 + 1 = 4
dp[4] = dp[4] + dp[4-1] + dp[4-2] + dp[4-3] = 0 + 4 + 2 + 1 = 7
∵ dp[target] = 7
Time Complexity: O(mn)
Space Complexity: O(mn)
'LeetCode 🏔️ > Dynamic Programming' 카테고리의 다른 글
213. House Robber II (0) | 2023.07.02 |
---|---|
198. House Robber (0) | 2023.07.01 |
139. Word Break (0) | 2023.06.29 |
300. Longest Increasing Subsequence (0) | 2023.06.28 |
332. Coin Change (0) | 2023.05.26 |
Description:

Solution:

For this problem, we are gonna use hashmap.
ex) nums = [1, 2, 3], target = 4
dp[0] = 1
dp[1] = dp[1] + dp[1-1] + dp[1-2] + dp[1-3] = 0 + 1 + 0 + 0 = 1
dp[2] = dp[2] + dp[2-1] + dp[2-2] + dp[2-3] = 0 + 1 + 1 + 0 = 2
dp[3] = dp[3] + dp[3-1] + dp[3-2] + dp[3-3] = 0 + 2 + 1 + 1 = 4
dp[4] = dp[4] + dp[4-1] + dp[4-2] + dp[4-3] = 0 + 4 + 2 + 1 = 7
∵ dp[target] = 7
Time Complexity: O(mn)
Space Complexity: O(mn)
'LeetCode 🏔️ > Dynamic Programming' 카테고리의 다른 글
213. House Robber II (0) | 2023.07.02 |
---|---|
198. House Robber (0) | 2023.07.01 |
139. Word Break (0) | 2023.06.29 |
300. Longest Increasing Subsequence (0) | 2023.06.28 |
332. Coin Change (0) | 2023.05.26 |