题解 | #数位之和#
数位之和
https://ac.nowcoder.com/acm/problem/22199
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b=0;
cin>>a;
while(a){
b+=a%10;
a/=10;
}
cout<<b;
return 0;
}
数位之和
https://ac.nowcoder.com/acm/problem/22199
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b=0;
cin>>a;
while(a){
b+=a%10;
a/=10;
}
cout<<b;
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道真题和解析