这个Java程序展示了如何查找数组中出现频率最高的字符串。通过遍历数组，使用HashMap存储每个字符串及其出现的次数。然后，找到次数最多的字符串并返回。在示例中，数组`arr1`包含多个重复的`HAHHA`字符串，程序将其找出并返回。
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class Test1 {
public static void main(String[] args){
String[] arr1={"HAHHA","AJFOIAJ","HAHAHA","HAHHA","HAHHA","HAHHA","asfda","bbbvg"};
String[] maxString=findMaxString(arr1);
System.out.println(Arrays.toString(maxString));
}
public static String[] findMaxString(String[] arr){
Map<Integer,String> map=new HashMap<Integer,String>();
for(int i=0;i<arr.length-1;
import java.util.HashMap;
import java.util.Map;
public class Test1 {
public static void main(String[] args){
String[] arr1={"HAHHA","AJFOIAJ","HAHAHA","HAHHA","HAHHA","HAHHA","asfda","bbbvg"};
String[] maxString=findMaxString(arr1);
System.out.println(Arrays.toString(maxString));
}
public static String[] findMaxString(String[] arr){
Map<Integer,String> map=new HashMap<Integer,String>();
for(int i=0;i<arr.length-1;
最低0.47元/天 解锁文章
扫一扫
6632
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
