话不多说,直接上代码跟结果
import java.io.FileOutputStream;
import java.io.OutputStream;
import java.io.PipedOutputStream;
import java.util.IdentityHashMap;
import java.util.Random;
import java.util.Scanner;
public class dome10 {
//双色球中奖实验
//生成中奖号码
public static void main(String[] args) {
int[] arr = arrse();
//for (int i = 0; i < arr.length; i++) {
// System.out.print(arr[i] + " ");
//}
//用户输入中奖号码
int[] yonghu = arr();
for (int i = 0; i < yonghu.length; i++) {
System.out.print(yonghu[i] + " ");
}
//比较之后查看中奖情况
int hong = 0;
int lan = 0;
for (int i = 0; i < arr.length - 1; i++) {
for (int i1 = 0; i1 < yonghu.length - 1; i1++) {
if (arr[i] == yonghu[i1]) {
hong++;
break;
}
}
}
if (yonghu[yonghu.length - 1] == arr[arr.length - 1]) {
lan++;
}
System.out.println();
System.out.println(hong);
System.out.println(lan);
int many=bijiao(hong, lan);
if (many!=0) {
System.out.println("恭喜你中了"+many+"元");
}else {
System.out.println("很遗憾,没中奖");
}
}
public static int[] arrse() {
int[] arr = new int[7];
Random random = new Random();
for (int i = 0; i < 7; ) {
int suijishu = random.nextInt(34);
boolean b = b(arr, suijishu);
if (!b) {
arr[i] = suijishu;
i++;
}
}
int suijishu2 = random.nextInt(17);
arr[arr.length - 1] = suijishu2;
return arr;
}
public static boolean b(int[] arr, int suijishu) {
boolean b = false;
for (int i = 0; i < arr.length; i++) {
if (arr[i] == suijishu) {
b = true;
}
}
return b;
}
//用户购买的彩票号码;
public static int[] arr() {
int[] arr = new int[7];
Scanner sc = new Scanner(System.in);
System.out.println("请输入你的号码:");
for (int i = 0; i < arr.length - 1; ) {
System.out.println("这是你你输入的第" + (i + 1) + "个红球");
int yonghu = sc.nextInt();
boolean b = b(arr, yonghu);
if (yonghu > 33 | yonghu < 1) {
System.out.println("你输入的数超出范围:");
} else {
if (!b) {
arr[i] = yonghu;
i++;
} else {
System.out.println("你的数已经存在:");
}
}
}
System.out.println("这是你你输入的最后一个球");
while (true) {
int yonghu = sc.nextInt();
if (yonghu > 16 | yonghu < 1) {
System.out.println("你输入的数超出范围:");
}else {
arr[arr.length - 1] = yonghu;
break;
}
}
return arr;
}
public static int bijiao(int hong, int lan) {
int many = 0;
if (lan == 1 & (hong == 1 | hong == 0)) {
many = 5;
} else if (((hong == 2 | hong == 3) & lan == 1) | (hong == 4 & lan == 0)) {
many = 10;
} else if ((hong == 4 & lan == 1) | (hong == 5 & lan == 0)) {
many = 200;
} else if (hong == 5 & lan == 1) {
many = 3000;
} else if (hong == 6 & lan == 0) {
many = 5000000;
} else if (hong == 6 & lan == 1) {
many = 10000000;
}
return many;
}
}
运行截图在这。