LeetCode_Archiver/LeetCode/cpp/415.cpp at master · chr1sc2y/LeetCode_Archiver · GitHub

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
class Solution {
public:
    string addStrings(string num1, string num2) {
        int m = num1.size(), n = num2.size();
        string longer, shorter;
        if (m >= n) {
            longer = num1;
            shorter = num2;
        } else {
            longer = num2;
            shorter = num1;
            swap(m, n);
        }
        int carry = 0, i = 1;
        while (i <= n) {
            int sum = longer[m - i] - '0' + shorter[n - i] - '0' + carry;
            carry = sum / 10;
            sum %= 10;
            longer[m - i] = sum + '0';
            ++i;
        }
        while (carry) {
            if (m - i < 0) {
                longer.insert(longer.begin(), '1');
                break;
            }
            int sum = longer[m - i] - '0' + carry;
            carry = sum / 10;
            sum %= 10;
            longer[m - i] = sum + '0';
            ++i;
        }
        return longer;
    }
};