LeetCode-Compare Version Numbers解题报告

最新推荐文章于 2023-04-06 09:36:17 发布

dinglin0xff

最新推荐文章于 2023-04-06 09:36:17 发布

阅读量340

点赞数

分类专栏： leetcode 文章标签： C++

本文链接：https://blog.csdn.net/dd523762588/article/details/46777693

版权

leetcode 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

原题链接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

字符串处理而已没什么难度

class Solution {
public:
    int compareVersion(string version1, string version2) {
		int p1 = 0, p2 = 0, i1, i2;
		while (p1 < version1.length() || p2 < version2.length())
		{
			i1 = sti(version1, p1);
			i2 = sti(version2, p2);
			if (i1 > i2)return 1;
			else if (i1 < i2)return -1;
			continue;
		}
		return 0;

	}
	int sti(string& s, int& pos)
	{
		int res = 0;
		while (pos < s.length() && s[pos] != '.')
		{
			res = res * 10 + (s[pos] - '0');
			pos++;
		}
		pos++;
		return res;
	}
};