-
Notifications
You must be signed in to change notification settings - Fork 9
/
Compare Version Numbers.cpp
95 lines (72 loc) · 2.49 KB
/
Compare Version Numbers.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
// PROBLEM :- https://leetcode.com/problems/compare-version-numbers/
// LEETCODE | MEDIUM | STRINGS
// Solution :- T.C. O(N + M) S.C. O(N + M)
// Extract corresponding parts, convert each to integers, and check which side is bigger.
// If no side is bigger, repeat for all other parts.
// Note :- If a string ends, all corresponding parts for other parts is equal to 0.
// Side Note :- Beware of implementation based edge cases.
class Solution {
public:
int compareVersion(string version1, string version2) {
int itr1 = 0;
int itr2 = 0;
int n = version1.length();
int m = version2.length();
while(itr1 < n && itr2 < m){
string cur1 = "0";
while(itr1 < n && version1[itr1] != '.'){
cur1 += version1[itr1];
itr1++;
}
string cur2 = "0";
while(itr2 < m && version2[itr2] != '.'){
cur2 += version2[itr2];
itr2++;
}
if(itr1 < n && version1[itr1] == '.')
itr1++;
if(itr2 < m && version2[itr2] == '.')
itr2++;
int rev1 = stoi(cur1);
int rev2 = stoi(cur2);
if(rev1 > rev2){
return 1;
}else if(rev1 < rev2){
return -1;
}
}
if(itr1 == n && itr2 == m)
return 0;
else if(itr1 == n){
while(itr2 < m){
string cur2 = "0";
while(itr2 < m && version2[itr2] != '.'){
cur2 += version2[itr2];
itr2++;
}
if(itr2 < m && version2[itr2] == '.')
itr2++;
int rev2 = stoi(cur2);
if(rev2 > 0){
return -1;
}
}
return 0;
}else{
while(itr1 < n){
string cur1 = "0";
while(itr1 < n && version1[itr1] != '.'){
cur1 += version1[itr1];
itr1++;
}
if(itr1 < n && version1[itr1] == '.')
itr1++;
int rev1 = stoi(cur1);
if(rev1 > 0){
return 1;
}
}
return 0;
}
}
};