본문 바로가기
Computer Science/알고리즘

leetcode 165) Compare Version Numbers

by eeeun:) 2022. 2. 25.
반응형

LV. Medium 🧐

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

 

Compare Version Numbers - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

 

문제

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.

 

문제 해결법

.앞의 수를 unsigned long long으로 변환하여 version1, version2 값을 비교해주었다.

 

해결 코드
class Solution {
public:
	int compareVersion(string version1, string version2) {
		int idx1 = 0;
		int idx2 = 0;
		int size1 = version1.size();
		int size2 = version2.size();
		unsigned long long v1 = 0;
		unsigned long long v2 = 0;

		while (idx1 < size1 || idx2 < size2) {
			while (idx1 < size1 && version1[idx1] != '.')
				v1 = v1 * 10 + version1[idx1++] - '0';
			cout << v1 << endl;
			while (idx2 < size2 && version2[idx2] != '.')
				v2 = v2 * 10 + version2[idx2++] - '0';
			cout << v2 << endl;
			if (v1 > v2)
				return 1;
			else if (v1 < v2)
				return -1;
			v1 = 0;
			v2 = 0;
			idx1++;
			idx2++;
		}
		return 0;
	}
};

 

 

728x90

'Computer Science > 알고리즘' 카테고리의 다른 글

leetcode 338) Counting Bits  (0) 2022.03.01
leetcode 228) Summary Ranges  (0) 2022.02.28
leetcode 148) Sort List  (0) 2022.02.24
leetcode 133) Clone Graph  (0) 2022.02.23
leetcode 171) Excel Sheet Column Number  (0) 2022.02.22

댓글