leetcode

0 class Solution {

1 public:

2 int minNumberOperations(const vector<int> &target) const {

3 int res = target[0];

4

5 for (int i = 1; i < size(target); i++) {

6 res += max(target[i] - target[i - 1], 0);

7 }

8

9 return res;

10 }

11 };