使用递归的Java乘法

Question

I am writing a simple code in Java that is using recursion. I want to show the product of two numbers that a user will enter. I managed to do that using recursion, but stuck at the point where I want to show that the product could be written as (example) 10*5 = 5+5+5+5+5+5+5+5+5+5 (10 times), or 12*3 = 3+3+3+3+3+3+3+3+3+3+3+3 (12 times). Here is my code so far. In the code i put a comment where it should be written (example). Thanks.

import java.util.Scanner;

public class RecursiveMultiplication {

public static void main(String[] args) {
    Scanner key = new Scanner(System.in);
    int a, b;
    System.out.print("Enter first number: ");
    a = key.nextInt();
    System.out.print("Enter second number: ");
    b = key.nextInt();
    System.out.println("The product of " + a + " and "
            + b + " is: " + multiRec(a, b));
    System.out.println("It could also be written as: ");   //Here should product be broken into smaller numbers


}

public static int multiRec(int x, int y) {
    if (x == 0 || y == 0) {
        return 0;
    } else {
        if (x == 1) {
            return y;
        } else {
            return x + (multiRec(x, y - 1));
        }
    }

  }

}

Answer 1

A StringBuilder should be defiend as

StringBuilder buf = new StringBuilder (a);

Pass this StringBuilder paramater into multiRec

and then change multiRec to be

public static int multiRec(int x, int y, StringBuilder buf) {
    if (x == 0 || y == 0) {
        return 0;
    } else {
        if (x == 1) {
            return y;
        } else {
            buf.append (" + ").append (x);
            return x + (multiRec(x, y - 1, buf));
        }
    }

  }

}

Then when completed simply printout its value

Answer 2

    import java.util.Scanner;

public class RecursiveMultiplication {
    public static void main(String[] args) {
        Scanner key = new Scanner(System.in);
       int a , b;
        System.out.print("Enter first number: ");
        a = key.nextInt();
        System.out.print("Enter second number: ");
        b = key.nextInt();
        System.out.printf("%d %s %d %s",a , "*" , b ,"= ");
        System.out.println("\nThe product of " + a + " and "
                + b + " is: " + multiRec(b, a));
       // System.out.println("It could also be written as: ");   //Here should product be broken into smaller numbers


    }

    public static int multiRec(int x, int y) {

        if (x == 0 || y == 0) {
            return 0;
        } else {
            System.out.print(x+" ");
            if (y == 1) {
                return x;
            } else {
                System.out.print(" + ");
                return x + (multiRec(x, y - 1));
            }
        }

      }
}