LintCode/C++/permutations.cpp at master · kamyu104/LintCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
// Time:  O(n * n!)
// Space: O(n)

class Solution {
public:
    /**
     * @param nums: A list of integers.
     * @return: A list of permutations.
     */
    vector<vector<int>> permute(vector<int> nums) {
        if (nums.empty()) {
            return {};
        }
        vector<vector<int>> result;
        vector<bool> used(nums.size(), false);
        vector<int> ans;

        sort(nums.begin(), nums.end());
        permuteHelper(nums, &used, &ans, &result);
        return result;
    }

    void permuteHelper(const vector<int> &A, vector<bool> *used,
                       vector<int> *ans, vector<vector<int>> *result) {
        if (ans->size() == A.size()) {
            result->emplace_back(*ans);
            return;
        }

        for (size_t i = 0; i < A.size(); ++i) {
            if ((*used)[i]) {
                continue;
            }
            (*used)[i] = true;
            ans->emplace_back(A[i]);
            permuteHelper(A, used, ans, result);
            ans->pop_back();
            (*used)[i] = false;
        }
    }
};

// Time:  O(n * n!)
// Space: O(n)
// STL solution.
class Solution2 {
public:
    /**
     * @param nums: A list of integers.
     * @return: A list of permutations.
     */
    vector<vector<int>> permute(vector<int> nums) {
        if (nums.empty()) {
            return {};
        }
        vector<vector<int>> result;
        sort(nums.begin(), nums.end());
        do {
            result.emplace_back(nums);
        } while (next_permutation(nums.begin(), nums.end()));
        return result;
    }
};