首页 > 其他 > 详细

LeetCode-Add Two Numbers

时间:2015-05-29 18:15:36      阅读:238      评论:0      收藏:0      [点我收藏+]

Add Two Numbers

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) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
            ListNode *newNode = new ListNode(0);
            ListNode *resultNode = newNode;
            int carry = 0;

            while(l1!=NULL||l2!=NULL){
                int v = 0;
                if(l1!=NULL){
                    v = l1->val;
                    l1 = l1->next;
                }
                if(l2!=NULL){
                    v +=l2->val;
                    l2 = l2->next;
                }
                resultNode->next = new ListNode((v+carry)%10);
                carry = (v+carry)/10;
                resultNode = resultNode->next;
            }
            if(carry>0){
                resultNode->next = new ListNode(1);
            }

            return newNode->next;
        }
};

LeetCode-Add Two Numbers

原文:http://blog.csdn.net/mennoa/article/details/46237179

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!