switch case实现两个数的算术运算

方法一:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
package com.liaojianya.chapter1;
 
import java.util.Scanner;
 
public class SwitchDemo1
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        System.out.println("Enter number a : ");
        double a = input.nextDouble();
        System.out.println("Enter number b : ");
        double b = input.nextDouble();
        Action ac = new Action(a, b);
        ac.command(Action.ADD);
        ac.command(Action.SUBTRACT);
        ac.command(Action.MULTIPLY);
        ac.command(Action.DIVIDE);
        ac.command(Action.MOD);
        input.close();
    }
}
 
class Action
{
    double a;
    double b;
    public Action(double a, double b)
    {
        this.a = a;
        this.b = b;
    }
    public static final int ADD = 1;
    public static final int SUBTRACT = 2;
    public static final int MULTIPLY = 3;
    public static final int DIVIDE = 4;
    public static final int MOD = 5;
 
    public void command(int c)
    {
        switch (c)
        {
        case 1:
            System.out.println(a + " + " + b + " = " + (a + b));
            break;
 
        case 2:
            System.out.println(a + " - " + b + " = " + (a - b));
            break;
 
        case 3:
            System.out.println(a + " * " + b + " = " + (a * b));
            break;
 
        case 4:
            System.out.println(a + " / " + b + " = " + (a / b));
            break;
 
        case 5:
            System.out.println(a + " % " + b + " = " + (a % b));
            break;
 
        default:
            System.out.println("unknown operation!");
            break;
        }
    }
 
}

  方法二:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
package com.liaojianya.chapter1;
 
import java.util.Scanner;
 
/**
 * This program demonstrates the use of switch.
 * @author LIAO JIANYA
 *
 */
public class SwitchDemo
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
         
        System.out.println("Enter number a : ");
        double a = input.nextDouble();
        System.out.println("Enter number b : ");
        double b = input.nextDouble();
        System.out.println("Enter  operater :1代表+,2代表-,3代表*,4代表/,5代表% ");
        int c = input.nextInt();
        switch(c)
        {
            case 1:
            System.out.println(a + " + " + b + " = " + (a + b));
            break;
 
            case 2:
            System.out.println(a + " - " + b + " = " + (a - b));
            break;
 
            case 3:
            System.out.println(a + " * " + b + " = " + (a * b));
            break;
 
            case 4:
            System.out.println(a + " / " + b + " = " + (a / b));
            break;
 
            case 5:
            System.out.println(a + " % " + b + " = " + (a % b));
            break;
             
            default:
                System.out.println("unknown operation!");
                break;
        }
    }
 
}

  运行结果:

1
2
3
4
5
6
7
8
9
Enter number a :
12.3
Enter number b :
32.1
12.3 + 32.1 = 44.400000000000006
12.3 - 32.1 = -19.8
12.3 * 32.1 = 394.83000000000004
12.3 / 32.1 = 0.38317757009345793
12.3 % 32.1 = 12.3

  

posted @   Andya_net  阅读(1273)  评论(0编辑  收藏  举报
编辑推荐:
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
阅读排行:
· 全程不用写代码,我用AI程序员写了一个飞机大战
· DeepSeek 开源周回顾「GitHub 热点速览」
· 记一次.NET内存居高不下排查解决与启示
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET10 - 预览版1新功能体验(一)
点击右上角即可分享
微信分享提示