Leetcode-38 字符串的排列

题目描述

输入一个字符串，打印出该字符串中字符的所有排列。

你可以以任意顺序返回这个字符串数组，但里面不能有重复元素。

示例:

输入：s = "abc"
输出：["abc","acb","bac","bca","cab","cba"]

限制：

1 <= s 的长度 <= 8

class Solution {
    List<String> result;
    List<Character> list;
    boolean[] flag;
    String str;
    public String[] permutation(String s) {
        if(s==null||s.length()==0)
            return null;
        list=new ArrayList<Character>(); 
        for(int i=0;i<s.length();i++)
        {
            list.add(s.charAt(i));
        }
        //排序
        Com c=new Com();
        Collections.sort(list,c);
        result=new ArrayList<String>();
        flag=new boolean[list.size()];
        str=new String();
        digui(0);
        String[] re=new String[result.size()];
        for(int i=0;i<result.size();i++)
            re[i]=result.get(i);
        return re;
    }

    public void digui(int level)
    {
        if(level==list.size())
        {
            result.add(new String(str));
            return;
        }
        for(int i=0;i<list.size();i++)
        {
            if(flag[i]==false)
            {
                if(i>0)
                {
                    if((list.get(i)==list.get(i-1)&&flag[i-1]==true)||list.get(i)!=list.get(i-1))
                    {
                        str=str+list.get(i);
                        flag[i]=true;
                        digui(level+1);
                        flag[i]=false;
                        str=str.substring(0,str.length()-1);
                    }
                }
                else
                {
                    str=str+list.get(i);
                    flag[i]=true;
                    digui(level+1);
                    flag[i]=false;
                    str=str.substring(0,str.length()-1);
                }
                
            }
        }
    }
}

class Com implements Comparator
{
    public int compare(Object a,Object b)
    {
        Character ch1=(Character) a;
        Character ch2=(Character) b;
        return ch1-ch2;
    }
}