如何使用递归实现计算器的加减乘除（兔C番外）

package com.DemoTest.homework;

import java.util.Scanner;

public class resultTest {

    public static void main(String[] args) {
        System.out.println("程序开始执行：");
        scannerT();
        
    }

    public static void scannerT(){
        Scanner scanner = new Scanner(System.in);
        System.out.println("请输入一个参数：");
        double number1 = scanner.nextDouble();
        System.out.println("请输入运算符：");
        String next = scanner.next();
        System.out.println("请输入第二个参数");
        double number2 = scanner.nextDouble();

        double result = 0.0;
        switch (next){
            case "+":
                result = addResult(number1,number2);
                System.out.println("当前的加法计算结果为："+result);
                break;

            case "-":
                result = minusResult(number1,number2);
                System.out.println("当前的减法计算结果为："+result);
                break;
            case "*":
                result =MULResult(number1,number2);
                System.out.println("当前乘法计算结果为："+result);
                break;
            case "/":
                result =divideResult(number1,number2);
                System.out.println("当前触发计算结果为："+result);
        }

        if (result != 0.0 || result ==0.0){
            scannerT();
        }
    }

    public static double divideResult(double number1, double number2){
        double result =0.0d;

        if (number1 == 0){
            System.out.println("0不能作为除数哦~");
            return 0.0;

        }
        result = number1/number2;

        return result;
    }


    public static double MULResult(double number1, double number2){
        double result =0.0d;

        result = number1*number2;
        return result;
    }


    public static double addResult(double number1, double number2){
        double result =0.0d;

        result = number1+number2;
        return result;
    }

    public static double minusResult(double number1, double number2){
        double result =0.0d;

        result = number1-number2;
        return result;
    }
}