zoukankan      html  css  js  c++  java
  • Java学习

    学习内容:设计算法实现自动实现30道100以内四则运算(可以排除重复,选择是否有乘除法)

    代码实现:

    import java.util.Random;
    import java.util.Scanner;

    public class Test3 {

    public static void main(String[] args) {
    int num1,num2;
    int number1[]=new int[100];
    int number2[]=new int[100];
    int number3[]=new int[100];
    int number4[]=new int[100];
    int number5[]=new int[100];
    int number6[]=new int[100];
    int number7[]=new int[100];
    int number8[]=new int[100];
    int sum;
    int i,j,k,choice;
    char c;
    char[] operator=new char[]{'+','-','*','/'};
    char[] operator1=new char[]{'+','-'};
    System.out.println("包含乘除法请按1,不包含请按0");
    Scanner sc=new Scanner(System.in);
    choice=sc.nextInt();
    Random rand = new Random();
    if(choice==1) {
    for(i=1;i<=30;i++) {
    j=rand.nextInt(4);
    c=operator[j];
    do{
    num1=rand.nextInt(101);
    num2=rand.nextInt(101);
    }while(num1==0||num2==0);
    if(c=='+') {
    System.out.print("第"+i+"道题为:");
    System.out.println(num1+"+"+num2+"=");
    number1[i]=num1;
    number2[i]=num2;
    for(k=1;k<i;k++) {
    if((num1==number1[k]&&num2==number2[k])||(num1==number2[k]&&num2==number1[k])) {
    System.out.println("该题与第"+k+"道题目重复");
    }
    }
    }
    else if(c=='-') {
    System.out.print("第"+i+"道题为:");
    System.out.println(num1+"-"+num2+"=");
    number3[i]=num1;
    number4[i]=num2;
    for(k=1;k<i;k++) {
    if((num1==number3[k]&&num2==number4[k])) {
    System.out.println("该题与第"+k+"道题目重复");
    }
    }
    }
    else if(c=='*') {
    System.out.print("第"+i+"道题为:");
    System.out.println(num1+"*"+num2+"=");
    number5[i]=num1;
    number6[i]=num2;
    for(k=1;k<i;k++) {
    if((num1==number5[k]&&num2==number6[k])||(num1==number6[k]&&num2==number5[k])) {
    System.out.println("该题与第"+k+"道题目重复");
    }
    }
    }
    else if(c=='/') {
    System.out.print("第"+i+"道题为:");
    System.out.println(num1+"/"+num2+"=");
    number7[i]=num1;
    number8[i]=num2;
    for(k=1;k<i;k++) {
    if((num1==number7[k]&&num2==number8[k])) {
    System.out.println("该题与第"+k+"道题目重复");
    }
    }
    }
    }
    }
    else {
    for(i=1;i<=30;i++) {
    j=rand.nextInt(2);
    c=operator[j];
    do{
    num1=rand.nextInt(101);
    num2=rand.nextInt(101);
    }while(num1==0||num2==0);
    if(c=='+') {
    System.out.print("第"+i+"道题为:");
    System.out.println(num1+"+"+num2+"=");
    number1[i]=num1;
    number2[i]=num2;
    for(k=1;k<i;k++) {
    if((num1==number1[k]&&num2==number2[k])||(num1==number2[k]&&num2==number1[k])) {
    System.out.println("该题与第"+k+"道题目重复");
    }
    }
    }
    else if(c=='-') {
    System.out.print("第"+i+"道题为:");
    System.out.println(num1+"-"+num2+"=");
    number3[i]=num1;
    number4[i]=num2;
    for(k=1;k<i;k++) {
    if((num1==number3[k]&&num2==number4[k])) {
    System.out.println("该题与第"+k+"道题目重复");
    }
    }
    }
    }

    }
    }
    }

    运行截图:

     

  • 相关阅读:
    ansible使用
    git undo last commit
    metadata简介
    tinyint(4),tinyint(80)有什么区别
    php 打印debug日志
    tinycore Network card configuration during exec bootlocal.sh
    Windows使用CMD命令查看进程和终止进程
    @NotEmpty,@NotNull和@NotBlank的区别
    spring boot 程序启动缓慢的问题(二)
    LocalDateTime的一些用法
  • 原文地址:https://www.cnblogs.com/zyj3955/p/13758127.html
Copyright © 2011-2022 走看看