|
|
- class Solution {
- public:
- int comp(string& s1, string& s2) {
- int n1 = -1, n2 = -1;
- for (int i = 0, n = s1.size(); i < n; i++) {
- if (isdigit(s1.at(i))) {
- int j = i;
- while (i < n and isdigit(s1.at(i))) {
- i++;
- }
- n1 = stoi(s1.substr(j, i - j));
- break;
- }
- }
- for (int i = 0, n = s2.size(); i < n; i++) {
- if (isdigit(s2.at(i))) {
- int j = i;
- while (i < n and isdigit(s2.at(i))) {
- i++;
- }
- n2 = stoi(s2.substr(j, i - j));
- break;
- }
- }
- if (n1 < 0 or n2 < 0) {
- return s1 < s2 ? -1 : s1 == s2 ? 0 : 1;
- }
- return n1 < n2 ? -1 : n1 == n2 ? 0 : 1;
- }
- };
- int main(void) {
- Solution solution;
- string s1, s2;
- bool result, answer;
- s1 = "a10b";
- s2 = "a2b";
- answer = -1;
- result = solution.comp(s1, s2);
- assert(result == answer);
-
- s1 = "foo";
- s2 = "abc1000";
- answer = -1;
- result = solution.comp(s1, s2);
- assert(result == answer);
- s1 = "a10b";
- s2 = "a2b";
- answer = -1;
- result = solution.comp(s1, s2);
- assert(result == answer);
-
- s1 = "foo1000";
- s2 = "abc1000";
- answer = 0;
- result = solution.comp(s1, s2);
- assert(result == answer);
- s1 = "1foo10000";
- s2 = "abc1000";
- answer = -1;
- result = solution.comp(s1, s2);
- assert(result == answer);
- cout << "\nPassed All\n";
- return 0;
- }
复制代码
补充内容 (2017-4-11 10:40):
对吗? |
|