# [LeetCode]--121. 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 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. 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: 0

In this case, no transaction is done, i.e. max profit = 0.

public int maxProfit(int[] prices) {
if (prices.length == 0)
return 0;
int minPro = prices[0];
int maxGap = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] - minPro > maxGap)
maxGap = prices[i] - minPro;
if (prices[i] < minPro)
minPro = prices[i];
}
return maxGap;
}

10056 0

26781 0

11597 0
windows server 2008阿里云ECS服务器安全设置

9156 0

13869 0

4653 0

22377 0
+关注
yexx
CSDN博客地址---http://blog.csdn.net/bug_moving GitHub地址---https://github.com/androidwolf
308

0

《2021云上架构与运维峰会演讲合集》

《零基础CSS入门教程》

《零基础HTML入门教程》