2. Add Two Numbers

最新推荐文章于 2024-01-03 15:29:28 发布

weixin_30653023

最新推荐文章于 2024-01-03 15:29:28 发布

阅读量56

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/qionglouyuyu/p/5270096.html

本文介绍了一种算法问题的解决方案：两个非负整数由链表逆序存储，如何将这两个数相加并返回一个新的链表。通过遍历链表节点进行逐位相加，并考虑进位操作。

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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode* head = malloc(sizeof(struct ListNode));
    struct ListNode* current = head;
    int carry = 0;
    while(l1 && l2){
        current->next = malloc(sizeof(struct ListNode));
        current = current->next;
        current->val = l1->val + l2->val + carry;
        carry = current->val /10;
        current->val = (current->val)%10;
        l1 = l1->next;
        l2 = l2->next;
    }
    while(l1){
        current->next = malloc(sizeof(struct ListNode));
        current = current->next;
        current->val = l1->val + carry;
        carry = current->val /10;
        current->val = (current->val)%10;
        l1 = l1->next;
    }
    while(l2){
        current->next = malloc(sizeof(struct ListNode));
        current = current->next;
        current->val = l2->val + carry;
        carry = current->val /10;
        current->val = (current->val)%10;
        l2 = l2->next;
    }
    if(carry){
        current->next = malloc(sizeof(struct ListNode));
        current = current->next;
        current->val = carry;
    }
    current->next=NULL;
    return head->next;
}