每日总结-23.11.13

package kousuanti;

import java.util.Random;

public class Chuti {


    private int ShuLiang=50;//出题数量
    private int HuangHang=5;//几题换行
    private int XiangJia=3;//几个数相加
    private int FanWei=100;//出题范围
    private boolean isChengChu=false;//是否有乘除法
    private int[][] JiLu;//出题记录
    private int i_JiLi=0;

    private void ShengCheng() {
        JiLu=new int[ShuLiang][XiangJia*2-1];
        int is;
        if(isChengChu)
            is = 4;
        else is = 2;
        for (int i = 0; i < ShuLiang; i++) {
            int arr[]=MyRandom(XiangJia*2-1,FanWei);
            for (int j = 0; j < XiangJia-1; j++) {
                arr[j*2+1]=arr[j*2+1]%is;
            }
            if(isNotRepeat(arr)) {
                if(XiangJia==2) {
                    if(isFuHeYaoQiu(arr)){
                        JiLu[i_JiLi] = arr;
                        i_JiLi++;
                    }else i--;
                }else {
                    JiLu[i_JiLi] = arr;
                    i_JiLi++;
                }
            }
            else i--;
        }
    }
    public void Show() {
        ShengCheng();
        for (int i = 0; i < ShuLiang; i++) {
            if(i%HuangHang==0&&i!=0)
                System.out.println();
            for (int j = 0; j < XiangJia-1; j++) {
                System.out.print(JiLu[i][j*2]);
                switch(JiLu[i][j*2+1]) {
                    case 0:System.out.print("+");break;
                    case 1:System.out.print("-");break;
                    case 2:System.out.print("*");break;
                    case 3:System.out.print("/");break;
                }
            }
            System.out.print(JiLu[i][XiangJia*2-2]+"=   ");
        }
    }

    private boolean isNotRepeat(int arr[]) {
        if(i_JiLi==0)
            return true;
        int m=i_JiLi;
        int n=XiangJia*2-1;
        for(int j=0;j<m;j++)
            for(int i=0;i<n;i++)
                if(JiLu[j][i]!=arr[i])
                    return true;
        return false;
    }
    private boolean isFuHeYaoQiu(int arr[]){
        if(arr[1]==0){
            if(arr[0]+arr[2]>FanWei)
                return false;
            else return true;
        } else {
            if(arr[0]-arr[2]<0)
                return false;
            else return true;
        }
    }

    //随机,num数量,max范围
    private int[] MyRandom(int num,int max) {
        Random r = new Random();
        int arr[]=new int[num];
        for(int i=0;i<num;i++)
            arr[i]=r.nextInt(max);
        return arr;
    }

    public int getShuLiang() {
        return ShuLiang;
    }

    public void setShuLiang(int shuLiang) {
        ShuLiang = shuLiang;
    }

    public int getHuangHang() {
        return HuangHang;
    }

    public void setHuangHang(int huangHang) {
        HuangHang = huangHang;
    }

    public int getXiangJia() {
        return XiangJia;
    }

    public void setXiangJia(int xiangJia) {
        XiangJia = xiangJia;
    }

    public int getFanWei() {
        return FanWei;
    }

    public void setFanWei(int fanWei) {
        FanWei = fanWei;
    }

    public boolean isChengChu() {
        return isChengChu;
    }

    public void setChengChu(boolean chengChu) {
        isChengChu = chengChu;
    }
}