挑7
https://www.nowcoder.com/practice/ba241b85371c409ea01ac0aa1a8d957b
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >>n;
string str;
int count = 0;
for(int i = 1; i <= n; i++)
{
str = to_string(i);
if(str.find('7') != string::npos|| i % 7 == 0)
{
count++;
}
}
cout<<count;
return 0;
}
// 64 位输出请用 printf("%lld")
相关推荐
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
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道真题和解析 
投递京东等公司10个岗位 
联想公司福利 1523人发布