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

replaceElements.go

func max(x, y int) int {
    if x > y {
        return x
    }
    return y
}

func replaceElements(arr []int) []int {
    res := make([]int, len(arr))
    res[len(res)-1] = -1
    if len(res) >= 2 {
        res[len(res)-2] = arr[len(arr)-1]
    }
    for i := len(res) - 3; i >= 0; i-- {
        res[i] = max(arr[i+1], res[i+1])
    }
    return res
}