LeetCode | 165. Compare Version Numbers

这是一个关于比较两个版本号的算法实现,代码使用C++编写。算法首先定义了一个`firstNum`函数来提取版本号的第一个数字,然后在`compareVersion`函数中通过比较每个版本号的修订来确定它们的相对大小。如果第一个版本号小于第二个则返回-1,如果大于则返回1,相等则返回0。示例包括了不同情况的版本号比较。

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

 

题目:

Given two version numbers, version1 and version2, compare them.

Version numbers consist of one or more revisions joined by a dot '.'. Each revision consists of digits and may contain leading zeros. Every revision contains at least one character. Revisions are 0-indexed from left to right, with the leftmost revision being revision 0, the next revision being revision 1, and so on. For example 2.5.33 and 0.1 are valid version numbers.

To compare version numbers, compare their revisions in left-to-right order. Revisions are compared using their integer value ignoring any leading zeros. This means that revisions 1 and 001 are considered equal. If a version number does not specify a revision at an index, then treat the revision as 0. For example, version 1.0 is less than version 1.1 because their revision 0s are the same, but their revision 1s are 0 and 1 respectively, and 0 < 1.

Return the following:

  • If version1 < version2, return -1.
  • If version1 > version2, return 1.
  • Otherwise, return 0.

 

Example 1:

Input: version1 = "1.01", version2 = "1.001"
Output: 0
Explanation: Ignoring leading zeroes, both "01" and "001" represent the same integer "1".

Example 2:

Input: version1 = "1.0", version2 = "1.0.0"
Output: 0
Explanation: version1 does not specify revision 2, which means it is treated as "0".

Example 3:

Input: version1 = "0.1", version2 = "1.1"
Output: -1
Explanation: version1's revision 0 is "0", while version2's revision 0 is "1". 0 < 1, so version1 < version2.

Example 4:

Input: version1 = "1.0.1", version2 = "1"
Output: 1

Example 5:

Input: version1 = "7.5.2.4", version2 = "7.5.3"
Output: -1

 

Constraints:

  • 1 <= version1.length, version2.length <= 500
  • version1 and version2 only contain digits and '.'.
  • version1 and version2 are valid version numbers.
  • All the given revisions in version1 and version2 can be stored in a 32-bit integer.

 

代码:

class Solution {
public:
    int firstNum(string& version) {
        int len = version.length();
        if(len < 1)
            return 0;
        int num = 0, i;
        for(i = 0; i<len && version[i] != '.'; i++)
        {
            num *= 10;
            num += version[i] - '0';
        }
        if(i < len - 1)
            version = version.substr(i+1);
        else
            version = "";
        return num;
    }
    int compareVersion(string version1, string version2) {
        int num1, num2;
        while(version1 != "" || version2 != "" )
        {
            num1 = firstNum(version1);
            num2 = firstNum(version2);
            if(num1 < num2)
                return -1;
            if(num1 > num2)
                return 1;
        }
        
        return 0;
    }
};

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值