LeetCode每日一题(Next Greater Element II)

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.

The next greater number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn’t exist, return -1 for this number.

Example 1:

Input: nums = [1,2,1]
Output: [2,-1,2]

Explanation:
The first 1’s next greater number is 2;
The number 2 can’t find next greater number.
The second 1’s next greater number needs to search circularly, which is also 2.

Example 2:

Input: nums = [1,2,3,4,3]
Output: [2,3,4,-1,4]

Constraints:

• 1 <= nums.length <= 104
• -109 <= nums[i] <= 109

---

用一个 stack 保存当前所有没找到 greater 的 num 的 index， 正向遍历 nums， 然后不断的检查 stack 的最后一个元素的值是不是小于当前值， 如果小于则 pop 出来，然后继续检查下一个， 如果不小于则停止检查。检查完成后将当前的 index 推到 stack 中。之所以这样可行是因为 stack 中保存的一定是单向递减的元素，因为但凡有一个上升的，一定会抵消掉 stack 里面小于当前元素的所有元素。

---

代码实现(Rust):

impl Solution {
    pub fn next_greater_elements(mut nums: Vec<i32>) -> Vec<i32> {
        let ori_len = nums.len();
        nums.append(&mut nums.clone());
        let mut stack: Vec<usize> = Vec::new();
        for i in 0..nums.len() {
            while !stack.is_empty() {
                let prev = stack.pop().unwrap();
                if nums[prev] < nums[i] {
                    nums[prev] = nums[i];
                } else {
                    stack.push(prev);
                    break;
                }
            }
            stack.push(i);
        }
        for i in stack {
            nums[i] = -1;
        }
        nums[..ori_len].to_vec()
    }
}