leetcode #165 in cpp

xiaolienahu

于 2016-07-01 11:23:29 发布

阅读量328

点赞数

CC 4.0 BY-SA版权

分类专栏： interview 文章标签： cpp leetcode

本文链接：https://blog.youkuaiyun.com/xiaolienahu/article/details/51799874

interview 专栏收录该内容

135 篇文章

订阅专栏

本文介绍了一种用于比较软件版本号的算法实现。通过解析版本号字符串，并逐位比较各部分数字大小来确定版本间的先后顺序。该算法适用于由数字和点组成的版本号格式。

摘要生成于 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

Code:

class Solution {
public:
    int compareVersion(string version1, string version2) {
        int i1 = 0 ;
        int i2 = 0;
        int sum1= 0;
        int sum2 = 0; 
        while(i1<version1.length() || i2 < version2.length()){
            sum1 = 0;
            sum2 = 0;
            while(i1<version1.length() && version1[i1] != '.'){
                sum1 = sum1*10+version1[i1] - '0'; 
                i1++; 
            }
            while(i2<version2.length() && version2[i2] != '.'){
                sum2 = sum2*10+version2[i2] - '0'; 
                i2++; 
            }
            if(sum1 > sum2) return 1; 
            if(sum1 < sum2) return -1; 
            i1++; 
            i2++; 
        }
        return 0; 
    }
};