思路:运用&&短路原理,当a&&b中a为假,后面就不计算,一次作为递归结束(精妙)
public int Sum_Solution(int n) { int sum = n; boolean t = (sum!=0) && ((sum += Sum_Solution(n - 1)))!=0; return sum; }