作者：欣欣2602916441 | 来源：互联网 | 2023-09-15 01:48
computermaximizationofprofitoverasequenceofnumbers.1.BestTimetoBuyandSellStockISayyouhav
computer maximization of profit over a sequence of numbers.
1. Best Time to Buy and Sell Stock I
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.
Solution: For each element, calculate the max difference with the former
elements.
1 class Solution {
2 public:
3 int maxProfit(vector<int> &prices) {
4 int imin = 0;
5 int res = 0;
6 for (int i = 1; i i)
7 {
8 if (prices[i] < prices[imin])
9 imin = i;
10 res = max(res, prices[i] - prices[imin]);
11 }
12 return res;
13 }
14 };
Leetcode个人总结4 Best Time to Buy and Sell Stock(3),布布扣,bubuko.com
京公网安备 11010802041100号