Leetcode - Add Two Numbers

最新推荐文章于 2019-12-21 15:18:30 发布

free2o

最新推荐文章于 2019-12-21 15:18:30 发布

阅读量1k

点赞数

分类专栏：算法和数据结构学习

本文链接：https://blog.csdn.net/free2o/article/details/51737546

版权

算法和数据结构学习专栏收录该内容

31 篇文章 1 订阅

订阅专栏

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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

ListNode * addTwoNumbers(ListNode* l1, ListNode* l2) {
        int t = 0, c = 0;
        ListNode *header = NULL;
        ListNode **ptmp = &header;
        
        for(; (l1 != nullptr) || (l2 != nullptr) ; 
            l1 = (l1 == nullptr ? nullptr : l1->next) ,
            l2 = (l2 == nullptr ? nullptr : l2->next) )  {
                t = (l1 == nullptr ? 0 : l1->val) + (l2 == nullptr ? 0 : l2->val ) + c;
                c = t / 10;  t %= 10;
                *ptmp = new ListNode(t) ;
                ptmp = &(*ptmp)->next ;
            }
            while( c > 0 ) { *ptmp = new ListNode( c % 10) ; c/=10;  ptmp = &(*ptmp)->next ;}
            
            return header;
    }