首页 > 代码库 > Add Two Numbers
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
代码：
class Solution {public: ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) { if(l1 == NULL) return l2; if(l2 == NULL) return l1; ListNode * dummy = new ListNode(-1); int carry = 0; ListNode *p = dummy; for(; l1 || l2; p = p->next){ int opr1 = l1?l1->val:0; int opr2 = l2?l2->val:0; int sum = (opr1 + opr2 + carry)%10; carry = (opr1 + opr2 + carry)/10; //take advantage of existing list node p->next = l1?l1:l2; p->next->val = sum; l1 = l1?l1->next:NULL; l2 = l2?l2->next:NULL; } if(carry != 0){ p->next = new ListNode(carry); } return dummy->next; }};
Add Two Numbers
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。