121.Best Time to Buy and Sell Stock

class Solution {
public:int maxProfit(vector<int>& prices) {int n = prices.size();if (n==0){return 0;}int res = 0;int mmin = prices[0];for (int i=1;i<n;i++){res = max(res,prices[i]-mmin);mmin = min(mmin,prices[i]);}return res;}
};

转载于:https://www.cnblogs.com/smallredness/p/10677152.html

121.Best Time to Buy and Sell Stock相关推荐

【贪心和 DP + 卖股票】LeetCode 121. Best Time to Buy and Sell Stock
LeetCode 121. Best Time to Buy and Sell Stock Solution1:我的答案动态规划和贪心不要区分的那么明显嘛~~~ class Solution { p ...
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 ...
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 w ...
leetcode python3 简单题121. Best Time to Buy and Sell Stock
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百二十一题 (1)题目英文: Say you have an array fo ...
Leetcode——121. Best Time to Buy and Sell Stock
题目原址 https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ 题目描述 Say you have an ...
LeetCode 121 Best Time to Buy and Sell Stock（股票买入卖出的最佳时间）
翻译话说你有一个数组,其中第i个元素表示在第i天的股票价格.如果你被只被允许最多一次交易(例如,买入然后卖出一个股票),设计一个算法并找出最大利润. 原文 Say you have an array ...
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 w ...
121. Best Time to Buy and Sell Stock买卖股票的最佳时机
You are given an array prices where prices[i] is the price of a given stock on the ith day. 给定一个数组 p ...
121 Best Time to Buy and Sell Stock
输入:一个数组prices,prices[i]表示第i天股票的价格. 输出:买卖股票的最大收益. 规则:只允许最多买一次,最多卖一次股票.如果觉得价格不合适,可以不买卖. 分析1:最先想到的是暴力搜索 ...
121. Best Time to Buy and Sell Stock
一.题目 1.审题 2.分析给出一个数组,让你先已 val1 买入,再以 val2 卖出,求获得的利润最大是多少. 二.解答 1.思路: 方法一. 用遍历 min 记录到当前位置的最小值: max ...

121.Best Time to Buy and Sell Stock

121.Best Time to Buy and Sell Stock相关推荐

最新文章

热门文章