java实现不同数字或者字母排列组合，但是不能处理特别长的字符

最新推荐文章于 2024-08-21 15:17:10 发布

nxzcd1

最新推荐文章于 2024-08-21 15:17:10 发布

阅读量800

点赞数

分类专栏： java

本文链接：https://blog.csdn.net/nxzcd1/article/details/78917375

版权

java 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;

public class PermutationCombination {
    public static HashMap<String, String> dealHashMap(HashMap<String, String> rs) {
        HashMap<String, String> resultMap = new HashMap<>();
        if (rs == null || rs.isEmpty()) {
            return resultMap;
        }

        Iterator<Map.Entry<String, String>> it = rs.entrySet().iterator();
        while (it.hasNext()) {
            Map.Entry<String, String> entry = it.next();
            String message = entry.getValue();
            for (int index = 0; index < message.length(); index++) {
                String key = entry.getKey() + message.substring(index, index + 1);
                String value = message.substring(0, index) + message.substring(index + 1, message.length());
                resultMap.put(key, value);
            }
        }
        rs.clear();
        return resultMap;

    }

    public static void main(String[] args) {
        String message = "123456789";
        HashMap<String, String> rs = new HashMap<>();
        //输出数的排列组合
        for (int index = 0; index < message.length(); index++) {
            message.substring(index, index + 1);
            String mes = message.substring(0, index) + message.substring(index + 1, message.length());
            rs.put(message.substring(index, index + 1), mes);
        }
        int i = 0;
        while (i < message.length() - 1) {
            rs = dealHashMap(rs);
            i++;
        }
        for (Map.Entry<String, String> entry : rs.entrySet()) {
            System.out.println(entry.getKey());
        }
    }
}