LeetCode_1299_将每个元素替换位右侧最大元素

题目链接

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

解题思路

• 逆序遍历。
• 首先记录右边最大值max位最后一个值
• 然后逆序遍历更新max，注意使用tmp记住当前的arr[i]即可

AC代码

class Solution {
    public int[] replaceElements(int[] arr) {
        int max = -1;
        int len = arr.length;
        for (int i = len - 1; i >= 0; i--) {
            int tmp = arr[i];
            arr[i] = max;
            max = Math.max(tmp, max);
        }
        return arr;
    }
}

本地测试代码

package com.company;

import java.util.Arrays;

public class Solution_1299 {
    public static int[] replaceElements(int[] arr) {
        int max = -1;
        int len = arr.length;
        for (int i = len - 1; i >= 0; i--) {
            int tmp = arr[i];
            arr[i] = max;
            max = Math.max(tmp, max);
        }
        return arr;
    }

    public static void main(String[] args) {
        System.out.println(Arrays.toString(replaceElements(new int[]{17, 18, 5, 4, 6, 1})));
    }
}