1
class Solution {
2
public int[] replaceElements(int[] arr) {
3
int greatElement = -1;
4
for (int i = arr.length - 1; i >= 0; i--) {
5
int temp = arr[i];
6
arr[i] = greatElement;
7
greatElement = Math.max(temp, greatElement);
8
}
9
return arr;
10
}
11
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0