Best Time to Buy and Sell Stock 系列问题
来源:互联网 发布:福岛堆芯熔化 知乎 编辑:程序博客网 时间:2024/05/16 10:58
Say you have an array for which the ith 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.
Example 1:
Input: [7, 1, 5, 3, 6, 4]Output: 5max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]Output: 0In this case, no transaction is done, i.e. max profit = 0.
这是一个模范做法= =我自己做的超时了。。。。。。。。
这是买股票的问题 首先要在前面选择一个最低价买入 然后要在买入之后选择最大利润的时候卖出
股票是一个系列问题 日后继续更
股票系列问题
public class Solution { public int maxProfit(int[] prices) { if (prices.length < 2) return 0; int maxProfit = 0; int curMin = prices[0]; for (int i = 1; i < prices.length; i++) {//遍历一次数组 寻找 curMin = Math.min(curMin, prices[i]);寻找目前遍历过的最低价 maxProfit = Math.max(maxProfit, prices[i] - curMin); } return maxProfit; }}
Say you have an array for which the ith 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 maxprofit=0; for(int i=1;i<prices.length;i++){ if(prices[i]>prices[i-1]){ maxprofit+=prices[i]-prices[i-1]; } } return maxprofit; }}
Say you have an array for which the ith 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).
限定买卖次数为两次的情况 将分别遍历在不同位置分为两半的买卖利润
选取最大值
public class Solution { public int maxProfit(int[] prices) { if (prices.length < 2) return 0; int n = prices.length; int[] preProfit = new int[n]; int[] postProfit = new int[n]; int curMin = prices[0]; for (int i = 1; i < n; i++) { curMin = Math.min(curMin, prices[i]); preProfit[i] = Math.max(preProfit[i - 1], prices[i] - curMin); } int curMax = prices[n - 1]; for (int i = n - 2; i >= 0; i--) { curMax = Math.max(curMax, prices[i]); postProfit[i] = Math.max(postProfit[i + 1], curMax - prices[i]); } int maxProfit = 0; for (int i = 0; i < n; i++) { maxProfit = Math.max(maxProfit, preProfit[i] + postProfit[i]); } return maxProfit; }}
- Best Time to Buy and Sell Stock 系列问题
- Best Time to Buy and Sell Stock系列问题题解
- Best Time to Buy and Sell Stock系列问题
- 【Leetcode长征系列】Best Time to Buy and Sell Stock
- [LeetCode]Best Time to Buy and Sell Stock 系列
- LeetCode-Best Time to Buy and Sell Stock系列
- LeetCode Best Time to Buy and Sell Stock 系列
- (java)Best Time to Buy and Sell Stock系列
- LeetCode Week12: Best Time to Buy and Sell Stock系列
- leetCode 系列:best time to buy and sell stock
- LeetCode系列:best time to buy and sell stock
- leetcode Best Time to Buy and Sell Stock 系列
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Tomcat shutdown执行后无法退出进程问题排查及解决
- oc-深浅复制
- 在struts中使用checkbox实现批量删除
- Struts2.0实现的文件上传(单附件和多附件)以及附件下载功能
- Struts2防止表单重复提交
- Best Time to Buy and Sell Stock 系列问题
- struts2 action间跳转传值
- jquery 开发总结
- javascript日期比较
- (转)关于多人操作数据的处理策略
- (转)Windows下关闭占用指定端口应用程序的方法
- Masonry介绍与使用实践:快速上手Autolayout
- (转)MyEclipse-7.5.0版注册码破解及激活操作
- dedecms标签四 : 封面模板常用标签