Java Recursive algorithm--triangle number

Import Java.io.bufferedreader;import Java.io.ioexception;import Java.io.inputstream;import java.io.inputstreamreader;//=================================================//File name:triangle_demo//------- -----------------------------------------------------------------------//author:common//class Name://attribute://Method://Main class//fun Ction:triangle_demopublic class Triangle_demo {//static int thenumber;public static void main (string[] args) thro WS exception{//TODO Auto-generated method stub System.out.println ("Input number:"), int thenumber = GETINT (), int theanswer = triangle (thenumber); System.out.println ("Number of each row on the triangle:" +theanswer);} public static int triangle (int n) {///Recursive Output 1 3 6 10....if (n==1) return 1;elsereturn (n + triangle (n-1));} The output method public static String getString () throws Ioexception{inputstreamreader ISR = new InputStreamReader (system.in); BufferedReader br = new BufferedReader (ISR); String s = br.readline (); return s;} Output method public static int getInt () throws ioexception{string s = getString (); return integeR.parseint (s);}} 

Java Recursive algorithm--triangle number