这题还是比较有难度的。题目的意思是两个链表相加得到一个新的链表,链表的长度可能不相等,将每个相应结点的值存储在一个链表上,当该值大于10时,将该值进位到结果链表的下一个结点上,要注意的几点是最后的值可能会超出 l1 和 l2的长度,也要注意如何处理 l1 和 l2的长度不相等的情况。
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.
代码为,需要注意的是对于指针类型的一定要new或者malloc一下,这里用malloc总是报错,用new ListNode也会报错(可能是结构体中ListNode(int x)所决定的),而当指向已经分配过空间的指针则不需要malloc , 如 ListNode* p = pHead:
/**
* 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) {
int value = 0;
ListNode* pHead = new ListNode(0);//因为结构体中ListNode(int x)的写法
ListNode* pre = pHead;
while(l1 || l2)
{
if(l1)
{
value += l1->val;
l1 = l1->next;
}
if(l2)
{
value += l2->val;
l2 = l2->next;
}
ListNode* node = new ListNode(0);
node->val = value % 10;
value /= 10;
pre->next = node;
pre = node;
}
if(value > 0)
{
ListNode* node = new ListNode(0);
node->val = value; //加法进位最多为1
pre->next = node;
//pre = node;
}
return pHead->next;
}
};