classSolution{public:intmaxProfit(vector<int>& prices){int result =0;for(int i =0; i < prices.size()-1;++ i){
result +=max(prices[i +1]- prices[i],0);}return result;}};
跳跃游戏
// 回溯 超出时间限制classSolution{public:boolcanJump(vector<int>& nums){if(nums.empty())returnfalse;returnbacktracking(nums,0);}boolbacktracking(vector<int>& nums,int startIndex){if(startIndex == nums.size()-1)returntrue;for(int i =1; i <= nums[startIndex]&& startIndex + i < nums.size();++ i){if(backtracking(nums, startIndex + i))returntrue;}returnfalse;}};// 自己没思路,看了题解之后感觉贪心算法太巧了classSolution{public:boolcanJump(vector<int>& nums){int cover =0;if(nums.empty())returnfalse;if(nums.size()==1)returntrue;for(int i =0; i <= cover;++ i){
cover =max(i + nums[i], cover);if(cover >= nums.size()-1)returntrue;}returnfalse;}};