leetcode2 两数相加

题目链接：https://leetcode-cn.com/problems/add-two-numbers/submissions/
总结：

• 题目中未说明数字的范围，默认是字符串
• 字符串模拟加法需要考虑进位之后的变化

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        string num1 = i2s(l1), num2 = i2s(l2);
        //cout << num1 << " " << num2 << endl;
        string ans = stringAdd(num1, num2);
        //cout << ans << endl;
        return s2l(ans);

    }

    string i2s(ListNode* l) {
        string res;
        res.clear();
        while(l != NULL) {
            res += (l->val + '0');
            l = l->next;
        }
        //reverse(res.begin(), res.end());
        return res;
    }

    string stringAdd(string num1, string num2) {
        string res(100000, '0');
        int len = 0;
        int i = 0, len1 = num1.length(), len2 = num2.length();
        while(i < len1 && i < len2) {
            int sum = (num1[i] - '0') + (num2[i] - '0') + (res[i] - '0');
            int x = sum % 10;
            int xx = sum / 10;
            res[i] = x + '0';
            len = i;
            if(xx != 0) {
                res[i + 1] = (res[i + 1] - '0' + xx) + '0';
                len = i + 1;
            }
            i++;
        }
        while(i < len1) {
            int sum = res[i] + num1[i] - 2 * '0';
            if(sum < 10) {
                res[i] = res[i] + num1[i] - '0';
                len = max(len, i);
            } else {
                res[i] = (sum % 10) + '0';
                res[i + 1] = (sum / 10) + '0';
                len = max(len, i + 1);
            }
            i++;
        }
        while(i < len2) {
            int sum = res[i] + num2[i] - 2 * '0';
            if(sum < 10) {
                res[i] = res[i] + num2[i] - '0';
                len = max(len, i);
            } else {
                res[i] = (sum % 10) + '0';
                res[i + 1] = (sum / 10) + '0';
                len = max(len, i + 1);
            }
            i++;
        }
        //cout << res.substr(0, len + 1) << endl;
        return res.substr(0, len + 1);
    }

    ListNode* s2l(string num) {
        ListNode* res;
        ListNode* head;
        int len = num.length();
        for(int i = 0; i < len; i++) {

            if(i == 0) {
                res = new ListNode(num[i] - '0');
                head = res;
            } else {
                res->next = new ListNode(num[i] - '0');
                res = res->next;
            }
        }

//        while(head != NULL) {
//            cout << head->val << " ";
//            head = head->next;
//        }
//        cout << endl;
        return head;
    }

};