统计数据正负个数
https://www.nowcoder.com/practice/3f33889582934a09b4e3ddd3cc976226
#include <stdio.h>
int main() {
int arr[10] = { 0 }, i = 0, po = 0, ne = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &arr[i]);
if (arr[i] > 0)
po++;
if (arr[i] < 0)
ne++;
}
printf("positive:%d\n", po);
printf("negative:%d", ne);
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道真题和解析 