2 Star 1 Fork 0

BESTI.IS.JAVA2018 / 20165334李天龙_JavaProgramming

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
Practice.java 4.67 KB
一键复制 编辑 原始数据 按行查看 历史
import java.util.ArrayList;
import java.util.*;
import java.util.Random;
public class Practice {
Random ran = new Random();
private String sym,Ti="";
private int num,trues=0;
private List<String > list,list1,list2;
public Practice(){
list = new ArrayList<String>();
list1 = new ArrayList<String>();
list2 = new ArrayList<String>();
}
public void Ti(int number,int many){
many = Ticlass(many);
for (int j=0;j<number;j++) {
String ti="";
for (int i = 0; i < many; i++) {
int A = ran.nextInt(20)+1;
int D = ran.nextInt(20)+1;
int B = ran.nextInt(5);
int C = ran.nextInt(5);
RationalNumber si = new RationalNumber(A,D);
if (parity(i)) {
if(list1.indexOf("( ")==-1)
list1.add(getSym() + " ");
else if (list1.size()-list1.lastIndexOf("( ")>4 ) {
if(list1.lastIndexOf(") ")-list1.lastIndexOf("( ")<0 && B == 0){
list1.add(") ");
list1.add(getSym() + " ");
}else list1.add(getSym() + " ");
}else list1.add(getSym() + " ");
}
else if(i==many-1){
if(list1.lastIndexOf("( ")-list1.lastIndexOf(") ")>0) {
if(C==0) {
list1.add(si.toString() + " ");
list1.add(" ");
}else {
list1.add(A + " ");
list1.add(") ");
}
}
else if (C!=0)
list1.add(A + " ");
else list1.add(si.toString() + " ");
}else if(i==0){
if (C!=0)
list1.add(A + " ");
else list1.add(si.toString() + " ");
} else if (list1.lastIndexOf(") ")!=-1 ) {
if (list1.lastIndexOf(") ") - list1.lastIndexOf("( ") > 0 && B == 0) {
list1.add("( ");
if (C != 0)
list1.add(A + " ");
else list1.add(si.toString() + " ");
} else if (C != 0)
list1.add(A + " ");
else list1.add(si.toString() + " ");
} else if(list1.indexOf("( ")==-1 && B==0) {
list1.add("( ");
if (C!=0)
list1.add(A + " ");
else list1.add(si.toString() + " ");
}else if (C!=0)
list1.add(A + " ");
else list1.add(si.toString() + " ");
}
for(String i:list1)
ti += i;
list1.clear();
list.add(ti);
}
}
public void show(){
Original ori = new Original();
Counts coun = new Counts();
Scanner scan = new Scanner(System.in);
ListIterator<String> li = list.listIterator();
while (li.hasNext()){
String A = li.next();
li.remove();
ori.evaluate(A);
String result = coun.evaluate(ori.getMessage());
System.out.print(A + " =");
String B = scan.next();
if(result.equals(B)){
System.out.println("正确!");
trues++;
}else {
System.out.printf("错误!");
System.out.println("正确答案为:" + result);
}
}
}
public int getTrues(){
return trues;
}
public String getSym(){
int A = ran.nextInt(4);
switch (A){
case 0:
sym = "+";
break;
case 1:
sym = "-";
break;
case 2:
sym = "*";
break;
case 3:
sym = "/";
break;
}
return sym;
}
public boolean parity(int num){
if(num%2==1)
return true;
else
return false;
}
public int Ticlass(int many){
int A = 1;
for (int i=0;i<many;i++) {
A += 2;
}
return A;
}
private boolean isOperator (String token)
{
return ( token.equals("*") || token.equals("/") ||
token.equals("+") || token.equals("-"));
}
}
1
https://gitee.com/BESTI-IS-JAVA-2018/20165334LiTianLong_JavaProgramming.git
git@gitee.com:BESTI-IS-JAVA-2018/20165334LiTianLong_JavaProgramming.git
BESTI-IS-JAVA-2018
20165334LiTianLong_JavaProgramming
20165334李天龙_JavaProgramming
master

搜索帮助