LeetCode OJ:Permutations

最新推荐文章于 2016-04-01 06:00:38 发布

_王川

最新推荐文章于 2016-04-01 06:00:38 发布

阅读量898

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/starcuan/article/details/18863347

版权

LeetCode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

Permutations

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].

递归：

class Solution {
    vector<vector<int>> result;
public:
    void dfs(int k,int n,vector<int> &num){
        if(k>n){
            result.push_back(num);
            return;
        }
        for(int i=k;i<=n;i++){
            swap(num[k],num[i]);
            dfs(k+1,n,num);
            swap(num[k],num[i]);
        }
    }
    vector<vector<int> > permute(vector<int> &num) {
        dfs(0,num.size()-1,num);
        return result;
    }
};

使用next_permutation方法

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        vector<vector<int>> result;
        sort(num.begin(),num.end());
        
        do{
            result.push_back(num);
        }while(next_permutation(num.begin(),num.end()));
        
        return result;
    }
};

重新实现next_permutation

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        vector<vector<int>> result;
        sort(num.begin(),num.end());
        
        do{
            result.push_back(num);
        }while(next_permutation(num.begin(),num.end()));
        
        return result;
    }
private:
    template<typename BidirIt>  
    bool next_permutation(BidirIt first, BidirIt last)  
    {  
        const auto rfirst = reverse_iterator<BidirIt>(last);  
        const auto rlast = reverse_iterator<BidirIt>(first);  
          
        auto pivot = next(rfirst);  
          
        while(pivot != rlast && *pivot >= *prev(pivot))//step1  
            ++pivot;  
          
        if(pivot == rlast){  
            reverse(rfirst,rlast);  
            return false;  
        }  
          
        auto change = find_if(rfirst,pivot,bind2nd(greater<int>(),*pivot));//step2  
          
        swap(*change,*pivot);//step3  
        reverse(rfirst,pivot);//step4  
          
        return true;  
    }  
};