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.
주어진 배열의 i번째 요소를 그 요소의 오른쪽에서 가장 큰 수로 바꾸고 마지막 요소는 -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 5 (1).
- index 5 --> there are no elements to the right of index 5, so we put -1.
Input: arr = [400]
Output: [-1]
Explanation: There are no elements to the right of index 0.
max
에 저장한다.max
로 바꿔준다.class Solution {
public int[] replaceElements(int[] arr) {
for(int i = 0; i < arr.length; i++){
if(i==arr.length-1){
arr[arr.length-1] = -1;
break;
}
int max=arr[i+1];
for (int j = i+1; j < arr.length-1; j++){
if(arr[j]<arr[j+1]){
max=Math.max(max,arr[j+1]);
}
}
arr[i]=max;
}
return arr;
}
}