Leetcode #46 Permutations

最新推荐文章于 2021-02-02 11:47:10 发布

每天都要有进步

最新推荐文章于 2021-02-02 11:47:10 发布

阅读量230

点赞数

分类专栏：暑假备战UVa Leetcode

本文链接：https://blog.csdn.net/u011472124/article/details/46880877

版权

Leetcode 同时被 2 个专栏收录

262 篇文章 0 订阅

订阅专栏

暑假备战UVa

103 篇文章 0 订阅

订阅专栏

Given a collection of numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].

Difficulty: Medium

参考nextPermutations，秒解，偷懒都偷得这么理直气壮。

void nextPermutation(vector<int>& nums) {
        int len = nums.size();
        int i = len-1,j=len-1;
        int temp;
        if(len==1||len==0)
            return;
        if(len==2)
        {
           temp = nums[0];
           nums[0]=nums[1];
           nums[1]=temp;
           return;
        }
        while(i>=1)
        {
            if(nums[i]<=nums[i-1])
                i--;
            else
                break;
        }


        i--;
        if(i==-1)
        {
            sort(nums.begin(),nums.end());
            return;
        }
        while(j>=0)
        {
            if(nums[j]<=nums[i])
                j--;
            else
                break;

        }
        temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
        for(int k =i+1;k<=((len-1-i-1)/2+i+1);k++)
        {
            temp = nums[k];
            nums[k] = nums[len-1-(k-(i+1))];
            nums[len-1-(k-(i+1))] = temp;
        }
        return;
    }

vector<vector<int> > permute(vector<int>& nums) {
        vector<vector<int> > ans;
        int len = nums.size();
        int cou = 1;
        for(int i = 1;i<=len;i++)
            cou = cou * i;
        ans.push_back(nums);
        for(int i = 0;i<cou-1;i++)
        {
            nextPermutation(nums);
            ans.push_back(nums);
        }
        return ans;
    }