1. 1-50的随机数 用集合实现
package com.xuyilong.col;
import java.util.HashSet;
public class ListForNum {
public static void main(String[] args) { ListForNum test=new ListForNum(); test.countNum(); } void countNum(){ HashSet<Integer> numSet=new HashSet<>(); int[] time=new int[41]; for (int i = 1,j=0; i <= 50; i++) { j=(int) (Math.round((Math.random() * 40)) + 10); System.out.print(j+(i%10==0?"\n":" ")); if (numSet.add(j)) { time[j-10]=1; }else { time[j-10]+=1; } } int maxK = 0; String str = ""; for (int i = 0,j=0; i <41; i++) { if (time[i]!=0) { j++; System.out.print("数字"+(i+10)+"出现了"+time[i]+"次"); System.out.print((j%5==0?"\n":" ")); if (time[i] == maxK) { str = str +i+ ", "; } else if (time[i] > maxK) { maxK = time[i]; str = i + ", "; } } } System.out.println("\n出现最多次数的数字是:" + str + "次数为" + maxK + "次"); } }
|
2. set根据什么集合判断重复,总结规则
根据Map的键值不重复原则实现的。Map的键值不重复也是根据.equals即==判断的。