void Printf_A(int br[3][4], int row, int col)
{ // (*br)[4] 第一位可以缺省,第二位i,一定不可以缺,如果缺了,br+1的能力就没有了
int size = sizeof(br); //一维数组,二维数组,作为函数的参数,都会在编译的时候退化为指针
printf(“%d\n”, size);//占4个字节
}
- 旋转打印二维数组:
- 利用二分查找在二维数组中找到val
一维数组 【以空间换时间】
define MONTHERROR -1
#define YEARERROR -2
#define DAYERROR -3
bool Leap_Year(int year)
{
bool res = false;
if ((year % 100 != 0 && year % 4 == 0) || year % 400 == 0)
{
res = true;
}
return res;
}
int Get_YM_Day(int year, int month)
{
//空间换时间 static 让其生存期变长,在数据区,const 让其不可修改,能力变小。
//查表法
static const int days[] = { 29,31,28,31,30,31,30,31,31,30,31,30,31 };
if (month == 2 && Leap_Year(year))
{
month = 0;
}
return days[month];
}
int Get_YMD_Total(int year, int month, int day)
{
int sum = 0;
// int da = 0;
//查表法:static const int sum[] = {0, 0 , 31,59,90,120,151,181,212,243,273,304,334,365};
// 0 1 2 3 4 5 6 7 8 9 10 11 12 13
//总天数都是当前的数字加上输入的天数。
if (year < 1) return YEARERROR;
if (month < 1 || month>12) return MONTHERROR;
if (day<1 || day>Get_YM_Day(year, month)) return DAYERROR;
/* if (month>2&& Leap_Year(year,month))
{ //如果月份大于2 ,那么才判断是否是闰年,如果小于2就没必要了
da =1;
*/ }
for (int i = 0; i < month; i++)
{
sum = sum + Get_YM_Day(year, i);
}
return sum + day;
// return sum + day + da ;
}
int main()
{
int year = 0, month = 0, day = 0;
scanf_s("%d/%d/%d", &year, &month, &day);
int n = Get_YMD_Total(year, month, day);
printf("%d/%d/%d=>total: %d\n", year, month, day, n);
// 越界和输入错误判断
switch (n)
{
case YEARERROR:
printf("year input error %d\n", year);
break;
case MONTHERROR:
printf("month input error %d\n",month);
break;
case DAYERROR:
printf("day input error %d\n", day);
break;
default:
printf("%d year %d month %d day\n", year,month,day);
break;
}
return 0;
}