Add Two Numbers
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)
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
主要是单链表的操作.
代码:
/*
*两个判断精简代码以后在两个数组或者两个链表可以使用
*/
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)
{
if(l1 == NULL) return l2;//如果有一条链是空的直接返回另一条链
if(l2 == NULL) return l1;
ListNode *l3;
ListNode *list;
int carryBit = 0, flag = 1;
while(l1 || l2)
{
int temp = carryBit;
if(l1)//两个判断可以精简代码
{
temp += l1->val;
l1 = l1->next;
}
if(l2)
{
temp += l2->val;
l2 = l2->next;
}
carryBit = temp / 10;
ListNode *q = new ListNode(temp % 10);//需要动态分配内存否则会出错.
if(flag)//如果是第一个结点
{
l3 = list = q;//l3用来指向头结点, list用来循环操作.
flag = 0;
}
else
{
list->next = q;
list = list->next;
}
}
if(carryBit)//两条链都空了,但还是有进位.
{
ListNode *q = new ListNode(carryBit);
list->next = q;
carryBit = 0;
}
return l3;
}