递归堆栈溢出错误Java

Question

Stack Overflow Error in Recursion Method when trying to print the first m multiples of a positive integer n. How do I fix it? Code below is already logically correct:

  import java.util.Scanner;
  public class Exercise3
  {
  public static void main (String args[])
  {
  Scanner keyboard = new Scanner(System.in);
  int n, m;
  System.out.println("Please enter values of n and m: ");
  n = keyboard.nextInt();
  m = keyboard.nextInt();
  // logic of code explained above
  for(int i = (m -(m - 1)); i <= m; i++)
  {
     System.out.print(multiple(n * i) + ",");
  }

  }
  // Now Write the Recursive method
  public static int multiple(int n)
  {
     if(n == 0)
        return 1;
      else 
       return multiple(n);
  }

}

Answer 1

This is a very bad use of recursion

public static int multiple(int n){ // once come into this method will never exit
  return multiple(n); // again and again call multiple
}

There is no exit condition from this recursion method. You need to think about an exit condition to terminate this recursive call.

Edit: for your edit:

public static int multiple(int n) { // inside this method n is never change
    if (n == 0)
        return 1;
    else
        return multiple(n);// still no termination for the recursion call      
}

Answer 2

you probably want to do this:

for(int i = (m -(m - 1)); i <= m; i++)
    {
      System.out.print(multiple(n,i)+",");  // call like this in you main method
    }

This is recursive function :

 public static int multiple(int m,int n) {

        if (n == 1)
            return m;
        else
            return  m+multiple(m,n-1);


    }

Answer 3

       import java.util.Scanner;
       public class Exercise3
       {
          public static void main (String args[])
          {
           Scanner keyboard = new Scanner(System.in);
             int n, m;
            System.out.println("Please enter values of n and m: ");
            n = keyboard.nextInt();
            m = keyboard.nextInt();
            // logic of code explained above
            for(int i = (m -(m - 1)); i <= m; i++)
            {
            System.out.print(n * i + ",");
            }
           }    

              }

// Use n = 2 and m = 5 to see first 5 multiples of 2. I need a recursive method to do the same thing. This is iterative