程序设计中的数学归纳法
每一个递归都有一个基值(终止)条件 ,以防止无限的递归下去
三角数字:1,3,6,10,15,21,28,。。。。。
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class TiangleApp {
static int number;
public static void main(String[] args) throws IOException {
System.out.println("Enter a number:");
number = getInt();
int answer = triangle(number);
System.out.println("Tiangle = "+answer);
}
public static int triangle(int n){
if(n==1)
return 1;
else
return n+triangle(n-1);
}
public static String getString() throws IOException{
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String s = br.readLine();
return s;
}
public static int getInt() throws IOException{
String s = getString();
return Integer.parseInt(s);
}
}