leetcode[165]:Compare Version Numbers

Compare Version Numbers

Compare two version numbers version1 and version2.

If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.

You may assume that the version strings are non-empty and contain only digits and the . character.

The . character does not represent a decimal point and is used to separate number sequences.

For instance, 2.5 is not “two and a half” or “half way to version three”, it is the fifth second-level revision of the second first-level revision.

Here is an example of version numbers ordering:

0.1 < 1.1 < 1.2 < 13.37

int compareVersion(char* version1, char* version2) {
int i,j,k,l;
int f1[10000]={0},f2[10000]={0};
i=j=k=l=0;
while(version1[i]!='\0')
{
while(version1[i]!='.')
{
f1[k]=f1[k]*10+version1[i++]-'0';
if(version1[i]=='\0') break;
}
if(version1[i]=='\0') break;
k++;
i++;
}
i=0;
while(version2[i]!='\0')
{
while(version2[i]!='.')
{
f2[l]=f2[l]*10+version2[i++]-'0';
if(version2[i]=='\0') break;
}
if(version2[i]=='\0') break;
l++;
i++;
}
l++;
k++;
for(i=0;i<k && i<l;i++)
{
if(f1[i]<f2[i]) return -1;
if(f1[i]>f2[i]) return 1;
}
for(;i<k;i++)
{
if(f1[i]!=0)  return 1;
}
for(;i<l;i++)
{
if(f2[i]!=0)  return -1;
}

return 0;
}

开大数组，逐一比较，考虑不等长。