/**
* 双色球程序
* @author Administrator
*
*/
public class Home {
public static void main(String[] args) {
int [] red = new int[6];
for (int i = 0; i < red.length; i++) {
while (true) {
int x = (int)(Math.random()*33)+1;
int y = exist(red, x);
if(y == 0){
red[i] = x;
break;
}
}
}
sort(red);
for (int i : red) {
System.out.print(i+"\t");
}
System.out.println((int)(Math.random()*16)+1);
}
/*
* 冒泡排序法
*/
public static void sort(int[] red){
for (int i = 0; i < red.length-1; i++) {
for (int j = 0; j < red.length-1-i; j++) {
if(red[j]>red[j+1]){
int t = red[j];
red[j] = red[j+1];
red[j+1] = t;
}
}
}
}
/*
* 判断数字b是否存在于数组a中
*/
public static int exist(int [] a,int b){
int m = 0;
for (int i : a) {
if(i == b){
m = 1;
break;
}
}
return m;
}
}
* 双色球程序
* @author Administrator
*
*/
public class Home {
public static void main(String[] args) {
int [] red = new int[6];
for (int i = 0; i < red.length; i++) {
while (true) {
int x = (int)(Math.random()*33)+1;
int y = exist(red, x);
if(y == 0){
red[i] = x;
break;
}
}
}
sort(red);
for (int i : red) {
System.out.print(i+"\t");
}
System.out.println((int)(Math.random()*16)+1);
}
/*
* 冒泡排序法
*/
public static void sort(int[] red){
for (int i = 0; i < red.length-1; i++) {
for (int j = 0; j < red.length-1-i; j++) {
if(red[j]>red[j+1]){
int t = red[j];
red[j] = red[j+1];
red[j+1] = t;
}
}
}
}
/*
* 判断数字b是否存在于数组a中
*/
public static int exist(int [] a,int b){
int m = 0;
for (int i : a) {
if(i == b){
m = 1;
break;
}
}
return m;
}
}