556. Next Greater Element III

Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive 32-bit integer exists, you need to return -1.

Example 1:

Input: 12
Output: 21

Example 2:

Input: 21
Output: -1

Subscribe to see which companies asked this question.

public class Solution {
    public int nextGreaterElement(int n) {
        int[] data = new int[10];
		Integer cur = null;
		while (n != 0) {
			int i = n % 10;
			n /= 10;
			data[i]++;
			if (n != 0 && n % 10 < i) {
				cur = n % 10;
				n /= 10;
				break;
			}
		}
		if (cur == null)
			return -1;
		for (int i = cur + 1; i < 10; ++i) {
			if (data[i] != 0) {
			    data[i]--;
				data[cur]++;
				cur = i;
				break;
			}
		}
		long re = cur;
		long head = n * 10;
		while (data[0]-- > 0) {
			re *= 10;
			head *= 10;
		}
		for (int i = 1; i < 10; ++i) {
			while (data[i]-- > 0) {
				re = re * 10 + i;
				head *= 10;
			}
		}
		re += head;
		return re > Integer.MAX_VALUE ? -1 : (int) re;
    }
}

class Solution(object):
    def nextGreaterElement(self, n):
        """
        :type n: int
        :rtype: int
        """
        data = [0 for x in range(10)]
        cur = None
        while n != 0:
            i = n % 10
            n /= 10
            data[i] += 1
            if (n != 0 and n % 10 < i):
                cur = n % 10
                n /= 10
                break

        if cur==None:
            return -1

        for i in range(cur + 1, 10):
            if data[i] != 0:
                data[i] -= 1
                data[cur] += 1
                cur = i
                break

        re = cur
        head = n * 10

        while data[0] > 0:
            data[0] -= 1
            re *= 10
            head *= 10

        for i in range(1, 10):
            while data[i] > 0:
                data[i] -= 1
                re = re * 10 + i
                head *= 10

        re += head

        return re if re <= 2 ** 31 - 1 else -1