程序源弃坑之路6（java）

来源：互联网发布：扑克牌记忆软件编辑：程序博客网时间：2024/06/11 20:44
package learn.lesson1;import java.util.ArrayList;import java.util.List;import java.util.Scanner;/** * 排序练习 * @author lenovo * *//** *  * 寻找最大值，并记录最大值的记录。 * 定义数组：{ 6,6,3,4,6,1,2} * */public class ArraySortTest {    public static void main(String[] args) {        String puke[] = {"A","1","2","3","4","5","6","7","8","9","10","J","Q","K"};        List<Integer> randomList = new ArrayList<Integer>();        Scanner scan = new Scanner(System.in);        System.out.println("输入需要抽取的牌的数量：");        int num = scan.nextInt();        for(int i = 0; i < num; i++){            randomList.add(GetRandom.random(1, puke.length));        }        System.out.println("输出：");        for(int i =0; i < randomList.size(); i++){            System.out.println("扑克牌下标为："+(randomList.get(i)-1) + " 扑克牌面为："+ puke[randomList.get(i)-1]);        }    }}/** * 生成随机数的类 * @author lenovo * */class GetRandom{    static List<Integer> chongfu = new ArrayList<Integer>();    public static int random(int min, int max){        int random = (int)(min+(max-min)*Math.random());        while(isExist(random)){            random = (int)(min+(max-min)*Math.random());        }        return random;    }    /**     * 检验是否重复     * @param temp     * @return     */    public static boolean isExist(int temp){        for(int i = 0; i < chongfu.size(); i++){            if(temp == chongfu.get(i)){                return true;            }        }        return false;    }}
0 0