递归求n个数相加的和

package baidu.DiGui;
/**
 * 利用递归算法计算1+2+3+。。。+n
 * @author 2萌
 *
 */
public class TestreCursion {
	int i = 1;
	int sum = 0;
	public int sum() {
		
		sum += i;
		i++;
		
		if(i<100) {
			sum();
		}	
		return sum;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		TestreCursion t = new TestreCursion();
		System.out.println(t.sum());
	}
}