Leetcode 165. Compare Version Numbers (Easy) (cpp)

287 篇文章 0 订阅
34 篇文章 0 订阅

Leetcode 165. Compare Version Numbers (Easy) (cpp)

Tag: String

Difficulty: Easy


/*

165. Compare Version Numbers (Easy)

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) {
		vector<int> ver1 = split(version1, '.');
		vector<int> ver2 = split(version2, '.');
		int size_min = min(ver1.size(), ver2.size()), index = 0;
		for (index; index < size_min; index++) {
			if (ver1[index] > ver2[index])
				return 1;
			if (ver1[index] < ver2[index])
				return -1;
		}
		if (ver1.size() > ver2.size()) {
			while(!ver1[index] && index < ver1.size())
				index++;
			if (index < ver1.size())
				return 1;
		}
		if (ver1.size() < ver2.size()) {
			while(!ver2[index] && index < ver2.size())
				index++;
			if (index < ver2.size())
				return -1;
		}
		return 0;
	}
	vector<int> split(string s, char sign) {
		vector<int> res;
		stringstream str(s);
		string item;
		while(getline(str, item, sign)) {
			res.push_back(atoi(item.c_str()));
		}
		return res;
	}
};


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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值