2. 两数相加

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* lc = new ListNode(0);
        ListNode* l3 = lc;
        int flag = 0, sum;
        while(l1 != NULL || l2 != NULL){
            sum = 0;
            if(l1 != NULL){
                sum += l1->val;
                l1 = l1->next;
            }
            if(l2 != NULL){
                sum += l2->val;
                l2 = l2->next;
            }
            lc->next = new ListNode((sum+flag) % 10);
            lc = lc->next;
            flag = (sum+flag)/10;
        }
        if(flag)
            lc->next = new ListNode(1);
        return l3->next;
    }
};

67. 二进制求和

class Solution {
public:
    string addBinary(string a, string b) {
        int na = a.size(), nb = b.size();
        char carry = '0';
        while(na > nb){
            b = '0'+b;
            nb++;
        }
        while(nb > na){
            a = '0'+a;
            na++;
        }
        for(int i = na-1; i >= 0; i--){
            a[i] = a[i] + (b[i]-'0') + (carry-'0');
            if(a[i] >= '2'){
                carry = '1';
                a[i] = a[i] - ('2'-'0');
            }
            else carry = '0';
        }
        if(carry == '1')
            a = '1'+a;
        return a;
    }
};

415. 字符串相加

class Solution {
public:
    string addStrings(string num1, string num2) {
        int na = num1.size(), nb = num2.size(), sum = 0;
        char carry = '0';
        while(na < nb){
            num1 = '0'+num1;
            na++;
        }
        while(nb < na){
            num2 = '0'+num2;
            nb++;
        }
        for(int i = na-1; i >= 0; i--){
            sum = (num1[i]-'0')+(num2[i]-'0')+(carry-'0');
            if(sum >= 10)
                carry = '1';
            else
                carry = '0';
            num1[i] = '0'+(sum%10);
        }
        if(carry == '1')
            num1 = '1' + num1;
        return num1;
    }
};

445. 两数相加 II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* l3 = new ListNode(0);
        stack<int> stc1, stc2;
        int a, b, sum, carry = 0;
        while(l1 != NULL){
            stc1.push(l1->val);
            l1 = l1->next;
        }
        while(l2 != NULL){
            stc2.push(l2->val);
            l2 = l2->next;
        }
        while(!stc1.empty()||!stc2.empty()||carry){
            a = stc1.empty() ? 0 : stc1.top();
            b = stc2.empty() ? 0 : stc2.top();
            if(!stc1.empty()) stc1.pop();
            if(!stc2.empty()) stc2.pop();
            sum = a + b + carry;
            carry = sum / 10;
            ListNode* p = new ListNode(sum%10);
            ListNode* q = l3->next;
            l3->next = p;
            p->next = q;
        }
            
        return l3->next;
    }
};

989. 数组形式的整数加法

class Solution {
public:
    vector<int> addToArrayForm(vector<int>& A, int K) {
        vector<int> res;
        int i = A.size()-1, carry = 0, a, b, sum;
        while(K || i >= 0 || carry){
            a = K % 10;
            b = i >= 0 ? A[i--] : 0;
            sum = a + b + carry;
            res.push_back(sum%10);
            K = K / 10;
            carry = sum >= 10 ? 1 : 0;
        }
        reverse(res.begin(), res.end());
        return res;
    }
};