1、题目:Jump Game
链接:https://leetcode.com/problems/jump-game/
思路:dp[i]:当前i位置可以到达的最远距离;从nums后面开始遍历,一次缩小问题规模
public boolean canJump(int[] nums) {
int len = nums.length;
if(len == 0 || len == 1)
return true;
int[] dp = new int[len];
for(int i = 0; i < len; i++){
dp[i] = i + nums[i];
}
int des = len - 1;
for(int i = len - 2; i >= 0; i--){
if(dp[i] >= des){
des = i;
if(i == 0)
return true;
}
}
return false;
}
2、题目:Best Time to Buy and Sell Stock II
链接:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
思路:贪心法,局部最小买入,局部最大卖出,可以获得最大利润,构造全局最优解
public int maxProfit(int[] prices) {
//局部最小买入,局部最大卖出,可以获得最大利润,构造全局最优解
int res = 0;
for (int i = 0; i < prices.length - 1; ++i) {
if (prices[i] < prices[i + 1]) {
res += prices[i + 1] - prices[i];
}
}
return res;
}