Compare Version Numbers

最新推荐文章于 2022-02-25 21:50:14 发布

Paul_ZJ

最新推荐文章于 2022-02-25 21:50:14 发布

阅读量708

点赞数

分类专栏： LeetCode——坚持每天一题

本文链接：https://blog.csdn.net/shuitawuhen/article/details/41960231

版权

LeetCode——坚持每天一题专栏收录该内容

176 篇文章 0 订阅

订阅专栏

Compare Version Numbers

Compare two version numbers version1 and version1.
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.

Java代码：

public class Solution {
    public int compareVersion(String version1, String version2) {
        String[] ver1 = version1.split("\\.");	//需要转义
		String[] ver2 = version2.split("\\.");
		int len = ver1.length;
		if (len > ver2.length)
			len = ver2.length;

		for (int i = 0; i < len; i++) {
			int k = Integer.parseInt(ver1[i]);
			int j = Integer.parseInt(ver2[i]);
			if (k > j)
				return 1;
			else if (k < j)
				return -1;
			else {
				;
			}
		}
		if (ver1.length == ver2.length) {
			return 0;
		} else if (ver1.length > ver2.length) {
			for (int i = len; i < ver1.length; i++) {
				int k = Integer.parseInt(ver1[i]);
				if (0 != k)
					return 1;
			}
			return 0;
		} else {
			for (int i = len; i < ver2.length; i++) {
				int j = Integer.parseInt(ver2[i]);
				if (0 != j)
					return -1;
			}
			return 0;
		}

    }
}