leetcode

0 class Solution {

1 public:

2 vector<int> replaceElements(vector<int> &arr) {

3 int maxi = -1;

4 for (int i = arr.size() - 1; i >= 0; i--) {

5 int tmp = arr[i];

6 arr[i] = maxi;

7 maxi = max(maxi, tmp);

8 }

9 return arr;

10 }

11 };