leetcode problem 46. Permutations

最新推荐文章于 2020-03-29 17:21:57 发布

bald

最新推荐文章于 2020-03-29 17:21:57 发布

阅读量134

点赞数

分类专栏： c++ leetcode

本文链接：https://blog.csdn.net/Aries_M/article/details/89283954

版权

c++ 同时被 2 个专栏收录

22 篇文章 0 订阅

订阅专栏

leetcode

16 篇文章 0 订阅

订阅专栏

Description

Given a collection of distinct integers, return all possible permutations.

Example:

Input: [1,2,3]
Output:
[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

Solution

递归，仔细考虑当前情况

code:

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> res;
        vector<bool> record(nums.size(),false);
        vector<int> cur;
        per(res, record, cur, nums, nums.size(), 0);
        return res;
    }
    void per(vector<vector<int>>& res, vector<bool>& record, vector<int>& cur, vector<int>& nums, int n, int pos) {
        for(int i = 0; i < n ; ++i)
        {
            if(!record[i]) {
                record[i] = true;
                cur.push_back(nums[i]);
                if(pos == n-1) res.push_back(cur);
                else per(res, record, cur, nums, n, pos+1);
                cur.pop_back();
                record[i] = false;
            }
        }
    }
};

result:

Runtime: 12 ms, faster than 100.00% of C++ online submissions for Permutations.
Memory Usage: 9.1 MB, less than 98.71% of C++ online submissions for Permutations.

20190413 Sat

tbc