121. Best Time to Buy and Sell Stock
来源:互联网 发布:,数据分析师的职业规划 编辑:程序博客网 时间:2024/06/07 01:55
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.
class Solution {public: int maxProfit(vector<int>& prices) { size_t size = prices.size(); if (size <= 1) { return false; } int min = INT_MAX, max = INT_MIN; for (int i = 0; i < size; ++i) { if (min > prices[i]) { min = prices[i]; } if (max < prices[i] - min) { max = prices[i] - min; } } return max; }};
0 0
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time To Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- PIC单片机的新开发环境--MPLAB X IDE
- 3. Run Configuration的使用
- 微信不打包分享
- malloc,free用法
- 0x01 Grarils 身份验证和权限拦截案例
- 121. Best Time to Buy and Sell Stock
- 问题八 MSFlexGrid 控件
- 在win7系统中,利用命令窗口进入某个文件夹的方法
- CS231n第七课:卷积神经网络学习记录
- Android应用开发必备的20条技能
- 从零写bootloader--第一阶段启动的实现
- 网络最大流-ISAP算法详解与模板
- 自定义View---五子棋盘(自己敲了一下午,然后百度了一下,竟然有,比我自己写的好很多。好尴尬)
- C++ 众数问题(九度OJ 1057)