【刷题】面试题08.07. 无重复字符串的排列组合

思路：标准的回溯模板

简易版递归回溯写法（性能不是很好）：

class Solution {
    List<String> list= new ArrayList<>();
    StringBuffer s=new StringBuffer();
    public String[] permutation(String S) {
        dfs(S,list,s);
        return list.toArray(new String[list.size()]);
    }

    public void dfs(String S,List<String> list,StringBuffer s) {
        if(s.length() == S.length()){
            list.add(new String(s));
            return;
        }
        for(int i=0;i<S.length();i++){
            String zz=new String(s);
            if(zz.contains(S.charAt(i)+"")){
                continue;
            }
            s.append(S.charAt(i));
            dfs(S,list,s);
            s.deleteCharAt(s.length()-1);
        }
    }
}

稍微好一点的写法：

class Solution {
    List<String> res = new ArrayList<>();
    public String[] permutation(String s) {
        boolean[] isVisited = new boolean[s.length()];
        trackback(s,isVisited,new StringBuffer());
        String[] strs = new String[res.size()];
        for(int i=0;i<res.size();i++){
            strs[i] = res.get(i);
        }
        return strs;
    }
    public void trackback(String s,boolean[] isVisited,StringBuffer stringbuffer){
        if(stringbuffer.length()==s.length()){
            res.add(stringbuffer.toString());
            return;
        }
        for(int i=0;i<s.length();i++){
            if(isVisited[i]==false){
                stringbuffer.append(s.charAt(i));
                isVisited[i]=true;
                trackback(s,isVisited,stringbuffer);
                stringbuffer.deleteCharAt(stringbuffer.length()-1);
                isVisited[i] = false;
            }
        }
    }
}