LeetCode #1299: Replace Elements with Greatest Element on Right Side
β’ 38 words β’ 1 min β’ updated
LeetCode #1299: Replace Elements with Greatest Element on Right Side:
python
class Solution:
def replaceElements(self, arr: List[int]) -> List[int]:
prev_max = -1
for i in range(len(arr) - 1, -1, -1):
arr[i], prev_max = prev_max, max(prev_max, arr[i])
return arr