Best Time to Buy and Sell Stock LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxProfit(vector<int> &prices) {
4
    int lsf = INT_MAX;
5
    int op = 0;
6
    int pist = 0;
7

8
    for (int i = 0; i < prices.size(); i++) {
9
      if (prices[i] < lsf) {
10
        lsf = prices[i];
11
      }
12
      pist = prices[i] - lsf;
13
      if (op < pist) {
14
        op = pist;
15
      }
16
    }
17
    return op;
18
  }
19
};