统计大写字母个数
https://www.nowcoder.com/practice/434414efe5ea48e5b06ebf2b35434a9c
#include <bits/stdc++.h>
#include <cctype>
using namespace std;
int main() {
string str;
int n = 0;
getline(cin,str);
for(int i=0; i<str.size(); i++){
if(isupper(str[i])) n++;
}
cout << n << endl;
}
// 64 位输出请用 printf("%lld")
相关推荐
查看5道真题和解析 
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
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道真题和解析 
