ziyang_li/LeetCode
1
0
Fork 0
mirror of https://github.com/ShusenTang/LeetCode.git synced 2024-09-02 14:20:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Create 121. Best Time to Buy and Sell Stock.md

Browse Source
This commit is contained in:
唐树森 2018-09-02 16:35:10 +08:00 committed by GitHub
parent 8ed5e92d5f
commit 1d33ccea72
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 20 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
121. Best Time to Buy and Sell Stock.md Normal file
View File

@ -0,0 +1,20 @@
# [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)
# 思路
题目的意思就是求数组prices中，prices[i]-prices[j]的最大值,其中i > j。
因此prices[j]肯定是prices[i]之前的元素中最小的那一个，所以从前往后遍历，并用min_price记录当前位置前的元素中最小的一个。
另外注意单独判断空数组的情况。
# C++
```
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.size() == 0) return 0;
int max_profit = 0, min_price = prices[0];
for(int i = 1; i < prices.size(); i++){
if(prices[i] - min_price > max_profit) max_profit = prices[i] - min_price;
if(min_price > prices[i]) min_price = prices[i];
}
return max_profit;
}
};
```