Leetcode-全排列

class Solution {
    List> lists=new ArrayList<>();
    public List> permute(int[] nums) {
        List list=new ArrayList<>();
        bfs(nums,list);
        return lists;
    }
    void bfs(int[] num,List list)
    {
        //判断条件
        if(list.size()==num.length)
        {
            //添加路径
            lists.add(new ArrayList<>(list));
            //返回
            return;
        }
        
       for(int i:num)
       {
            //选择路径
           if(!list.contains(i))
           {

               list.add(i);

               bfs(num,list);
                //撤销路径
               list.remove(list.size()-1);
           }
       }
    }
}