Next Greater Element II

https://www.lintcode.com/problem/next-greater-element-ii/description

public class Solution {
    /**
     * @param nums: an array
     * @return: the Next Greater Number for every element
     */
    public int[] nextGreaterElements(int[] nums) {
        // Write your code here
        int[] res = new int[nums.length];
        test:
        for (int i = 0; i < nums.length; i++) {
            int num = nums[i];
            int index = i + 1;
            while (true) {
                index %= nums.length;
                if (index == i) {
                    res[i] = -1;
                    break;
                } else if (nums[index] > num) {
                    res[i] = nums[index];
                    break;
                }
                index++;
            }
        }
        return res;
    }
}