码迷,mamicode.com
首页 > 其他好文 > 详细

Add Two Numbers

时间:2014-10-23 22:15:45      阅读:130      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   http   color   io   os   ar   for   

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

思路:

sum=(s1+s2+carry)%10;
carry=(s1+s2+carry)/10;

由以上关系即可得到code;

code:

bubuko.com,布布扣
/**
 * 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(-1);
        int carry=0;
        ListNode *cur=&head;
        
        for(ListNode *p1=l1,*p2=l2;p1!=NULL||p2!=NULL;
            p1=p1==NULL ? NULL:p1->next,p2=p2==NULL ? NULL:p2->next,
            cur=cur->next)
        {
            const int s1=p1==NULL ? 0:p1->val;
            const int s2=p2==NULL ? 0:p2->val;
            const int sum=(s1+s2+carry)%10;
            carry=(s1+s2+carry)/10;
            cur->next=new ListNode(sum);
        }
        
        if(carry>0)
            cur->next=new ListNode(carry);
        
        return head.next;
    }
};
View Code

 

Add Two Numbers

标签:des   style   blog   http   color   io   os   ar   for   

原文地址:http://www.cnblogs.com/chengyuz/p/4037300.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!