【算法】笛卡尔积算法

private static void descartes(List<List<String>> dimvalue, List<List<String>> result, int layer, List<String> curList) {
        if (layer < dimvalue.size() - 1) {
            if (dimvalue.get(layer).size() == 0) {
                descartes(dimvalue, result, layer + 1, curList);
            } else {
                for (int i = 0; i < dimvalue.get(layer).size(); i++) {
                    List<String> list = new ArrayList<String>(curList);
                    list.add(dimvalue.get(layer).get(i));
                    descartes(dimvalue, result, layer + 1, list);
                }
            }
        } else if (layer == dimvalue.size() - 1) {
            if (dimvalue.get(layer).size() == 0) {
                result.add(curList);
            } else {
                for (int i = 0; i < dimvalue.get(layer).size(); i++) {
                    List<String> list = new ArrayList<String>(curList);
                    list.add(dimvalue.get(layer).get(i));
                    result.add(list);
                }
            }
        }
    }
public static void main(String[] args) {
            List<List<String>> list = new ArrayList<List<String>>();
            List<String> listSub1 = new ArrayList<String>();
            List<String> listSub2 = new ArrayList<String>();
            List<String> listSub3 = new ArrayList<String>();
            listSub1.add("1");
            listSub1.add("2");
 
            listSub2.add("3");
            listSub2.add("4");
 
            listSub3.add("a");
            listSub3.add("b");
 
            list.add(listSub1);
            list.add(listSub2);
            list.add(listSub3);
            List<List<String>> result = new ArrayList<List<String>>();
            descartes(list, result, 0, new ArrayList<String>());
            System.out.println(JSON.toJSONString(result));
 
    } 
运行结果:
[["1","3","a"],["1","3","b"],["1","4","a"],["1","4","b"],["2","3","a"],["2","3","b"],["2","4","a"],["2","4","b"]]
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值