122.买卖股票的最佳时机II
#伪代码
int result=0
for(i=1;i<price.size();i++){
result+=max(0,price[i]-price[i-1])
}
return result
class Solution:
def maxProfit(self, prices: List[int]) -> int:
#贪心算法
result=0
for i in range(1,len(prices)):
result+=max(0,prices[i]-prices[i-1])
return result
55. 跳跃游戏
#伪代码
int cover=0
if(nums.szie()==1) return True;
for(i=0;i<=cover;i++){
cover=max(cover,i+nums[i])
if cover>=len(nums)-1:
return True
}
return False
45.跳跃游戏II
if(nums.size()==1) return 0;
int cur=0;
int next=0;
int result=0;
for(i=0;i<nums.size();i++){
next=max(i+nums[i],next)
if(i==cur){
if(cur!=nums.size()-1)
result+=1
cur=next;
if(cur>=nums.size()-1) break;
else break;
}
}
return result
class Solution:
def jump(self, nums: List[int]) -> int:
if(len(nums)==1):
return 0
cur_step=0
next_step=0
result=0
for i in range(len(nums)):
next_step=max(next_step,i+nums[i])
if(i==cur_step):
if(cur_step!=len(nums)-1):
result+=1
cur_step=next_step
if(cur_step==len(nums)-1):
break
else:
break
return result