剑指 Offer 38. 字符串的排列

剑指 Offer 38. 字符串的排列

class Solution {
    Set<String> set=new HashSet<>();
    public String[] permutation(String s) {
        StringBuilder sb=new StringBuilder();
        boolean[] used=new boolean[s.length()];
        backtracking(s,"",used);
        return set.toArray(new String[0]);
    }
    public void backtracking(String s,String str,boolean[] used){
        if(str.length()==s.length()){
            set.add(str);
            return;
        }
        for(int i=0;i<s.length();i++){
            if(used[i]==true){
                continue;
            }
            used[i]=true;
            backtracking(s,str+s.charAt(i),used);
            used[i]=false;
        }
    }
}