[LeetCode] Best Time to Buy and Sell Stock

0
0
0
1. 云栖社区>
2. 博客>
3. 正文

## [LeetCode] 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.

### 实现代码1

/*****************************************************************
*  @Author   : 楚兴
*  @Date     : 2015/2/17 22:00
*  @Status   : Accepted
*  @Runtime  : 17 ms
******************************************************************/
#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
int maxProfit(vector<int> &prices) {
if (prices.size() <= 1)
{
return 0;
}
int max_local = 0;
int max_global = 0;
int base = prices[0];
int i = 0;
while (i < prices.size() - 1)
{
if (prices[i] < base)
{
base = prices[i];
}
else if (prices[i] >= prices[i + 1])
{
max_local = prices[i] - base;
max_global = max_global > max_local ? max_global : max_local;
}
i++;
}
max_local = prices[i] - base;
max_global = max_global > max_local ? max_global : max_local;

return max_global;
}
};

### 实现代码2

class Solution {
public:
int maxProfit(vector<int> &prices) {
if (prices.size() == 0)
{
return 0;
}

int max_local = 0;
int max_global = 0;
for (int i = 0; i < prices.size() - 1; i++)
{
max_local = max(max_local + prices[i + 1] - prices[i], 0);
max_global = max(max_local, max_global);
}

return max_global;
}
};

+ 关注