.设计一个敏感词过滤程序

1.设计一个敏感词过滤程序
    WordFilter类
        属性：数组类型[]存放敏感词

        设计一个方法，调用这个方法（传参，可能会包含敏感词的字符串），返回过滤后的新的字符串
        public static String filter(String word){
            //过滤代码
            return word;
        }

        要求：可以添加多个要过滤的敏感词{"枪","死","打劫","共产党"}
        如果是一个字符就替换一个*，如果两个字符就替换**,以此类推

package com.yang.dom1.Dmone1;


import java.util.Scanner;

public class ad {
    public static class Mgan {

        private String[] str={"枪","死","打劫","共产党"};
        public static void main(String[] args) {
            Mgan mgan = new Mgan();
            mgan.test();
        }
        public void test(){
            System.out.println("请输入第一个字符串：");
            Scanner sc= new Scanner(System.in);
            String s=sc.next();
            for (String word:str) {
                if (word.contains(word)){
                    int len=word.length();
                    String th="*";
                    for (int j = 0; j < len-1; j++) {
                        th+="*";
                    }
                    s=s.replace(word, th);
                }
            }
            System.out.println(s);
        }

    }
}

2.国庆倒计时
    创建一个国庆节2022年10月1日的日期对象gdDate
 

package com.yang.dom1.Dmone1;

import java.text.SimpleDateFormat;
import java.util.Calendar;
import java.util.Date;

public class er {
    public static void main(String[] args) {


        Date gdDate =new Date();
        long i= gdDate.getTime();
        System.out.println("i = " + i);
        Calendar ca=Calendar.getInstance();
        ca.set(2022,10,1);
        System.out.println("ca = " + ca.getTimeInMillis());
        long l=ca.getTimeInMillis()-i;
        System.out.println("l = " + l);
        formatTime(l);
    }
    public static String formatTime(Long ms) {
        Integer ss = 1000;
        Integer mi = ss * 60;
        Integer hh = mi * 60;
        Integer dd = hh * 24;

        Long day = ms / dd;
        Long hour = (ms - day * dd) / hh;
        Long minute = (ms - day * dd - hour * hh) / mi;
        Long second = (ms - day * dd - hour * hh - minute * mi) / ss;
        Long milliSecond = ms - day * dd - hour * hh - minute * mi - second * ss;

        StringBuffer sb = new StringBuffer();
        if(day > 0) {
            sb.append(day+"天");
        }
        if(hour > 0) {
            sb.append(hour+"小时");
        }
        if(minute > 0) {
            sb.append(minute+"分");
        }
        if(second > 0) {
            sb.append(second+"秒");
        }
        if(milliSecond > 0) {
            sb.append(milliSecond+"毫秒");
        }
        return sb.toString();
    }
}

3.使用Map集合来做一个不同姓氏人数的统计
    有一个String数组保存着10个人的姓名{"张三","李四","王二"...}
    通过程序设计，把不同姓氏的姓氏和人数保存到Map集合中

 public static void main(String[] args) {
        String str = "张,刘,张,刘,王,张,张,王,张,王";
        String str1[] = str.split(",");
        Map count = new HashMap();
        String z = null;
        String l = null;
        String w = null;
        int n1 = 0;
        int n2 = 0;
        int n3 = 0;
        for (int i = 0; i < str1.length; i++) {
            if (str1[i].contains("张")) {
                z = str1[i];
                n1++;
            } else if (str1[i].contains("刘")) {
                l = str1[i];
                n2++;
            }else if (str1[i].contains("王")) {
                w = str1[i];
                n3++;
            }
        }
        count.put(z, n1);
        count.put(l, n2);
        count.put(w, n3);
        System.out.println("count个数："+count.size());
        System.out.println("张"+n1);
        System.out.println("刘"+n2);
        System.out.println("王"+n3);
 
    }
}
————————————————
版权声明：本文为CSDN博主「m猫仙」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.csdn.net/m0_69101441/article/details/125773169

4.模拟扑克牌
花色：♠  ♥   ♦   ♣
 *    牌号：A 2 3 4 5 6 7 8 9 10 J Q K
 *    大王、小王
 *
 *  1.生成一副牌
 *  2.然后发牌
    

package com.yang.dom1.Dmone1;


import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.TreeSet;


public class san {
    public static void main(String[] args) {
        String[] nums = { "A", "2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K" };
        String[] colors = { "黑桃", "红桃", "梅花", "方片" };
        HashMap pokerMap = new HashMap<>();
        List indexList = new ArrayList<>();
        TreeSet buttoms = new TreeSet<>();
        TreeSet player1 = new TreeSet<>();
        TreeSet player2 = new TreeSet<>();
        TreeSet player3 = new TreeSet<>();
        int index = 0;
        for (String num : nums) {
            for (String color : colors) {
                pokerMap.put(index, color + num);
                indexList.add(index);
                index++;
            }
        }
        pokerMap.put(index, "小鬼");
        indexList.add(index++);
        pokerMap.put(index, "大鬼");
        indexList.add(index);
        Collections.shuffle(indexList);
        for (int i = 0; i < indexList.size(); i++) {
            if (i >= indexList.size() - 3) {
                buttoms.add(indexList.get(i));
            } else if (i % 3 == 0) {
                player1.add(indexList.get(i));
            } else if (i % 3 == 1) {
                player2.add(indexList.get(i));
            } else {
                player3.add(indexList.get(i));
            }
        }

        check(pokerMap, player1, "player1");
        check(pokerMap, player2, "player2");
        check(pokerMap, player3, "player3");
        check(pokerMap, buttoms, "buttoms");
    }

    public static void check(HashMap pokerMap, TreeSet player1, String name) {
        System.out.println(name + " :");
        for (Integer i : player1) {
            System.out.print(pokerMap.get(i) + " ");
        }
        System.out.println();
    }
}