递归与非递归解决组合问题

 递归算法：

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class NonRecursion {
 
 public static void main(String[] args){
   
   int n=0;
   int m=0;
   boolean finish=false;
   BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        
        
   while(!finish){
    try{
    //get n 
    System.out.println("Please enter n:");
    n = Integer.parseInt(input.readLine());
    if(n<0){
     System.err.println("n can't be less than zero, please enter again.");
     continue;
    } 
    System.out.println("n is:"+n);
    
    //get m
    System.out.println("Please enter m:");
    m = Integer.parseInt(input.readLine());
    if(m<0 || m >n){
     System.err.println("m can't be less than zero or more than n , please enter again.");
     continue;
    } 
    System.out.println("m is:"+m);
    finish = true;
    }catch(IOException e){
     System.err.println("There is an ioexception happening.");
    }
   }
 }
}