C语言面试题

1.求某一年的某一天

#include<stdio.h>
struct SDate
{
	int nYear;
	int nMonth;
	int nDay;
};

int main()
{
	SDate dt;
	printf("请输入年月日：");
	scanf_s("%d%d%d",&dt.nYear,&dt.nMonth,&dt.nDay);
	int mm[] = {31,28,31,30,31,30,31,31,30,31,30,31};
	int i = 0, nDay = dt.nDay;
	while (i<dt.nDay-1)
	{
		nDay = +mm[i];
		++i;
	}
	if (dt.nYear%4==0&&dt.nYear%100!=0||dt.nYear%400==0)
	{
		if (dt.nMonth>2)
			++nDay;
	}
	printf("这是%d年的第%d天\n",dt.nYear,dt.nDay);
	return 0;
}

将打印和算法抽象成不同函数

#include<stdio.h>
struct SDate
{
	int nYear;
	int nMonth;
	int nDay;
};
void Input(SDate* p)
{
	printf("请输入年月日：");
	/*scanf_s("%d%d%d", &(*p).nYear, &(*p).nMonth, &(*p).nDay);*/
	scanf_s("%d%d%d",&(p->nYear),&(p->nMonth),&(p->nDay));
}
int Caculate(SDate *p)
{
	int mm[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
	int i = 0, nDay = p->nDay;
	while (i<p->nDay - 1)
	{
		nDay = +mm[i];
		++i;
	}
	if (p->nYear % 4 == 0 && p->nYear % 100 || p->nYear % 400 == 0)
	{
		if (p->nMonth>2)
			++nDay;
	}
	return nDay;
}
int main()
{
	/*SDate dt;
	Input(&dt);
	Caculate(&dt);
	printf("这是%d年的第%d天\n",dt.nYear,dt.nDay);*/
	SDate dt;
	SDate* p = &dt;
	Input(p);
	Caculate(p);
	printf("这是%d年的第%d天\n",p->nYear,p->nDay);
	return 0;
}

2.创建一个结构体，并对结构成员中某个变量进行排序

#include<stdio.h>
#include<string.h>
struct Suser
{
	char sName[20];
	char sNum[20];
};

void Input(Suser*p)
{
	int i = 0;
	while (i<5)
	{
		printf("请输入第%d个用户的姓名和电话号码：",i+1);
		scanf_s("%s%s",&p[i].sName,sizeof(p[i].sName),&p[i].sNum,sizeof(p[i].sNum));
		++i;
	}
}

void Print(Suser *p)
{
	int i = 0;
	while (i<5)
	{
		printf("第%d个用户的姓名:%s  电话号码：%s\n", i + 1,p->sName,p->sNum);
		++i,++p;
	}
}

void Sort(Suser *p)
{
	int i = 0;
	while (i<4)
	{
		int j = 0;
		while (j<4 - i)
		{
			if (strcmp(p[j].sName, p[j + 1].sName)>0)
			{
				Suser t = p[j];
				p[j] = p[j + 1];
				p[j + 1] = t;
			}
			++j;
		}
		++i;
	}
}
int main()
{
	/*pser p[5] = {
		{"adice","123456566"},
		{ "mlice", "2123456566" },
		{ "dlice", "2123456566" },
		{ "clice", "1323456566" },
		{ "blice", "1253456566" }
	};*/
	Suser su[5];
	Input(su);
	Sort(su);
	Print(su);
	return 0;
}

3.选择排序和冒泡排序法(一般选择排序法比冒泡排序法效率高)

#include<stdio.h>
//选择排序法比冒泡排序法效率高
void selectSort(int a[])//选择排序
{
	int i = 0, nMin = 0;
	while (i<9)
	{
		nMin = i;
		int j = i + 1;
		while (j<10)
		{
			if (a[j] < a[nMin])
				nMin = j;
			++j;
		}
		if (nMin != i)
		{
			int t = a[nMin];
			a[nMin] = a[i];
			a[i] = t;
		}

		++i;
	}

}
void Sort(int a[])//冒泡排序
{

	int i = 0;
	while (i<9)
	{
		int j = 0;
		while (j<10-i-1)
		{
			
			if (a[j]<a[j+1])
			{
				int t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
			}
			++j;
		}
		++i;
	}

}
int main()
{
	int a[10] = {10,2,6,8,9,14,11,19,18,10};
	puts("排序前：");
	for (size_t i = 0; i < sizeof(a) / sizeof(a[0]); i++)
	{
		printf("%d ",a[i]);
	}
	printf("\n");
	selectSort(a);
	puts("选择排序后");
	for (size_t i = 0; i < sizeof(a) / sizeof(a[0]); i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	Sort(a);
	puts("冒泡排序后");
	for (size_t i = 0; i < sizeof(a)/sizeof(a[0]); i++)
	{
		printf("%d ", a[i]);
	}
	return 0;
}