classSolution{public:intmaxProfit(vector<int>& prices){int result =0;for(int i =1; i < prices.size(); i++){if(prices[i]- prices[i -1]>0){
result += prices[i]- prices[i -1];}}return result;}};
classSolution{public:boolcanJump(vector<int>& nums){bool result =true;int farest =0;for(int i =0; i < nums.size(); i++){
farest =max(farest, i + nums[i]);if(i == farest && nums[i]==0&& i != nums.size()-1)returnfalse;}returntrue;}};