2.两数相加:link
1.题目分析
1.题目中很重要的一点是数是逆序存储的那么链表的头部就是数的个位,遍历链表和正常多位数的加法是一致的。
2.示例代码
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* dummy = new ListNode(0);
ListNode* cur1 = l1, *cur2 = l2, *cur = dummy;
int over = 0;
while(cur1 || cur2 || over){
int val1 = cur1 ? cur1->val : 0;
int val2 = cur2 ? cur2->val : 0;
int val = val1 + val2 + over;
cur->next = new ListNode(val % 10);
over = val / 10;
cur1 = cur1 ? cur1->next : NULL;
cur2 = cur2 ? cur2->next : NULL;
cur = cur->next;
}
return dummy->next;
}
};