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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Subscribe to see which companies asked this question.
看题花了一些时间,原来这几个结点合在一起算一个十进制的数。然后还有一点他没有说,应该是这list的节点数是一样的吧。。难度是中等,感觉有点坑。
不过自己把指针忘得差不多了,正好复习了一下。
贴代码:
/**
* 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 head(0);
ListNode *p = &head;
int sum = 0;
while(l1 || l2 ||sum){
if(l1 != 0){
sum += l1->val;
}
if(l2 != 0){
sum += l2->val;
}
p->next = new ListNode(sum % 10);
p = p->next;
sum /= 10;
if(l1){
l1 = l1->next;
}
if(l2){
l2 = l2->next;
}
}
return head.next;
}
};
注意的一点是 while里面要加一个sum的判断,第一次没加然后有当 5 5 的时候报错了,进1的时候没有算下一位。其他的也没啥了。就是/10看是否进一,进一的话直接加到sum上就不用另外的变量了。下一轮直接把sum加上就好。%10得到的是当前位的值。