Leetcode 121. Best Time to Buy and Sell Stock (Easy) (cpp)
来源:互联网 发布:网络诈骗手段及防范 编辑:程序博客网 时间:2024/06/11 20:43
Leetcode 121. Best Time to Buy and Sell Stock (Easy) (cpp)
Tag: Array, Dynamic Programming
Difficulty: Easy
/*121. Best Time to Buy and Sell Stock (Easy)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: 5max. 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: 0In this case, no transaction is done, i.e. max profit = 0.*/class Solution {public:int maxProfit(vector<int>& prices) {if (!prices.size()) { return 0; }int pro, low = prices[0];for (int i = 0; i < prices.size(); i++) {if (low > prices[i]) { low = prices[i]; } else { pro = max(prices[i] - low, pro); }}return pro;}};
0 0
- Leetcode 121. Best Time to Buy and Sell Stock (Easy) (cpp)
- 【Leetcode-Easy-121】Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock [easy] (Python)
- 121. Best Time to Buy and Sell Stock -Easy
- 121.LeetCode Best Time to Buy and Sell Stock(easy)[数组 动态规划]
- LeetCode-Easy部分中标签为Dynamic Programming 121. Best Time to Buy and Sell Stock
- Leetcode解题笔记121. Best Time to Buy and Sell Stock [Easy] 动态规划
- LeetCode 121. Best Time to Buy and Sell Stock
- [Leetcode] 121. Best Time to Buy and Sell Stock
- [leetcode] 121. Best Time to Buy and Sell Stock
- 【leetcode】121. Best Time to Buy and Sell Stock
- [leetcode] 121. Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock LeetCode
- [LeetCode]121. Best Time to Buy and Sell Stock
- Leetcode 121. Best Time to Buy and Sell Stock
- leetcode 121. Best Time to Buy and Sell Stock
- LeetCode 121. Best Time to Buy and Sell Stock
- LeetCode题解:121. Best Time to Buy and Sell Stock
- 复习(数据结构):链表:c语言
- 如何在施工物料管理Web系统中处理大量数据并显示
- 未闻花名ED《君がくれたもの》原文+罗马音+中文
- Android 学习笔记十三 通过绝对路径得到uri
- Linux目录结构及文件
- Leetcode 121. Best Time to Buy and Sell Stock (Easy) (cpp)
- Android Binder机制(三) ServiceManager守护进程
- 如何测试java中对象的等价性
- mac os下重置mysql密码
- Linux的oops内核调试信息 && Linux Kernel Panic报错解决思路
- Linux命令--dpkg
- PAT乙级练习题B1048. 数字加密
- Leetcode 66. Plus One (Easy) (cpp)
- Java 数组的详解