Description:
Solution:
temp is for rob2.
rob1 & rob2 is adjacent pointer.
We are gonna compare n to (n - 1) + (n + 1)!
'LeetCode 🏔️ > Dynamic Programming' 카테고리의 다른 글
| 91. Decode Ways (0) | 2023.07.04 |
|---|---|
| 213. House Robber II (0) | 2023.07.02 |
| 377. Combination Sum IV (0) | 2023.06.30 |
| 139. Word Break (0) | 2023.06.29 |
| 300. Longest Increasing Subsequence (0) | 2023.06.28 |
Description:
Solution:
temp is for rob2.
rob1 & rob2 is adjacent pointer.
We are gonna compare n to (n - 1) + (n + 1)!
'LeetCode 🏔️ > Dynamic Programming' 카테고리의 다른 글
| 91. Decode Ways (0) | 2023.07.04 |
|---|---|
| 213. House Robber II (0) | 2023.07.02 |
| 377. Combination Sum IV (0) | 2023.06.30 |
| 139. Word Break (0) | 2023.06.29 |
| 300. Longest Increasing Subsequence (0) | 2023.06.28 |
