N个数之和
http://www.nowcoder.com/practice/b007744eb43b4f7b95d9e87de01528db
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n=0,sum=0,num=0;
scanf("%d",&n);
while(n--){
scanf("%d",&num);
sum+=num;
}
printf("%d\n",sum);
return 0;
}
相关推荐
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
const flattern = (obj) => {
const res = {};
const dfs = (curr, path) => {
if(typeof curr === 'object' && curr !== null) {
const isArray = Array.isArray(curr);
for(let key in curr) {
const newPath = path ? isArray ? `${path}[${key}]` : `${path}.${key}` : key;
dfs(curr[key], newPath);
}
} else {
res[path] = curr
}
}
dfs(obj);
return res;
}
查看3道真题和解析 