Compare Version Numbers

最新推荐文章于 2024-08-02 16:45:34 发布

cgdong2014

最新推荐文章于 2024-08-02 16:45:34 发布

阅读量239

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode String

本文链接：https://blog.youkuaiyun.com/cgdong2014/article/details/47019459

LeetCode 同时被 2 个专栏收录

139 篇文章

订阅专栏

String

2 篇文章

订阅专栏

本文介绍了一种用于比较两个版本号大小的方法。通过逐段解析版本号字符串并将其转换为数值进行对比，实现了精确的版本号排序功能。适用于软件版本管理和更新检查等场景。

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

Credits:

Special thanks to @ts for adding this problem and creating all test cases.

思路：每次在‘.’之前的树转化成十进制的比较。

public class Solution {
	  public int compareVersion(String version1, String version2) {
	       int i = 0, j = 0;
	       
	       while(i < version1.length() || j < version2.length()){
	    	   int a = 0, b = 0;
	    	   while(i < version1.length() && version1.charAt(i) != '.'){   //判越界的要放在前面 否则放在后面容易报抛出异常 比如输入1,0时
	    		   a = a * 10 + (version1.charAt(i) - '0');    //注意减去'0'转换为数字
	    		   i++;
	    	   }

	    	   while(j < version2.length() && version2.charAt(j) != '.'){
	    		   b = b * 10 + (version2.charAt(j) - '0');
	    		   j++;
	    	   }
	 
	    	   i++;
	    	   j++;
	    	  
	    	   if(a > b) return 1;
	    	   if(a < b) return -1;
	       }
	       return 0;
	    }
}