139.单词拆分
bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> wordSet(wordDict.begin(),wordDict.end());
vector<bool> dp(s.size()+1,false);
dp[0]=true;
for(int i=1;i<=s.size();i++){
for(int j=0;j<i;j++){
string word=s.substr(j,i-j);
if(wordSet.find(word)!=wordSet.end() && dp[j]){
dp[i]=true;
}
}
}
return dp[s.size()];
}
198.打家劫舍
int rob(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
vector<int> dp(nums.size());
dp[0]=nums[0];
dp[1]=max(nums[1],nums[0]);
for(int i=2;i<nums.size();i++){
dp[i]=max(dp[i-2]+nums[i],dp[i-1]);
}
return dp[nums.size()-1];
}
213.打家劫舍II
class Solution {
public:
int robRange(vector<int>& nums,int start,int end) {
if(end==start) return nums[start];
vector<int> dp(nums.size());
dp[start]=nums[start];
dp[start+1]=max(nums[start],nums[start+1]);
for(int i=start+2;i<=end;i++){
dp[i]=max(dp[i-2]+nums[i],dp[i-1]);
}
return dp[end];
}
int rob(vector<int>& nums) {
if(nums.size()==0) return 0;
if(nums.size()==1) return nums[0];
int result1=robRange(nums,0,nums.size()-2);
int result2=robRange(nums,1,nums.size()-1);
return max(result1,result2);
}
};
337.打家劫舍 III
vector<int> robTree(TreeNode* cur){
if(cur==nullptr) return vector<int>{0,0};
vector<int> left=robTree(cur->left);
vector<int> right=robTree(cur->right);
int val1=cur->val+left[0]+right[0];
int val2=max(left[0],left[1])+max(right[0],right[1]);
return {val2,val1};
}
int rob(TreeNode* root) {
vector<int> result=robTree(root);
return max(result[0],result[1]);
}