码迷,mamicode.com
首页 > 其他好文 > 详细

Permutations

时间:2014-12-22 19:20:39      阅读:100      评论:0      收藏: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], [3,2,1].

回溯,代码:

vector<vector<int> >& permute(vector<int> vecInt)
{
    vector<int> vecWorker;
    vector<vector<int> > vecPermu;
    helper(vecPermu, vecWorker, vecInt);

    return vecPermu;
}

void helper(vector<vector<int> >& vecPermu, vector<int>& vecWorker, const vector<int>& vecInt)
{
    if (vecWorker.size() == vecInt.size())
    {
        vecPermu.push_back(vecWorker);
        return;
    }

    for (int i = 0; i < vecInt.size(); i++)
    {
        if (find(vecWorker.begin(), vecWorker.end(), vecInt[i]) != vecWorker.end())
            continue;

        vecWorker.push_back(vecInt[i];
        helper(vecPermu, vecWorker, vecInt);
        vecWorker.pop_back(vecInt[i]);
    }
}

 

Permutations

标签:

原文地址:http://www.cnblogs.com/litao-tech/p/4178752.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!