leetcode-剑指64-OK
时间:2021-02-01 12:39:49
收藏:0
阅读:0
// language c
// 剑指64
// https://leetcode-cn.com/problems/qiu-12n-lcof/
int sumNums(int n){
int ans = n;
(n) &&(ans +=sumNums(n-1));
return ans;
}
评论(0)