LeetCode 121 Best Time to Buy and Sell Stock
LeetCode 121 Best Time to Buy and Sell Stock
ShenduCC
发布于 2018-07-24 16:06:45
发布于 2018-07-24 16:06:45
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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note that you cannot sell a stock before you buy one.
Example:
c++
class Solution {
public:
int maxProfit(vector<int>& prices) {
int minx = 9999999;
int ans = 0;
int l = prices.size();
for(int i=0;i<l;i++)
{
minx = min(minx,prices[i]);
ans = max(ans,prices[i]-minx);
}
return ans;
}
};本文参与 腾讯云自媒体分享计划，分享自作者个人站点/博客。
原始发表：2018-07-16 ，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读