《leetcode》best-time-to-buy-and-sell-stock-i-ii-iii

题目描述1

Say you have an array for which the i th element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

解析：可以多次买卖，那么就简单了，只需要在波谷买进，波峰卖出就可以了

public class Solution {public int maxProfit(int[] prices) {int maxProfile=0;for(int i=0;i<prices.length-1;i++){if(prices[i]<prices[i+1]){maxProfile+=prices[i+1]-prices[i];}}return maxProfile;}
}

题目描述2

Say you have an array for which the i th element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

解析：题目表示最多只能买卖一次

public class Solution {public int maxProfit(int[] prices) {int maxProfile=0;for(int i=0;i<prices.length;i++){for(int j=i+1;j<prices.length;j++){maxProfile=maxProfile>(prices[j]-prices[i])?maxProfile:(prices[j]-prices[i]);}}return maxProfile;}
}

题目描述3（较为复杂些了）

Say you have an array for which the i th element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

解析：最多买卖两次，可以以i为分界线，然后在i的左侧搜索最大的利润，在i的右侧也搜索最大的利润，最后算总的利润。

测试用例
输入：
[6,1,3,2,4,7]

输出：
7

import java.util.*;
public class Solution {public int maxProfit(int[] prices) {int maxProfile=0;int length=prices.length;for(int i=0;i<length;i++){int leftMax=0,rightMax=0;for(int j=0;j<i;j++){//搜索左侧的最大利润for(int k=j+1;k<=i;k++){int temp =prices[k]-prices[j];leftMax=leftMax>temp?leftMax:temp;}}for(int j=i+1;j<length;j++){//搜索右侧的最大利润for(int k=j+1;k<length;k++){int temp =prices[k]-prices[j];rightMax=rightMax>temp?rightMax:temp;}}if(leftMax+rightMax>maxProfile){maxProfile=leftMax+rightMax;}}return maxProfile;}
}

《leetcode》best-time-to-buy-and-sell-stock-i-ii-iii相关推荐

【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告
原文地址:http://liangjiabin.com/blog/2015/04/leetcode-best-time-to-buy-and-sell-stock.html Best Time to ...
Best Time to Buy and Sell Stock I II III IV （第四周动态规划）
Best Time to Buy and Sell Stock I II III IV (第四周动态规划) Best Time to Buy and Sell Stock I Say you hav ...
【leetcode】best time to buy and sell stocks(i, ii, iii, iv, v)
i.只允许一次交易思路:从前向后遍历数组,记录当前出现过的最低价格,作为买入价格,并计算以当天价格出售的收益,作为可能的最大收益,整个遍历过程中,出现过的最大收益就是所求. class Soluti ...
LeetCode 123. Best Time to Buy and Sell Stock III--Python解法--动态规划--数学题
此文首发于我的个人博客:zhang0peter的个人博客 LeetCode题解文章分类:LeetCode题解文章集合 LeetCode 所有题目总结:LeetCode 所有题目总结题目地址:Best ...
leetcode 714. Best Time to Buy and Sell Stock with Transaction Fee | 714. 买卖股票的佳最时机含手续费（递归-＞傻缓存-＞dp）
题目 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/ 题解经典的暴力递归 - ...
【DP + 卖股票】LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee
LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee Solution1: 参考网址:http://www.cnblog ...
【DP + 卖股票】LeetCode 309. Best Time to Buy and Sell Stock with Cooldown
LeetCode 309. Best Time to Buy and Sell Stock with Cooldown Solution1: 比较有难度的一道动态规划题了! 参考网址:http://z ...
【DP + 卖股票】LeetCode 188. Best Time to Buy and Sell Stock IV
LeetCode 188. Best Time to Buy and Sell Stock IV Solution1:我的答案参考链接:http://www.cnblogs.com/grandyan ...
【DP + 卖股票】LeetCode 123. Best Time to Buy and Sell Stock III
LeetCode 123. Best Time to Buy and Sell Stock III Solution1: 不得不让人感叹算法之精妙啊!!! 参考网址:[1]http://www.cnb ...
【贪心和 DP + 卖股票】LeetCode 122. Best Time to Buy and Sell Stock II
LeetCode 122. Best Time to Buy and Sell Stock II Solution1:我的答案贪心和DP傻傻分不清! class Solution { public: ...

《leetcode》best-time-to-buy-and-sell-stock-i-ii-iii

《leetcode》best-time-to-buy-and-sell-stock-i-ii-iii相关推荐

最新文章

热门文章