商品的排列顺序---全排列

题目描述

某店铺将用于组成套餐的商品记作字符串 goods，其中 goods[i] 表示对应商品。请返回该套餐内所含商品的 全部排列方式 。

返回结果 无顺序要求，但不能含有重复的元素。

示例 1:

输入：goods = "agew"
输出：["aegw","aewg","agew","agwe","aweg","awge","eagw","eawg","egaw","egwa","ewag","ewga","gaew","gawe","geaw","gewa","gwae","gwea","waeg","wage","weag","wega","wgae","wgea"]

提示：

• 1 <= goods.length <= 8

思路

 

代码

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

class Solution {//O(N*N!)   O(N)
public:
    vector<string> rec;
    vector<int> vis;

    void backtrack(const string& goods, int i, int n, string& perm) {
        if (i == n) {
            rec.push_back(perm);//一种排列加入答案中
            return;
        }
        for (int j = 0; j < n; j++) {
            if (vis[j] || (j > 0 && !vis[j - 1] && goods[j - 1] == goods[j])) {
                continue;//重复元素不选
            }
            vis[j] = true;//状态更新
            perm.push_back(goods[j]);
            backtrack(goods, i + 1, n, perm);//递归调用
            perm.pop_back();//回滚
            vis[j] = false;//回滚
        }
    }

    vector<string> goodsOrder(string goods) {
        int n = goods.size();
        vis.resize(n);
        sort(goods.begin(), goods.end());
        string perm;
        backtrack(goods, 0, n, perm);
        return rec;
    }
};

int main() {
    string input;
    getline(cin, input);

    Solution a;
    vector<string> res;
    res = a.goodsOrder(input);
    for (int i = 0; i < res.size(); i++) {
        cout << res[i] << endl;
    }
}

 

复杂度分析

时间复杂度：O(n×n!)，其中 n 为给定商品串的长度。这些商品的全部排列有 O(n!) 个，每个排列平均需要 O(n) 的时间来生成。

空间复杂度：O(n)。我们需要 O(n) 的栈空间进行回溯，注意返回值不计入空间复杂度。