JS solution force deduction daily question (12) - 556 Next larger element III (2022-7-3)

subject

Give you a positive integer n , Please find the smallest integer that meets the conditions , It consists of rearranging n Each number present in the consists of , And its value is greater than n . If there is no such positive integer , Then return to -1 .

Be careful , The returned integer should be a 32 An integer , If there is an answer that satisfies the meaning of the question , But it's not 32 An integer , Also return to -1 .

Example 1

 Input ：n = 12
 Output ：21

My answer

var nextGreaterElement = function(n) {
    
    const nums = String(n).split('').map((num) => + num)
    let i = nums.length - 1
    let j = i

    const stack = []
    for (; i >= 0; i --) {
    
        if (stack.length && nums[i] < nums[stack[stack.length - 1]]) {
    
            while (stack.length && nums[i] < nums[stack[stack.length - 1]]) {
    
                j = stack.pop()
            }
            break
        }
        stack.push(i)
    }

    if (i < 0) {
    
        return -1
    }
    [nums[i], nums[j]] = [nums[j], nums[i]]
    const ans = +(nums.slice(0, i + 1).join('') + nums.slice(i + 1).sort((a, b) => a - b).join(''))
    return ans > 2147483647 ? -1 : ans
};