求解两个字符串的所有的可能组合

 最暴力解法

public List<String> letterCombinations(String s1,String s2,List<String> list) {
        for (int i = 0; i < s1.length(); i++) {
            for (int j = 0; j < s2.length(); j++) {
                list.add(Character.toString(s1.charAt(i))+Character.toString(s2.charAt(j)));
            }
        }
        return list;
    }

 

递归解法：

import java.util.ArrayList;
import java.util.List;
//求解两个字符串的所有的可能组合
class Solution {
    //暴力递归解法
    public List<String> letterCombinations(String s1,String s2,List<String> list) {
        if(s1==null||s2==null){
            return list;
        }
        String [] strarr = new String[]{s1,s2};
        generateletterCombinations(strarr,list,0,"");
        return list;
    }

    private List<String> generateletterCombinations(String arr[],List<String> list,int index,String s) {
        if(index==arr.length){//表示s的长度是数组的个数以后，结束递归，进行回溯（当s的长度等于2，结束递归）
            list.add(s);
            System.out.println("s="+s);
            return list;
        }
        String letter  = arr[index];
        for (int i = 0; i < letter.length(); i++) {
            //System.out.println("use["+i+"]"+" arr["+i+"]="+letter.charAt(i));
            generateletterCombinations(arr,list,index+1,s+letter.charAt(i));//递归调用一次，index+1
        }
        
        return list;
    }
public static void main(String[] args) {
    System.out.println(new Solution().letterCombinations("ab","ce",new ArrayList<>()));
}
}