LeetCode 503 Next Greater Element II (数组)

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Tc_To_Top/article/details/90243158

Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. 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, output -1 for this number.

Example 1:

Input: [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.

Note: The length of given array won't exceed 10000.

题目链接:https://leetcode.com/problems/next-greater-element-ii/

题目分析:把数组在后面复制一份,设g[i]表示i之后比位置i大的数的下标,从后往前处理,类似倍增思想

3ms,时间击败99.57%

class Solution {
    public int[] nextGreaterElements(int[] nums) {
        int n = nums.length;
        int[] a = new int[n << 1];
        int[] g = new int[n << 1];
        for (int i = 0; i < n; i++) {
            a[i] = nums[i];
            a[i + n] = nums[i];
            g[i] = -1;
            g[i + n] = -1;
        }
        int pos = (n << 1) - 2;
        while (pos >= 0) {
            int nxt = pos + 1;
            while (nxt != -1 && a[pos] >= a[nxt]) {
                nxt = g[nxt];
            }
            g[pos] = nxt;
            pos--;
        }
        int[] ans = new int[n];
        for (int i = 0; i < n; i++) {
            ans[i] = g[i] == -1 ? -1 : a[g[i]];
        }
        return ans;
    }
}

 

展开阅读全文

没有更多推荐了,返回首页