LeetCode --- 1299. Replace Elements with Greatest Element on Right Side

杨鑫newlfe

已于 2022-10-04 00:53:51 修改

阅读量367

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 算法 LeetCode 文章标签： leetcode 算法 Python 面试

于 2022-10-04 00:53:45 首次发布

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/127158309

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

该博客介绍了LeetCode上的第1299题，题目要求将数组中的每个元素替换为它右侧的最大元素，最后一个元素替换为数组的最大值。文章通过举例说明解题思路，并提供了Python实现的解题代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

了解本专栏