MaxProfit

發表於 | 分類於 ，

problem

一次的股票交易最大可以獲得多少獲益

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    if(A.empty()) return 0;
    int mn = A[0], profit = 0;
    for(int a:A){
        mn = min(mn, a);
        profit = max(profit, a-mn);
    }
    return profit;
}


analysis

  • time complexity O(n)
  • space complexity O(1)