思路:就是双循环寻找下一个最大值,不过运行效率极低
class Solution {
public int[] nextGreaterElements(int[] nums) {
int n = nums.length;
int []next = new int[n];
Arrays.fill(next,-1);
for(int i = 0 ; i < n; i++)
{
for(int j = 1; j < n; j++)
{
if(nums[(j + i)%n] > nums[i])
{
next[i] =nums[(j + i)%n];
break;
}
}
}
return next;
}
}