165. Compare Version Numbers

最新推荐文章于 2024-03-16 21:23:02 发布

chuandalishuo

最新推荐文章于 2024-03-16 21:23:02 发布

阅读量172

点赞数

分类专栏： Leetcode 字符串基础序列操作文章标签： Leetcode string

本文链接：https://blog.csdn.net/chuandalishuo/article/details/52607271

版权

Leetcode 同时被 3 个专栏收录

73 篇文章 0 订阅

订阅专栏

字符串

7 篇文章 0 订阅

订阅专栏

基础序列操作

4 篇文章 0 订阅

订阅专栏

题目：

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.

0.1 < 1.1 < 1.2 < 13.37

思路：考虑1.0.0 ＝＝ 1的情况

java

public class Solution {
    public int compareVersion(String version1, String version2) {
        String[] v1 = version1.split("\\.");
        String[] v2 = version2.split("\\.");
        String [] longer = v1.length>v2.length?v1:v2;
        String [] shorter = v1.length>v2.length?v2:v1;
        for(int i=0; i<shorter.length; i++){
            if(Integer.valueOf(v1[i])>Integer.valueOf(v2[i]))
                return 1;
            else if(Integer.valueOf(v1[i])<Integer.valueOf(v2[i]))
                return -1;
        }
        int sum=0;
        for(int i=shorter.length; i<longer.length; i++)
            sum+=Integer.valueOf(longer[i]);
        if (sum==0)
            return 0;
        else return v1.length>v2.length? 1:-1;
    }
}