剑指OFFER----面试题38. 字符串的排列

class Solution {
public:
    vector<string> permutation(string s) {
        vector<string> res;
        sort(s.begin(), s.end());
        dfs(s, 0, s.size(), res);
        return res;
    }

    void dfs(string s, int l, int r, vector<string>& res) {
        if (l == r) res.push_back(s);
        else {
            for (int i = l; i < r; ++i) {
                if (i > l && s[i] == s[l]) continue;
                swap(s[i], s[l]);
                dfs(s, l + 1, r, res);
            }
        }
    }
};