剑指 Offer 64. 求1+2+…+n

1
2
3
4
5
6
class Solution {
public int sumNums(int n) {
boolean ignore = n > 1 && (n += sumNums(n - 1)) > 0;
return n;
}
}

References

剑指 Offer 64. 求1+2+…+n