leetcode 刷题 2. Add Two Numbers

2. Add Two Numbers

• You are given two non-empty linked lists representing two non-negative integers. 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.

• You may assume the two numbers do not contain any leading zero, except the number 0 itself.

• Example:
  Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
  Output: 7 -> 0 -> 8
  Explanation: 342 + 465 = 807.

代码

/**
 * 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* head = new ListNode(0);
    ListNode* cur = head;
    int flag = 0;
    while(l1 || l2 || flag){
        int x = l1 ? l1->val : 0;
        int y = l2 ? l2->val : 0;
        
        ListNode* node = new ListNode((x + y + flag) % 10);
        cur->next = node;
        cur = node;
        
        flag = (x+y+flag)/10;
        
        if(l1) l1 = l1->next;
        if(l2) l2 = l2->next;
    }
    
    return head->next;
   }
};