对生成一定数量随机数进行排序查找统计(实例化对象版)

public class NumberModel {
	private int num;
	private int count;
	
	
	public NumberModel() {
		super();
	}
	
	public NumberModel(int num, int count) {
		super();
		this.num = num;
		this.count = count;
	}
	public int getNum() {
		return num;
	}
	public void setNum(int num) {
		this.num = num;
	}
	public int getCount() {
		return count;
	}
	public void setCount(int count) {
		this.count = count;
	}

	@Override
	public String toString() {
		return "NumberModel [num=" + num + ", count=" + count + "]";
	}
	
	
}


import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;

public class NumberTest {

	static ArrayList<NumberModel> list = new ArrayList<>();
	
	public static void main(String[] args) {
		random(10, 5);
		print();
		int max = getMax();
		System.out.println("-----------------");
		printMax(max);
		System.out.println("-----排序--------");
		sort();
		print();
	}


	private static void sort() {
		int size = list.size();
		for(int i=0;i<size-1;i++) {
			for(int j = 0;j<size-1-i;j++) {
				NumberModel left = list.get(j);
				NumberModel right = list.get(j+1);
				if(left.getCount()>right.getCount()) {
					list.set(j, right);
					list.set(j+1, left);
				}
			}
		}
		
	}


	

	// 生成随机数
	static void random(int n, int range) {
		Random random = new Random();
		for (int i = 0; i < n; i++) {
			int p = random.nextInt(range);
			System.out.println(p);
			if (define(p)) {
				NumberModel num = new NumberModel(p, 1);
				list.add(num);
			}
		}
	}

//	判断之前是否存在该数
	static boolean define(int p) {
		for (NumberModel num : list) {
			if (num.getNum() == p) {
				num.setCount(num.getCount() + 1);
				return false;
			}
		}
		return true;
	}
	private static void print() {
		for (NumberModel num : list) {
			System.out.println(num.toString());
		}
	}
//	获取最大值
	public static int getMax() {
		int max = 0;
		for (NumberModel num : list) {
			if(num.getCount()>max) {
				max = num.getCount();
			}
		}
		return max;
	}
	
//	输出最大值
	public static void printMax(int max) {
		for (NumberModel num : list) {
			if(num.getCount() == max) {
				System.out.println(num);
			}
		}
	}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值