1299. Replace Elements with Greatest Element on Right Side

Given an array `arr`, replace every element in that array with the greatest element among the elements to its right, and replace the last element with `-1`.

After doing so, return the array.

Example 1:

``````Input: arr = [17,18,5,4,6,1]
Output: [18,6,6,6,1,-1]
Explanation:
- index 0 --> the greatest element to the right of index 0 is index 1 (18).
- index 1 --> the greatest element to the right of index 1 is index 4 (6).
- index 2 --> the greatest element to the right of index 2 is index 4 (6).
- index 3 --> the greatest element to the right of index 3 is index 4 (6).
- index 4 --> the greatest element to the right of index 4 is index 5 (1).
- index 5 --> there are no elements to the right of index 5, so we put -1.
``````

Example 2:

``````Input: arr = [400]
Output: [-1]
Explanation: There are no elements to the right of index 0.
``````

Constraints:

• `1 <= arr.length <= 104`
• `1 <= arr[i] <= 105`

``````class Solution {
public:
vector<int> replaceElements(vector<int>& arr) {
int n = arr.size(), curMax = INT_MIN;
vector<int> res(n, -1);
for (int i = n - 2; i >= 0; --i) {
curMax = max(curMax, arr[i + 1]);
res[i] = curMax;
}
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1299

Two Furthest Houses With Different Colors

https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/

https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/discuss/463249/JavaC%2B%2BPython-Straight-Forward

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation