class Solution {
public:
vector<int> replaceElements(vector<int>& arr) {
if(arr.size() == 1)
{
return {-1};
}
vector<int> res(arr.size());
res[arr.size() - 1] = -1;
for(int i = arr.size() - 2; i >= 0; i--)
{
res[i] = max(res[i + 1], arr[i + 1]);
}
return res;
}
};
leetcode 1299. 将每个元素替换为右侧最大元素
最新推荐文章于 2021-03-01 13:23:33 发布