classSolution{public:intmaxProfit(vector<int>& prices){int res =0;for(int i =1; i < prices.size(); i++){
res += std::max((prices[i]- prices[i -1]),0);}return res;}};
55. 跳跃游戏
classSolution{public:boolcanJump(vector<int>& nums){int cover =0;for(int i =0; i <= cover; i++){
cover = std::max(i + nums[i], cover);if(cover >= nums.size()-1)returntrue;}returnfalse;}};
1005. K 次取反后最大化的数组和
classSolution{public:intlargestSumAfterKNegations(vector<int>& nums,int k){sort(nums.begin(), nums.end(),[](constint& a,constint& b)->bool{returnabs(a)>abs(b);});for(int i =0; i < nums.size(); i++){if(nums[i]<0&& k >0){
nums[i]*=-1;
k--;}}if(k %2==1) nums[nums.size()-1]*=-1;int res =0;for(int a : nums) res += a;return res;}};