leet code

3259 - Replace Elements with Greatest Element on Right Side

C++ time(beats 87.79%), space(beats 22.06%)

class Solution {
public:
    vector<int> replaceElements(vector<int>& arr) {
        int arrSize = arr.size();
        int max = 0;
        int tmp = 0;
        for(int i=arrSize-1; i>=0; --i)
        {
            if(i == arrSize-1)
            {
                max = arr[i];
                arr[i] = -1;
            }else
            {
                if(arr[i] <= max)
                {
                    arr[i] = max;
                }else
                {
                    tmp = arr[i];
                    arr[i] = max;
                    max = tmp;
                }
            }
        }
        return arr;
    }
};