组合算法简单实现

执于代码

于 2024-01-04 07:54:15 发布

阅读量404

点赞数 6

文章标签：算法 java 开发语言

本文链接：https://blog.csdn.net/xiamaocheng/article/details/135377058

版权

组合算法

目录
参考资料和推荐阅读

Survive by day and develop by night.
talk for import biz , show your perfect code,full busy，skip hardness,make a better result,wait for change,challenge Survive.
happy for hardess to solve denpendies.

public class demo {

    public static void combination(String[] s) {
        if (s.length == 0) {
            return;
        }
        int len = s.length;
        int n = 1 << len;
        // 从1循环到2^len-1
        for (int i = 1; i < n; i++) {
            StringBuffer sb = new StringBuffer();
            // 查看第一层循环里面的任意一种取值当中的哪一位是1[比如ab,011]， 如果是1，对应的字符就存在，打印当前组合。
            String sum = "";
            for (int j = 0; j < len; j++) {
                if ((i & (1 << j)) != 0) { // 对应位上为1，则输出对应的字符
                    String a = s[j];
                    sum = sum + a+",";
                    sb.append(s[j]);
                }
            }
            System.out.println("组合：" + sb + " ，sum:" + sum.substring(0, sum.length() - 1));
        }
    }


    public static void main(String[] args) {
        String[] a={"a","b","c","d"};
        combination(a);
    }
}