2. Add Two Numbers
文章目录
题目
You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
解析
题目大意:将两条链表的对应值都加起来
本题主要考察对于链表的掌握与熟练程度,需要注意
- 当l1与l2长度相等,尾部结点之和大于10时,需要新建一个结点
- 当l1与l2长度不等时,后面的链表部分即为l1或l2
代码
- 时间复杂度O(n²)
- 空间复杂度O(1)
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
ListNode preHead(0), *p = &preHead;
int extra = 0;
while (l1 || l2 || extra) {
int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + extra;
extra = sum / 10;
p->next = new ListNode(sum % 10);
p = p->next;
l1 = l1 ? l1->next : l1;
l2 = l2 ? l2->next : l2;
}
return preHead.next;
}

评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论