https://leetcode.com/problems/house-robber/
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| map<int, int> memo; | |
| vector<int> h; | |
| int dp(int i){ | |
| // base | |
| if(i == 0) | |
| return h[i]; | |
| if(i == 1) | |
| return max(h[0], h[1]); | |
| // use memo | |
| if(memo.find(i) != memo.end()) | |
| return memo[i]; | |
| // relation | |
| memo[i] = max(dp(i-1), dp(i-2) + h[i]); | |
| return memo[i]; | |
| } | |
| int rob(vector<int>& nums) { | |
| h = nums; | |
| int n = nums.size(); | |
| return dp(n - 1); | |
| } | |
| }; |
No comments:
Post a Comment