在Java中重复的字数,它只计算字符数重复的字数

在Java中重复的字数,它只计算字符数重复的字数,java,count,word,Java,Count,Word,我的问题是Java中重复的字数count重复的字数it count字符只在这里输入代码 我只使用核心Java程序 public static void getCount(String name) { Map<Character, Integer> names = new HashMap<Character, Integer>(); for(int i = 0; i < name.length(); i++) { char c = na

我的问题是Java中重复的字数count重复的字数it count字符只在这里输入代码

我只使用核心Java程序

public static void getCount(String name) {
    Map<Character, Integer> names = new HashMap<Character, Integer>();
    for(int i = 0; i < name.length(); i++) {

       char c = name.charAt(i);
       Integer count = names.get(c);
       System.out.println(names.get(c));
       System.out.println("the count"+count);
       if (count == null) {
           count = 0;
       }
       names.put(c, count + 1);
       System.out.println("111111111111");}`
   Set<Character> a = names.keySet();
   for (Character t : a) {
       System.out.println(t + " Ocurred " + names.get(t) + " times");
   }
publicstaticvoidgetcount(字符串名){
映射名称=新的HashMap();
对于(int i=0;i
我想这可能会对你有所帮助

    String name = "banana";
    Map<Character, Integer> countMap = new HashMap<>();
    name.chars()
.forEach((int i) -> countMap.put((char) i, countMap.getOrDefault((char) i, 0) + 1));

countMap.forEach((Character c,Integer count)->System.out.println("Character: "+c+" count: "+count));
String name=“banana”;
Map countMap=新的HashMap();
name.chars()
.forEach((inti)->countMap.put((char)i,countMap.getOrDefault((char)i,0)+1));
countMap.forEach((字符c,整数计数)->System.out.println(“字符:+c+”计数:+count));
或者(我认为这会有更好的表现)

Map countMap2=name.chars().boxed().collect(Collectors.groupingBy(Integer::intValue,Collectors.counting());
countMap2.forEach((整数c,长计数)->{
如果(计数>1){
System.out.println(“字符:”+(字符)c.intValue()+“计数:”+count);
}
});

如果查询用于计算给定字符串中的重复单词,则代码如下:

public static void getCount(String name) {
                java.util.StringTokenizer stoken = new java.util.StringTokenizer(name, " ");
                boolean flag = true;
                if (stoken.countTokens() > 1) {
                    java.util.Map<String, Integer> wordCountMap = new java.util.HashMap<String, Integer>();
                    while (stoken.hasMoreElements()) {
                        String str = stoken.nextElement().toString();
                        if (wordCountMap.containsKey(str)) {
                            wordCountMap.put(str, wordCountMap.get(str) + 1);
                        } else {
                            wordCountMap.put(str, 1);
                        }
                    }
                    System.out.println("Checking for Duplicates..");
                    for (String values : wordCountMap.keySet()) {
                        if (wordCountMap.get(values) > 1) {
                            flag = false;
                            System.out.println(values + "\t\t["+ wordCountMap.get(values) + "]");
                        }
                    }
                }
                if (flag) {
                    System.out.println("No duplicate words");
                }
            }
publicstaticvoidgetcount(字符串名){
java.util.StringTokenizer stoken=new java.util.StringTokenizer(名称“”);
布尔标志=真;
if(stoken.countTokens()>1){
java.util.Map wordCountMap=new java.util.HashMap();
while(stoken.hasMoreElements()){
字符串str=stoken.nextElement().toString();
if(wordCountMap.containsKey(str)){
wordCountMap.put(str,wordCountMap.get(str)+1);
}否则{
wordCountMap.put(str,1);
}
}
System.out.println(“检查副本”);
for(字符串值:wordCountMap.keySet()){
if(wordCountMap.get(值)>1){
flag=false;
System.out.println(values++“\t\t[“+wordCountMap.get(values)+“]);
}
}
}
国际单项体育联合会(旗){
System.out.println(“无重复文字”);
}
}

程序输入一个句子并返回频率最高的重复单词。请严格测试此代码

import java.util.*;
public class DupsWords {

    public static String countDupsWords(String[] arr){
        Hashtable<String,Integer> ht = new Hashtable<String,Integer>(); 
        for(int i=0;i<arr.length;i++){
            if(ht.containsKey(arr[i])){
                ht.put(arr[i],ht.get(arr[i])+1);
            } else{
                ht.put(arr[i],1);
            }       
        }   
        Set<String> keys=ht.keySet();
        String result=null;
        int max=0;
        for(String itr : keys){
            if(Integer.parseInt(ht.get(itr).toString())>max){
                max=Integer.parseInt(ht.get(itr).toString());
                if((ht.contains(max))&&(max>1)){
                    result=itr;
                }       
            }               
        }
        if(result ==null){
            return "No Duplicate";
        }
        else{
            System.out.print("count is "+ max  +" for ");
            return ("'"+ result +"'" + " as a duplicate word");
        }
    }   

    public static void main(String args[ ]){
        Scanner scan = new Scanner(System.in);
        System.out.println("Enter the String");
        String s= scan.nextLine();      
        String[] arr=s.split(" ");
        System.out.print(countDupsWords(arr));
    }

}
import java.util.*;
公共级双剑{
公共静态字符串countdupshows(字符串[]arr){
Hashtable ht=新的Hashtable();
对于(int i=0;imax){
max=Integer.parseInt(ht.get(itr.toString());
如果((ht.包含(最大值))&&(最大值>1)){
结果=itr;
}       
}               
}
如果(结果==null){
返回“无重复”;
}
否则{
系统输出打印(“计数为“+max+”);
返回(“'”+结果+“'”+”作为重复单词);
}
}   
公共静态void main(字符串参数[]){
扫描仪扫描=新扫描仪(System.in);
System.out.println(“输入字符串”);
字符串s=scan.nextLine();
字符串[]arr=s.split(“”);
系统输出打印(计数输出(arr));
}
}

什么?你到底有什么问题?
import java.util.*;
public class DupsWords {

    public static String countDupsWords(String[] arr){
        Hashtable<String,Integer> ht = new Hashtable<String,Integer>(); 
        for(int i=0;i<arr.length;i++){
            if(ht.containsKey(arr[i])){
                ht.put(arr[i],ht.get(arr[i])+1);
            } else{
                ht.put(arr[i],1);
            }       
        }   
        Set<String> keys=ht.keySet();
        String result=null;
        int max=0;
        for(String itr : keys){
            if(Integer.parseInt(ht.get(itr).toString())>max){
                max=Integer.parseInt(ht.get(itr).toString());
                if((ht.contains(max))&&(max>1)){
                    result=itr;
                }       
            }               
        }
        if(result ==null){
            return "No Duplicate";
        }
        else{
            System.out.print("count is "+ max  +" for ");
            return ("'"+ result +"'" + " as a duplicate word");
        }
    }   

    public static void main(String args[ ]){
        Scanner scan = new Scanner(System.in);
        System.out.println("Enter the String");
        String s= scan.nextLine();      
        String[] arr=s.split(" ");
        System.out.print(countDupsWords(arr));
    }

}