版本号对比C++实现

今天网上面试,对方要求我写一个版本号对比程序发过去,要求不能用系统的对比函数,并考虑各种情况。我简单思考总结了一下思路,例如版本号为 11.22.33.1a,将其分段并转换为整数,那么一个版本可变为一个整数数组,再按字典序比较这个数组就行了。下面是代码:

#include <string>
#include <stdio>
typedef struct
{
	int n;
	int* pinfo;
}versioninfo;
int chartoint(const char str)
{
	char strcmp[] = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
	for(int i=0;i<62;i++)
	{
		if (str == strcmp[i])
			return i > 35 ? i - 26 : i;
	}
	return -1;
}
int stringtoint(const char* str)
{
	const char* ptemp1 = str;
	for (; *ptemp1 != '\0'; ++ptemp1);
	int n = ptemp1 - str;
	if (n <= 0)
		return -1;
	int res = 0;
	for (ptemp1 = str; *ptemp1 != '\0'; ++ptemp1)
		res += pow(36,--n) * chartoint(*ptemp1);
	return res;
}
versioninfo versioncal(const char* str)
{
	const char* ptemp1 = str;
	const char* ptemp2 = str;
	int n = 0;
	while (*ptemp2 != '\0')
	{
		for (ptemp1= ptemp2; chartoint(*ptemp1) < 0; ++ptemp1);
		for (ptemp2 = ptemp1; chartoint(*ptemp2) >= 0; ++ptemp2);

		++n;
	}
	int* pint = nullptr;
	if (n > 0)
		pint = (int*)malloc(sizeof(int)*n);
	n = 0;
	ptemp1 = str;
	ptemp2 = str;
	while (*ptemp2 != '\0')
	{
		for (ptemp1 = ptemp2; chartoint(*ptemp1) < 0; ++ptemp1);
		for (ptemp2 = ptemp1; chartoint(*ptemp2) >= 0; ++ptemp2);
		int len = ptemp2 - ptemp1;
		char* ptemp3 = (char*)malloc(sizeof(char)*(len + 1));
		for (int i = 0; i < len; i++)
			ptemp3[i] = ptemp1[i];
		ptemp3[len] = '\0';
		pint[n++] = stringtoint(ptemp3);
		free(ptemp3);
	}
	return { n,pint };
}
int versioncmp(const char* str1, const char* str2)
{
	versioninfo cal1 = versioncal(str1);
	versioninfo cal2 = versioncal(str2);
	if (cal1.n != cal2.n)
		return -1;
	int num = cal1.n;
	for (int i = 0; i < num; i++)
	{
		if (cal1.pinfo[i] > cal2.pinfo[i])
		{
			free(cal1.pinfo);
			free(cal2.pinfo);
			return 0;
		}
		else if (cal1.pinfo[i] < cal2.pinfo[i])
		{
			free(cal1.pinfo);
			free(cal2.pinfo);
			return 1;
		}
		else
			continue;
	}
	free(cal1.pinfo);
	free(cal2.pinfo);
	return 2;
}
int main()
{
	const char* str1 = "51 .11.12A";
	const char* str2 = "111. 91 .12a";
	int res = versioncmp(str1, str2);
	switch (res)
	{
	case -1:
		std::cout << "格式不同,无法比较" << std::endl;
		break;
	case 0:
		std::cout << "版本1较新" << std::endl;
		break;
	case 1:
		std::cout << "版本2较新" << std::endl;
		break;
	case 2:
		std::cout << "版本相同" << std::endl;
		break;
	}
    return 0;
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
#include int main (void) { int year,month,j,i,day1,day2,one1,one2,w; printf("enter a year:"); scanf("%d",&year); printf("\n\n"); printf("---------------------%d---------------------\n\n",year); one1=((year-1)*365+(year-1)/4-(year-1)/100+(year-1)/400+1)%7; for(month=1;month<=12;month+=2) { printf(" ",month,year); printf(" \n",month+1,year); printf("-------------------- --------------------\n"); printf("日 一 二 三 四 五 六 日 一 二 三 四 五 六\n"); switch(month) { case 1: case 3: case 5: case 7: case 8: case 10: case 12: day1=31;break; case 4: case 6: case 9: case 11:day1=30;break; default:if(!(year%4)&&(year0)||!(year%400)) day1=29; else day1=28; } for(j=1;j<=one1;j++) { if(one1==7) break; else printf(" "); } for(i=1;i<=7-one1;i++) printf("%2d ",i); printf(" "); switch(month+1) { case 1: case 3: case 5: case 7: case 8: case 10: case 12: day2=31;break; case 4: case 6: case 9: case 11:day2=30;break; default:if(!(year%4)&&(year0)||!(year%400)) day2=29; else day2=28; } one2=(one1+day1)%7; for(j=1;j<=one2;j++) { if(one2==7) break; if(j!=7) printf(" "); } for(i=1;i<=7-one2;i++) printf("%2d ",i); printf("\n"); for(i=8-one1;i<=14-one1;i++) printf("%2d ",i); printf(" "); for(i=8-one2;i<=14-one2;i++) printf("%2d ",i); printf("\n"); for(i=15-one1;i<=21-one1;i++) printf("%2d ",i); printf(" "); for(i=15-one2;i<=21-one2;i++) printf("%2d ",i); printf("\n"); for(i=22-one1;i<=28-one1;i++) printf("%2d ",i); printf(" "); for(i=22-one2;i<=28-one2;i++) printf("%2d ",i); printf("\n"); for(i=29-one1;i<=35-one1&&i<=day1;i++) printf("%2d ",i); printf(" "); for(w=1;w<=35-day1-one1;w++) printf(" "); for(i=29-one2;i<=35-one2&&i<=day2;i++) printf("%2d ",i); printf("\n"); for(i=36-one1;i<=day1;i++) printf("%2d ",i); for(w=1;w<=35-day1-one1;w++) printf(" "); if(day1==31&&(one1==4||one1==3||one1==2||one1==1||one1==7)) printf(" "); if(day1==30&&(one1==4||one1==3||one1==2||one1==1||one1==7)) printf(" "); for(i=36-one2;i<=day2;i++) printf("%2d ",i); printf("\n-------------------- --------------------\n\n"); printf("\n"); one1=(one2+day2)%7; } printf("---------------------%d---------------------\n",year); getchar(); printf("按任意键退出"); getchar(); return 0; }

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值