LEETCODE 60. Permutation Sequence

题目大意

解题思路

直接在http://blog.csdn.net/chenyaxue/article/details/71330633 next permutation的基础上改就好了。

代码

class Solution {
public:
    string getPermutation(int n, int k) {
        vector<int> numVec;
        for (int i = 1; i <= n; i++) {
            numVec.push_back(i);
        }
        for (int i = 1; i < k; i++) {
            nextPermutation(numVec);
        }
        string resStr = "";
        for (int i = 0; i < n; i++) {
            resStr += '0' + numVec[i];
        }
        return resStr;
    }
private:
    void nextPermutation(vector<int>& nums) {
        int stopInd = -1, temp = 0, nextInd = int(nums.size()) - 1;
        for (int i = int(nums.size()) - 1; i > 0; i--) {
            if (nums[i - 1] < nums[i]) {
                stopInd = i - 1;
                break;
            }
        }
        if (stopInd >= 0) {
            for (int i = int(nums.size()) - 1; i > stopInd; i--) {
                if (nums[i] <= nums[stopInd]) {
                    nextInd--;
                    continue;
                }
            }
            temp = nums[stopInd];
            nums[stopInd] = nums[nextInd];
            nums[nextInd] = temp;
        }
        sort(nums.begin() + stopInd + 1, nums.end());
    }
};