zoukankan      html  css  js  c++  java
  • 小学四则运算APP 第一个冲刺 第二天

    团队成员:陈淑筠、杨家安、陈曦

    团队选题:小学四则运算APP

    第一次冲刺阶段时间:11.17~11.27

    本次程序是为了解决上次判断的问题,但是还是出现新的问题页面无法调整,需要进行改进

    本次改进代码为:

    import java.util.Random;
    
    import android.os.Bundle;
    import android.app.Activity;
    import android.view.Menu;
    import android.view.View;
    import android.view.View.OnClickListener;
    import android.widget.Button;
    import android.widget.EditText;
    import android.widget.TextView;
    import android.widget.Toast;
    
    public class CalculatorActivity extends Activity {
    	private final Random num1=new Random();
    	private final Random num2=new Random();
    	private final Random r = new Random();
    	private char[] ch = {'+','-','*','/'}; //字符数组
    	private int index = r.nextInt(ch.length); //随机数,小于数组的长度数, 0~3
    	private char a=ch[index];
    	private TextView text1,text2,text3;
    	private EditText answer;
    	private Button surebutton;//确定按钮
    	private String c;
    	private String e;
    	private String b;
    	private int i1,i2,i3;
    	@Override
    	protected void onCreate(Bundle savedInstanceState) {
    		super.onCreate(savedInstanceState);
    		setContentView(R.layout.activity_calculator);
    		text1=(TextView)findViewById(R.id.textView1);//随机数字
    		text2=(TextView)findViewById(R.id.textView2);//运算符号
    		text3=(TextView)findViewById(R.id.textView3);//随机数字
    		answer=(EditText)findViewById(R.id.editText1);//运算结果
    		b=answer.getText().toString();//获取输入的数值
    		i1=Integer.valueOf(b);
    		c=String.valueOf(num1.nextInt(100));
    		i1=Integer.valueOf(c);
    		String d=String.valueOf(a);
    		e=String.valueOf(num2.nextInt(100));
    		i3=Integer.valueOf(e);
    		text1.setText(c);//随机数1-100
    		text2.setText(d);//随机运算符+,-,*,/
    		text3.setText(e);//随机数1-100
    		surebutton=(Button)findViewById(R.id.surebutton);//确定按钮
    		surebutton.setOnClickListener(new OnClickListener() {
    			@Override
    			public void onClick(View arg0) {
    				// TODO Auto-generated method stub
    				switch(index){
    				case 0:
    				{
    					if(i1==i2+i3)
    						Toast.makeText(CalculatorActivity.this, "正确"+b, Toast.LENGTH_SHORT).show();
    					else
    						Toast.makeText(CalculatorActivity.this, "错误"+b, Toast.LENGTH_SHORT).show();
    					break;
    				}
    				case 1:
    				{
    					if(i1==i2-i3)
    						Toast.makeText(CalculatorActivity.this, "正确"+b, Toast.LENGTH_SHORT).show();
    					else
    						Toast.makeText(CalculatorActivity.this, "错误"+b, Toast.LENGTH_SHORT).show();
    					break;
    				}
    				case 2:{
    					if(i1==i2*i3)
    						Toast.makeText(CalculatorActivity.this, "正确"+b, Toast.LENGTH_SHORT).show();
    					else
    						Toast.makeText(CalculatorActivity.this, "错误"+b, Toast.LENGTH_SHORT).show();
    					break;		
    				}
    				case 3:
    				{
    					if(i3!=0){
    					if(i1==(i2/i3))
    						Toast.makeText(CalculatorActivity.this, "正确"+b, Toast.LENGTH_SHORT).show();
    					else
    						Toast.makeText(CalculatorActivity.this, "错误"+b, Toast.LENGTH_SHORT).show();
    					}
    					break;
    				}
    				}
    			}
    		});
    		
    	}
    
    	@Override
    	public boolean onCreateOptionsMenu(Menu menu) {
    		// Inflate the menu; this adds items to the action bar if it is present.
    		getMenuInflater().inflate(R.menu.calculator, menu);
    		return true;
    	}
    
    }
    

     

     失败截图,正在努力改进中!

  • 相关阅读:
    Java 集合系列06之 Vector详细介绍(源码解析)和使用示例
    Java 集合系列05之 LinkedList详细介绍(源码解析)和使用示例
    Java 集合系列04之 fail-fast总结(通过ArrayList来说明fail-fast的原理、解决办法)
    linked-list-cycle-ii-LeetCode
    reorder-list-LeetCode
    sum-root-to-leaf-numbers-LeetCode
    binary-tree-maximum-path-sum-LeetCode
    机器人的运动范围-剑指Offer
    矩阵中的路径-剑指Offer
    滑动窗口的最大值-剑指Offer
  • 原文地址:https://www.cnblogs.com/babybluecsj/p/4976129.html
Copyright © 2011-2022 走看看