Compare Version Numbers

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

码农少年

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

阅读量240

点赞数

CC 4.0 BY-SA版权

分类专栏： c++ LeetCode之旅

本文链接：https://blog.youkuaiyun.com/wangbao2111/article/details/50245819

LeetCode之旅同时被 2 个专栏收录

65 篇文章

订阅专栏

c++

29 篇文章

订阅专栏

本文介绍了一种用于比较软件版本号的算法实现。通过将版本号字符串以'.'分割并转换为整数，逐位进行比较，可以判断出两个版本号之间的大小关系。此方法适用于非空且仅包含数字和'.'字符的版本号字符串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

把字符串以'.'分割，把分割后字符串转化成整型，逐位比较即可。

class Solution {
public:
    int compareVersion(string version1, string version2) {
        int val1;
        int val2;
        int index1 = 0;
        int index2 = 0;
        while(index1<version1.length() || index2<version2.length()){
            val1 = 0;
            while(index1<version1.length()){
                if(version1[index1] == '.'){
                    index1++;
                    break;
                }else{
                    val1 = val1*10 + (version1[index1] - '0');
                    index1++;
                }
            }
            
            val2 = 0;
            while(index2<version2.length()){
                if(version2[index2] == '.'){
                    index2++;
                    break;
                }else{
                    val2 = val2*10 + (version2[index2] - '0');
                    index2++;
                }
            }
            
            if(val1 < val2){
                return -1;
            }
            if(val1 > val2){
                return 1;
            }
        }
        return 0;
    }
};