mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 01:15:57 +08:00
26 lines
1.2 KiB
Markdown
26 lines
1.2 KiB
Markdown
# [503. Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/)
|
||
|
||
## 题目
|
||
|
||
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:
|
||
|
||
```c
|
||
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.
|
||
|
||
## 题目大意
|
||
|
||
题目给出数组 A，针对 A 中的每个数组中的元素，要求在 A 数组中找出比该元素大的数，A 是一个循环数组。如果找到了就输出这个值，如果找不到就输出 -1。
|
||
|
||
|
||
## 解题思路
|
||
|
||
这题是第 496 题的加强版，在第 496 题的基础上增加了循环数组的条件。这一题可以依旧按照第 496 题的做法继续模拟。更好的做法是用单调栈，栈中记录单调递增的下标。 |