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.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
//20 ms 9.1M
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
int plus = 0;
struct ListNode* result = (struct ListNode*)malloc(sizeof(struct ListNode));
struct ListNode* ptr = result;
struct ListNode* pre = NULL;
while (l1 != NULL || l2 != NULL)
{
int a = 0;
int b = 0;
int num = 0;
if(l1 != NULL)
a = l1->val;
if(s2 != NULL)
b = l2->val;
num = a + b + plus;
plus = 0;
if(num >=10)
{
num=num%10;
plus = 1;
}
ptr->val = num;
struct ListNode *temp = (struct ListNode *)malloc(sizeof(struct ListNode));
temp->next = NULL;
ptr->next = temp;
pre = ptr;
ptr = ptr->next;
if (l1 && l1->next)
l1 = l1->next;
else
l1 = NULL;
if (l2 && l2->next)
l2 = l2->next;
else
l2 = NULL;
}
if (plus)
{
ptr->val = plus;
ptr->next = NULL;
}
else
pre->next = NULL;
return result;
}
第一次思考的方法,每个链表计算得到整数,相加后,在计算每个数,然后插入链表int
//该思路还未完成
power(int num, int e)
{
int i=0;
int sum = 1;
if (e == 0)
return 1;
while(i < e)
{
sum=sum*num;
i++;
}
return sum;
}
int list_to_int(struct ListNode* L)
{
struct ListNode* l1;
l1 = L;
int e=0;
int num = 0;
while (l1 != NULL)
{
num += l1->val * power(10,e);
l1=l1->next;
e++;
}
return num;
}