[LeetCode] Permutation Sequence

最新推荐文章于 2024-09-16 06:54:08 发布

lyangpku

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量408

点赞数

分类专栏： LeetCode 面试题算法文章标签： Leetcode leetcode LeetCode 算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8553921

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

算法

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    void next(vector<int> &v, int n) {
        if (n < 2) return;
        
        int i = n - 2;
        for (; i >= 0 && v[i] >= v[i + 1]; i--);
        int j = n - 1;
        for (; j >= 0 && v[i] >= v[j]; j--);
        
        int tmp = v[i];
        v[i] = v[j];
        v[j] = tmp;
        
        i++;
        j = n - 1;
        
        while (i < j) {
            int tmp = v[i];
            v[i] = v[j];
            v[j] = tmp;
            i++;
            j--;
        }
    }
    
    string getPermutation(int n, int k) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> v(n);
        for (int i = 0; i < n; i++)
            v[i] = i + 1;
        
        for (int i = 1; i < k; i++)
            next(v, n);
        
        string ret = "";
        
        for (int i = 0; i < n; i++)
            ret += v[i] + '0';
        
        return ret;
    }
};

Small Case: 4ms

Large Case: 840ms

Time: O(k * n)

Space: O(n)