关闭

#15 Permutations

标签: lintcoderecursion
56人阅读 评论(0) 收藏 举报
分类:

题目描述:

Given a list of numbers, return all possible permutations.

 Notice

You can assume that there is no duplicate numbers in the list.

Example

For nums = [1,2,3], the permutations are:

[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]
题目思路:

这题我用了传统的recursion,每个recursion都遍历一遍array,找到没被访问过的element填入一个临时vector中。

Mycode(AC = 22ms):

class Solution {
public:
    /**
     * @param nums: A list of integers.
     * @return: A list of permutations.
     */
    vector<vector<int> > permute(vector<int> nums) {
        // write your code here
        vector<vector<int>> ans;
        if (nums.size() == 0) return ans;
        
        vector<int> sofar;
        unordered_set<int> visited;
        permute(ans, sofar, nums, visited);
        return ans;
    }
    
    void permute(vector<vector<int>>& ans,
                 vector<int>& sofar,
                 vector<int>& nums,
                 unordered_set<int>& visited)
    {
        if (sofar.size() == nums.size()) {
            ans.push_back(sofar);
            return;
        }
        
        for (int i = 0; i < nums.size(); i++) {
            if (visited.find(nums[i]) == visited.end()) {
                sofar.push_back(nums[i]);
                visited.insert(nums[i]);
                
                permute(ans, sofar, nums, visited);
                
                sofar.pop_back();
                visited.erase(nums[i]);
            }
        }
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:11988次
    • 积分:2241
    • 等级:
    • 排名:第16791名
    • 原创:221篇
    • 转载:1篇
    • 译文:0篇
    • 评论:10条
    文章分类
    文章存档