2 Add Two Numbers
题目大意就说给了两个链表,每个链表代表一个数,链表中的数字是倒序排列的,相加这两个数把结果再以链表返回。
例子: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 *result = NULL;
ListNode *temp = NULL;
int flag = 0;
while ((l1 != NULL) || (l2 != NULL))
{
int tmp;
if (l2 == NULL)
{
tmp = l1->val + flag;
flag = 0;
l1 = l1->next;
}
else if (l1 == NULL)
{
tmp = l2->val + flag;
flag = 0;
l2 = l2->next;
}
else
{
tmp = l1->val + l2->val + flag;
flag = 0;
l1 = l1->next;
l2 = l2->next;
}
if (tmp >= 10)
{
tmp = tmp - 10;
flag = 1;
}
if (result == NULL)
{
result = new ListNode(tmp);
temp = result;
}
else
{
temp->next = new ListNode(tmp);
temp = temp->next;
}
}
if (flag == 1)
{
temp->next = new ListNode(1);
temp = temp->next;
}
return result;
}
};