# Compare Version Numbers

33人阅读 评论(0)

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

class Solution {
public:
int compareVersion(string version1, string version2) {

int vercnt1=0;
int vercnt2=0;
vector<int>verint1;
vector<int>verint2;
int tmp;
string temp;
int left=0;
int right=0;
while(1)
{
right=version1.find_first_of('.',left);
if(string::npos==right)
{
right=version1.length();

temp=version1.substr(left,right-left);
tmp=atoi(const_cast<const char *>(temp.c_str()));
verint1.push_back(tmp);

break;
}
temp=version1.substr(left,right-left);
tmp=atoi(const_cast<const char *>(temp.c_str()));
verint1.push_back(tmp);
left=right+1;
}

left=0;
while(1)
{
right=version2.find_first_of('.',left);
if(string::npos==right)
{
right=version2.length();

temp=version2.substr(left,right-left);
tmp=atoi(const_cast<const char *>(temp.c_str()));
verint2.push_back(tmp);

break;
}
temp=version2.substr(left,right-left);
tmp=atoi(const_cast<const char *>(temp.c_str()));
verint2.push_back(tmp);
left=right+1;
}

int verlength=verint1.size()<verint2.size()?verint1.size():verint2.size();
for(int i=0; i<verlength; i++)
{

if(verint1[i]>verint2[i])
{
return 1;
}
else if(verint1[i]<verint2[i])
{
return -1;
}
else
{
continue;
}
}
if(verint1.size()==verint2.size())
{
return 0;
}
else if(verint1.size()>verint2.size())
{
for(int i=verlength; i<verint1.size(); i++)
{
if(verint1[i]!=0)
{
return 1;
}
}
return 0;
}
else
{
for(int i=verlength; i<verint2.size(); i++)
{
if(verint2[i]!=0)
{
return -1;
}
}
return 0;
}

}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：12129次
• 积分：1923
• 等级：
• 排名：千里之外
• 原创：186篇
• 转载：11篇
• 译文：0篇
• 评论：0条
评论排行