题目:
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
题意:
比较两个给定的版本号version1、version2,如果version1>version2则返回1,version1<version2则返回-1,其他情况返回0;
可以假定给定的版本号字符串是非空的,而且字符串中只包含“.”字符,“.”字符不是数学意义上的小数点,而只是用来分隔数字序列。
思路一:
将给定的版本号字符串根据“.”号分隔成数字字符串数组,之后从开始到最后依次对应比较版本数字,没有的部分以0字符补充。
代码:Java版:3ms
public class Solution { public int compareVersion(String version1, String version2) { String[] levels1 = version1.split("\\."); String[] levels2 = version2.split("\\."); int length = Math.max(levels1.length, levels2.length); for (int i=0; i<length; i++) { Integer v1 = i<levels1.length ? Integer.parseInt(levels1[i]) : 0; Integer v2 = i<levels2.length ? Integer.parseInt(levels2[i]) : 0; int compare = v1.compareTo(v2); if (compare != 0) { return compare; } } return 0; } }
思路二:
逐个取出version1与version2中每段数字字符,并转换为数字,之后依次比较每段数字大小。
代码:C++版:2ms
class Solution { public: int compareVersion(string version1, string version2) { int i = 0; int j = 0; int n1 = version1.size(); int n2 = version2.size(); int num1 = 0; int num2 = 0; while (i<n1 || j<n2) { while (i<n1 && version1[i]!='.') { //取出version1中最开始的版本号数字 num1 = num1*10 + (version1[i] - '0'); i++; } while (j<n2 && version2[j]!='.') { //取出version2中最开始的版本号数字 num2 = num2*10 + (version2[j] - '0'); j++; } if (num1>num2) return 1; //比较两者数字的大小 else if (num1<num2) return -1; num1 = 0; num2 = 0; i++; j++; } return 0; } };转换一下写法运行时间提高2ms
代码:C++版:0ms
class Solution { public: int compareVersion(string version1, string version2) { int i = 0, j = 0; int n1 = 0, n2 = 0; while (i<version1.size() || j<version2.size()) { while (i<version1.size() && version1[i]!='.') { n1 = n1*10 + (version1[i++] - '0'); } i++; while (j<version2.size() && version2[j]!='.') { n2 = n2*10 + (version2[j++] - '0'); } j++; if(n1 > n2) { return 1; } else if (n1 < n2) { return -1; } else { n1 = 0; n2 = 0; } } return 0; } };