LintCode 149. Best Time to Buy and Sell Stock 原创Java参考解答

LintCode 149. Best Time to Buy and Sell Stock 原创Java参考解答

问题描述

http://www.lintcode.com/en/problem/best-time-to-buy-and-sell-stock/

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

Given array [3,2,3,1,2], return 1.

解题思路

题目是求买卖股票的最大收益。

问题的实质是找prices[i2] – prices[i1]差值最大。

prices[i2]为prices数组的最大值, prices[i1]为prices数组的最小值,i1 < i2。

参考代码

相关题目

LintCode All in One 原创题目讲解汇总

发表评论

电子邮件地址不会被公开。 必填项已用*标注