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
思路:本题就是比较两个版本号的大小,首先将两个string类型的数据对齐了,整数位前面添0,小数部分后面添0,然后从最高位开始循环比较就行
代码如下(已通过leetcode)
public class Solution {
public int compareVersion(String version1, String version2) {
if(version1.equals("") && version2.equals("")) return 0;
String sub1, sub2;
int v1s, v2s;
if(version1.equals("")) {
v1s = 0;
sub1 = "";
}
else {
int id1 = version1.indexOf(".");
if(id1==-1) {
v1s = Integer.parseInt(version1);
sub1 = "";
}
else {
v1s = Integer.parseInt(version1.substring(0, id1));
sub1 = version1.substring(id1+1);
}
}
if(version2.equals("")) {
v2s = 0;
sub2 = "";
}
else {
int id2 = version2.indexOf(".");
if(id2==-1) {
v2s = Integer.parseInt(version2);
sub2 = "";
}
else {
v2s = Integer.parseInt(version2.substring(0, id2));
sub2 = version2.substring(id2+1);
}
}
if(v1s>v2s) return 1;
if(v1s<v2s) return -1;
return compareVersion(sub1, sub2);
}
}