返回介绍

solution / 0100-0199 / 0165.Compare Version Numbers / README_EN

发布于 2024-06-17 01:04:03 字数 6697 浏览 0 评论 0 收藏 0

165. Compare Version Numbers

中文文档

Description

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.
    

     

    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.

    Solutions

    Solution 1

    class Solution:
      def compareVersion(self, version1: str, version2: str) -> int:
        m, n = len(version1), len(version2)
        i = j = 0
        while i < m or j < n:
          a = b = 0
          while i < m and version1[i] != '.':
            a = a * 10 + int(version1[i])
            i += 1
          while j < n and version2[j] != '.':
            b = b * 10 + int(version2[j])
            j += 1
          if a != b:
            return -1 if a < b else 1
          i, j = i + 1, j + 1
        return 0
    
    class Solution {
      public int compareVersion(String version1, String version2) {
        int m = version1.length(), n = version2.length();
        for (int i = 0, j = 0; i < m || j < n; ++i, ++j) {
          int a = 0, b = 0;
          while (i < m && version1.charAt(i) != '.') {
            a = a * 10 + (version1.charAt(i++) - '0');
          }
          while (j < n && version2.charAt(j) != '.') {
            b = b * 10 + (version2.charAt(j++) - '0');
          }
          if (a != b) {
            return a < b ? -1 : 1;
          }
        }
        return 0;
      }
    }
    
    class Solution {
    public:
      int compareVersion(string version1, string version2) {
        int m = version1.size(), n = version2.size();
        for (int i = 0, j = 0; i < m || j < n; ++i, ++j) {
          int a = 0, b = 0;
          while (i < m && version1[i] != '.') {
            a = a * 10 + (version1[i++] - '0');
          }
          while (j < n && version2[j] != '.') {
            b = b * 10 + (version2[j++] - '0');
          }
          if (a != b) {
            return a < b ? -1 : 1;
          }
        }
        return 0;
      }
    };
    
    func compareVersion(version1 string, version2 string) int {
      m, n := len(version1), len(version2)
      for i, j := 0, 0; i < m || j < n; i, j = i+1, j+1 {
        var a, b int
        for i < m && version1[i] != '.' {
          a = a*10 + int(version1[i]-'0')
          i++
        }
        for j < n && version2[j] != '.' {
          b = b*10 + int(version2[j]-'0')
          j++
        }
        if a < b {
          return -1
        }
        if a > b {
          return 1
        }
      }
      return 0
    }
    
    function compareVersion(version1: string, version2: string): number {
      let v1 = version1.split('.'),
        v2 = version2.split('.');
      for (let i = 0; i < Math.max(v1.length, v2.length); i++) {
        let c1 = Number(v1[i] || 0),
          c2 = Number(v2[i] || 0);
        if (c1 > c2) return 1;
        if (c1 < c2) return -1;
      }
      return 0;
    }
    
    public class Solution {
      public int CompareVersion(string version1, string version2) {
        int m = version1.Length, n = version2.Length;
        for (int i = 0, j = 0; i < m || j < n; ++i, ++j) {
          int a = 0, b = 0;
          while (i < m && version1[i] != '.') {
            a = a * 10 + (version1[i++] - '0');
          }
          while (j < n && version2[j] != '.') {
            b = b * 10 + (version2[j++] - '0');
          }
          if (a != b) {
            return a < b ? -1 : 1;
          }
        }
        return 0;
      }
    }
    

    如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

    扫码二维码加入Web技术交流群

    发布评论

    需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。
    列表为空,暂无数据
      我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
      原文