-
Notifications
You must be signed in to change notification settings - Fork 3
/
640.cpp
51 lines (49 loc) · 1.55 KB
/
640.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
class Solution {
public:
pair<int, int> parser(string half) {
if (half[0] != '-') half = "+" + half;
int index = 0;
int n = half.size();
int xParam = 0;
int constParam = 0;
while (index < n) {
int flag = 1;
if (half[index] == '-') flag = -1;
index++;
int start = index;
while (index + 1 < n && half[index + 1] != '+' && half[index + 1] != '-') {
index++;
}
string temp = half.substr(start, index - start + 1);
int m = temp.size();
if (temp[m - 1] == 'x') {
if (m == 1) xParam += flag * 1;
else {
int param = stoi(temp.substr(0, m - 1));
xParam += flag * param;
}
}
else {
int param = stoi(temp);
constParam += flag * param;
}
index++;
}
return {xParam, constParam};
}
string solveEquation(string equation) {
string token;
stringstream ss(equation);
vector<pair<int, int>> v;
while (getline(ss, token, '=')) {
v.push_back(parser(token));
}
if (v[0].first == v[1].first) {
if (v[0].second != v[1].second) return "No solution";
else return "Infinite solutions";
}
int xNum = v[0].first - v[1].first;
int yNum = v[1].second - v[0].second;
return "x=" + to_string(yNum / xNum);
}
};