代码修改如下,供参考:
#include <stdio.h>
#define N 11
struct people {
char name[10];
float base, floatt, expen, salary;
};
int main()
{
int i, n;
struct people a[N];
printf("n=");
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%s %f %f %f", a[i].name, &a[i].base, &a[i].floatt, &a[i].expen);
a[i].salary = a[i].base + a[i].floatt - a[i].expen;
}
for (i = 0; i < n; i++)
printf(i ? "\n%5s,Salary is:%7.2f" : "%5s,Salary is:%7.2f", a[i].name, a[i].salary);
return 0;
}
题目来源:leetcode(力扣)
题目链接:https://leetcode-cn.com/problems/binary-tree-level-order-traversal/