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

public int sumNums(int n) {
        boolean flag = n > 0 && (n+=sumNums(n-1))>0;
        return n;
    }

public int sumNums(int n) {
        return IntStream.range(1,n+1).sum();
    }