• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0501_0600.s0503_next_greater_element_ii.readme.md Maven / Gradle / Ivy

503\. Next Greater Element II

Medium

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; 

he 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