002_两数相加

题目

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

代码

//
// Created by HINTS on 2019/1/17.
//
#include <iostream>
using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
    ListNode *res = new ListNode(-1);
    ListNode *cur = res;
    int carry = 0;
    while(l1 || l2){
        int n1 = l1?l1->val:0;
        int n2 = l2?l2->val:0;
        int sum = n1 + n2 + carry;
        carry = sum/10;
        cur->next = new ListNode(sum%10);
        cur = cur->next;
        if(l1)
            l1 = l1->next;
        if(l2)
            l2 = l2->next;
    }
    if(carry)
        cur->next = new ListNode(1);
    return res->next;
}

int main(){
    ListNode* l1 = new ListNode(2);
    l1->next = new ListNode(4);
    l1->next->next = new ListNode(3);

    ListNode* l2 = new ListNode(5);
    l2->next = new ListNode(6);
    l2->next->next = new ListNode(4);

    ListNode *res = addTwoNumbers(l1,l2);
    while(res){
        cout << res->val <<endl;
        res = res->next;
    }

    return 0;
}