Add Two Numbers(两个数相加)
【难度:Medium】
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
给定两个链表,每个链表代表一个整数的每个位上的数字,存储的顺序相反,求两个链表相加得到的新链表。
解题思路
高精度算法的链表形式,同时遍历两个链表,对应位置的数字相加,考虑进位,为结果新建一个链表节点即可。
c++代码如下:
/**
* 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* first = l1;
ListNode* second = l2;
ListNode* head = new ListNode(0);
ListNode* cur = head;
int carry = 0;
while (first || second || carry) {
int sum = (first ?first->val:0)+(second?second->val:0)+carry;
carry = sum / 10;
cur->next = new ListNode(sum%10);
cur = cur->next;
if (first)
first = first->next;
if (second)
second = second->next;
}
return head->next;
}
};