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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
用两个非空链表,表示两个数,链表的中每个节点都是一个0-9的个位数,链表从左向右依次为个位 十位 百位。。大于等于10,向下一位进1。
/**
* 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* l = new ListNode(0);//建一个新链表,保存结果
ListNode* ll = l;//记录该链表首地址
int val;//记录链表加法的结果
while(l1 != NULL || l2 != NULL )//不为NULL时进行循环
{
val = l->val+l1->val+l2->val;//记录该位的值
l->val = val%10;//将个位数赋值给l->val
if(val > 9) l->next = new ListNode(val/10);//如果有进位,保存到l->next->val
else if(l1->next == NULL && l2->next == NULL) break;//如果都没有进位,看next是否都为NULL,是,就退出大循环
else l->next = new ListNode(0);如果不为NULL,建立l->next初值为0;
l = l->next;//l指向下一个节点
if(l1->next != NULL) l1 = l1->next;//下一个节点不为NULL,则指向下一个节点
else l1->val = 0;//,否则设置该节点值为0
if(l2->next != NULL) l2 = l2->next;
else l2->val = 0;
}
return ll;
}
};