Replace every element with the next greatest | GeeksforGeeks
Given an array of integers, replace every element with the next greatest element (greatest element on the right side) in the array. Since there is no element next to the last element, replace it with -1.
The idea is to start from the rightmost element, move to the left side one by one, and keep track of the maximum element. Replace every element with the maximum element.
Related: Next Greater Element
Read full article from Replace every element with the next greatest | GeeksforGeeks
Given an array of integers, replace every element with the next greatest element (greatest element on the right side) in the array. Since there is no element next to the last element, replace it with -1.
The idea is to start from the rightmost element, move to the left side one by one, and keep track of the maximum element. Replace every element with the maximum element.
void nextGreatest(int arr[], int size){ // Initialize the next greatest element int max_from_right = arr[size-1]; // The next greatest element for the rightmost element // is always -1 arr[size-1] = -1; // Replace all other elements with the next greatest for(int i = size-2; i >= 0; i--) { // Store the current element (needed later for updating // the next greatest element) int temp = arr[i]; // Replace current element with the next greatest arr[i] = max_from_right; // Update the greatest element, if needed if(max_from_right < temp) max_from_right = temp; }}Related: Next Greater Element
Read full article from Replace every element with the next greatest | GeeksforGeeks
