735. Replace With Greatest From Right【medium】

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. For example, if the array is [16, 17, 4, 3, 5, 2], then it should be modified to [17, 5, 5, 5, 2, -1].

Example

Give nums = [16, 17, 4, 3, 5, 2], change nums to [17, 5, 5, 5, 2, -1]
You should do it in place.

解法一：

 class Solution {
 public:
     /*
      * @param : An array of integers.
      * @return: nothing
      */
     void arrayReplaceWithGreatestFromRight(vector<int> &nums) {
         int size = nums.size();
         int max = nums[size - ];
         nums[size - ] = -;

         for (int i = size - ; i >= ; --i) {
             int temp = nums[i];
             nums[i] = max;
             max = max > temp ? max : temp;
         }
     }
 };

本题比较简单，就是从尾开始往前遍历处理。注意题目中的题意是某个元素右边所有元素中的最大值，而不涉及该元素和最大值之间再比较。