LeetCode 556. Next Greater Element III

最新推荐文章于 2022-01-30 21:29:27 发布

sqyx008

最新推荐文章于 2022-01-30 21:29:27 发布

阅读量773

点赞数

分类专栏： LeetCode 文章标签： leetcode string cpp element 组合数

本文链接：https://blog.csdn.net/sqyx008/article/details/69950428

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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

Analysis

此处要利用next_permutation函数，其函数原型为：

#include <algorithm>
bool next_permutation(iterator start,iterator end)

当前序列不存在下一个排列时，函数返回false，否则返回true。

Code

class Solution {
public:
    int nextGreaterElement(int n) {
        string s = to_string(n);
        next_permutation(begin(s),end(s));
        long result = stol(s);
        return (result > INT_MAX || result <= n)? -1 : result;
    }
};