LeetCode-165.Compare Version Numbers

https://leetcode.com/problems/compare-version-numbers/

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

int compareVersion(string version1, string version2)
    {
        int i = 0,j=0, num1=0, num2=0;
    	int n1 = version1.size(),n2 = version2.size();
    	while (i<n1 || j<n2)
    	{
    		while (i<n1 && version1[i] != '.')
    			num1 = num1 * 10 + (version1[i++] - '0');
    		while (j<n2 && version2[j] != '.')
    			num2 = num2 * 10 + (version2[j++] - '0');
    
    		if (num1>num2) return 1;
    		else if (num1 < num2) return -1;
    
    		num1 = num2 = 0;
    		i++;
    		j++;
    	}
    	return 0;
    }


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值