剑指offer （27）

题目 ： 输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba。

思路 ：

1、java版本

import java.util.ArrayList;
import java.util.Collections;
public class Solution {
	public static void main(String[] args) {
		Solution solution = new Solution();
		System.out.println(solution.permution("abc"));
	}
	public ArrayList<String> permution(String string){
		ArrayList<String> res = new ArrayList<>();
		if (string != null && string.length() > 0) {
			permutationHelper(string.toCharArray(), 0, res);
			Collections.sort(res);
		}
		return res;
	}
	public void permutationHelper(char [] cs ,int i , ArrayList<String> list) {
		if (i == cs.length - 1) {
			String val = String.valueOf(cs);
			if (!list.contains(val)) {
				list.add(val);
			}
		}
		else {
			for (int j = i; j < cs.length; j++) {
				swap(cs, i, j);
				permutationHelper(cs, i+1, list);
				swap(cs, i, j);
			}
		}
	}
	public void swap(char [] cs,int i, int j) {
		char temp = cs[i];
		cs[i] = cs[j];
		cs[j] = temp;
	}
}

2、C++版本

//
// Created by stephen on 2021/3/11.
//运用递归解决此问题
//
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

class Solution {
public:
    vector<string> Permutation(string str) {
        vector<string> res;
        if (str.empty())
            return res;
        Permutation(str, res, 0);
        sort(res.begin(), res.end());
        return res;
    }

    void Permutation(string str, vector<string> &res, int begin) {
        if (begin == str.size() - 1)
            res.push_back(str);
        else {
            for (int i = begin; i < str.size(); ++i) {
                if (i != begin && str[i] == str[begin])
                    continue;

                swap(str[i], str[begin]);
                Permutation(str, res, begin + 1);

            }
        }

    }
};