Maximum Difference Between Increasing Elements LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maximumDifference(vector<int> &nums) {
4
    int mn = nums[0], res = 0;
5
    for (int i = 1; i < nums.size(); i++) {
6
      res = max(res, nums[i] - mn);
7
      mn = min(mn, nums[i]);
8
    }
9
    return res == 0 ? -1 : res;
10
  }
11
};