原题
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
分析
先说说自己的理解,由于它给的示例加上之前做驱动什么主设备号次设备号的经验,默认了它的版本号最多1个点,也就是有可能"1.1"
或者"1"
,提交之后才发现可能版本可能有很多级。
尝试着自己写一个找"."
的函数+substr
解决,发现很麻烦,看了discuss
恍然大悟,
原来还有string流(#include <sstream>
)这个办法对字符串进行分割。
class Solution {
public:
int compareVersion(string version1, string version2) {
stringstream v1(version1);
stringstream v2(version2);
while(true)
{
int n1;
int n2;
string word1;
string word2;
getline(v1,word1,'.');
if(word1.empty())
n1=0;
else
n1=std::stoi(word1);
getline(v2,word2,'.');
if(word2.empty())
n2=0;
else
n2=std::stoi(word2);
if(word1.empty()&&word2.empty())
return 0;
if(n1>n2)
return 1;
if(n2>n1)
return -1;
}
}
};