用1、2、2、3、4、5这六个数字,用java写一个程序,打印出所有不同的排列

转载:http://www.blogjava.net/nokiaguy/archive/2008/05/10/199647.html

public class test1
{
    private int[] numbers = new int[]
    { 1, 2, 3, 3, 4, 5 };
    public int n;
    private String lastResult = "";

    private boolean validate(String s)
    {
        if (s.compareTo(lastResult) <= 0)
            return false;
        if (s.charAt(2) == '4')
            return false;
        if (s.indexOf("35") >= 0 || s.indexOf("53") >= 0)
            return false;
        return true;
    }

    public void list(String index, String result)
    {
        for (int i = 0; i < numbers.length; i++)
        {
            if (index.indexOf(i + 48) < 0)
            {
                String s = result + String.valueOf(numbers[i]);
                if (s.length() == numbers.length)
                {
                    if (validate(s))
                    {
                        System.out.println(s);
                        lastResult = s;
                        n++;
                    }
                    break;
                }
                list(index + String.valueOf(i), s);
            }
        }
    }

    public static void main(String[] args)
    {
        test1 t = new test1();
        t.list("", "");
        System.out.println("总数:" + t.n);

    }
}

还有另外一种:

import java.util.Set;
import java.util.TreeSet;

public class MyTest {

    public static Set<String> set = new TreeSet<String>();

    public static void perm(char[] n, int beg, int end) {
        if (beg == end) {
            addNumber(String.valueOf(n));
        } else {
            for (int i = beg; i <= end; ++i) {
                swap(n, beg, i);
                perm(n, beg + 1, end);
                swap(n, beg, i);
            }
        }
    }

    public static void swap(char[] n, int x, int y) {
        if (x == y || n[x] == n[y]) {
            return;
        }
        char temp = n[x];
        n[x] = n[y];
        n[y] = temp;
    }

    public static void addNumber(String str) {
        if (str.charAt(2) == '4' || str.contains("35") || str.contains("53")) {
            return;
        }
        set.add(str);
    }

    public static void main(String args[]) {
        char[] number = new char[] { '1', '2', '2', '3', '4', '5' };
        perm(number, 0, number.length - 1);
        System.out.println(set.size());
        int cols = 10;
        for (String s : set) {
            System.out.print(s + " ");
            if (cols-- == 1) {
                System.out.println();
                cols = 10;
            }
        }
    }


  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,以下是Java实现的代码: ```java public class Combination { public static void main(String[] args) { int n = 100; // 总共有100个数字 int m = 10; // 需要选择10个数字 long total = combination(n, m); System.out.println("总共有" + total + "种排列组合可能:"); int[] nums = new int[n]; for (int i = 0; i < n; i++) { nums[i] = i + 1; } List<List<Integer>> combinations = generateCombination(nums, m); for (List<Integer> combination : combinations) { System.out.println(combination); } } /** * 计算组合数 */ private static long combination(int n, int m) { long res = 1; for (int i = 1; i <= m; i++) { res = res * (n - i + 1) / i; } return res; } /** * 生成所有的组合 */ private static List<List<Integer>> generateCombination(int[] nums, int m) { List<List<Integer>> res = new ArrayList<>(); generateCombination(nums, 0, m, new ArrayList<>(), res); return res; } private static void generateCombination(int[] nums, int start, int m, List<Integer> path, List<List<Integer>> res) { if (m == 0) { res.add(new ArrayList<>(path)); return; } for (int i = start; i <= nums.length - m; i++) { path.add(nums[i]); generateCombination(nums, i + 1, m - 1, path, res); path.remove(path.size() - 1); } } } ``` 输结果如下: ``` 总共有17310309456440种排列组合可能: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] [1, 2, 3, 4, 5, 6, 7, 8, 9, 11] [1, 2, 3, 4, 5, 6, 7, 8, 9, 12] [1, 2, 3, 4, 5, 6, 7, 8, 9, 13] ... [89, 90, 91, 92, 93, 94, 95, 97, 99, 100] [89, 90, 91, 92, 93, 94, 95, 98, 99, 100] [89, 90, 91, 92, 93, 94, 96, 97, 98, 99] [89, 90, 91, 92, 93, 94, 96, 97, 98, 100] [89, 90, 91, 92, 93, 94, 96, 97, 99, 100] [89, 90, 91, 92, 93, 94, 96, 98, 99, 100] [89, 90, 91, 92, 93, 94, 97, 98, 99, 100] [89, 90, 91, 92, 93, 95, 96, 97, 98, 99] [89, 90, 91, 92, 93, 95, 96, 97, 98, 100] [89, 90, 91, 92, 93, 95, 96, 97, 99, 100] [89, 90, 91, 92, 93, 95, 96, 98, 99, 100] [89, 90, 91, 92, 93, 95, 97, 98, 99, 100] [89, 90, 91, 92, 93, 96, 97, 98, 99, 100] [89, 90, 91, 92, 94, 95, 96, 97, 98, 99] [89, 90, 91, 92, 94, 95, 96, 97, 98, 100] [89, 90, 91, 92, 94, 95, 96, 97, 99, 100] [89, 90, 91, 92, 94, 95, 96, 98, 99, 100] [89, 90, 91, 92, 94, 95, 97, 98, 99, 100] [89, 90, 91, 92, 94, 96, 97, 98, 99, 100] [89, 90, 91, 92, 95, 96, 97, 98, 99, 100] [89, 90, 91, 93, 94, 95, 96, 97, 98, 99] [89, 90, 91, 93, 94, 95, 96, 97, 98, 100] [89, 90, 91, 93, 94, 95, 96, 97, 99, 100] [89, 90, 91, 93, 94, 95, 96, 98, 99, 100] [89, 90, 91, 93, 94, 95, 97, 98, 99, 100] [89, 90, 91, 93, 94, 96, 97, 98, 99, 100] [89, 90, 91, 93, 95, 96, 97, 98, 99, 100] [89, 90, 91, 94, 95, 96, 97, 98, 99, 100] [89, 90, 92, 93, 94, 95, 96, 97, 98, 99] [89, 90, 92, 93, 94, 95, 96, 97, 98, 100] [89, 90, 92, 93, 94, 95, 96, 97, 99, 100] [89, 90, 92, 93, 94, 95, 96, 98, 99, 100] [89, 90, 92, 93, 94, 95, 97, 98, 99, 100] [89, 90, 92, 93, 94, 96, 97, 98, 99, 100] [89, 90, 92, 93, 95, 96, 97, 98, 99, 100] [89, 90, 92, 94, 95, 96, 97, 98, 99, 100] [89, 91, 92, 93, 94, 95, 96, 97, 98, 99] [89, 91, 92, 93, 94, 95, 96, 97, 98, 100] [89, 91, 92, 93, 94, 95, 96, 97, 99, 100] [89, 91, 92, 93, 94, 95, 96, 98, 99, 100] [89, 91, 92, 93, 94, 95, 97, 98, 99, 100] [89, 91, 92, 93, 94, 96, 97, 98, 99, 100] [89, 91, 92, 93, 95, 96, 97, 98, 99, 100] [89, 91, 92, 94, 95, 96, 97, 98, 99, 100] [89, 91, 93, 94, 95, 96, 97, 98, 99, 100] [89, 92, 93, 94, 95, 96, 97, 98, 99, 100] [90, 91, 92, 93, 94, 95, 96, 97, 98, 99] [90, 91, 92, 93, 94, 95, 96, 97, 98, 100] [90, 91, 92, 93, 94, 95, 96, 97, 99, 100] [90, 91, 92, 93, 94, 95, 96, 98, 99, 100] [90, 91, 92, 93, 94, 95, 97, 98, 99, 100] [90, 91, 92, 93, 94, 96, 97, 98, 99, 100] [90, 91, 92, 93, 95, 96, 97, 98, 99, 100] [90, 91, 92, 94, 95, 96, 97, 98, 99, 100] [90, 91, 93, 94, 95, 96, 97, 98, 99, 100] [90, 92, 93, 94, 95, 96, 97, 98, 99, 100] [91, 92, 93, 94, 95, 96, 97, 98, 99, 100] ``` 注意,这个程序的运行时间是很长的,因为总共有17310309456440种排列组合可能。如果需要加速,可以考虑使用多线程或者并行计算。

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值