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