2. Add Two Numbers

最新推荐文章于 2024-09-07 18:44:11 发布

Line290

最新推荐文章于 2024-09-07 18:44:11 发布

阅读量222

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/Line290/article/details/75331094

版权

leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

/**
 * 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) {
        int carry = 0;
        int temp;
        ListNode* p = l1;
        ListNode* p_pre = l1;
        ListNode* q = l2;
        ListNode* q_pre = l2;
        while(p != NULL && q != NULL) {
            temp = p->val + q->val + carry;
            carry = temp / 10;
            p->val = temp - carry * 10;
            p_pre = p;
            q_pre = q;
            p = p->next;
            q = q->next;
        }
        if(p == NULL && q != NULL){
            p_pre->next = q;
            while(q != NULL) {
                temp = q->val + carry;
                carry = temp / 10;
                q->val = temp - 10 * carry;
                q_pre = q;
                q = q->next;
            }
            if(carry == 1){
                ListNode* node = new ListNode(1);
                node->val = 1;
                q_pre->next = node;
            }
        }
        else if(p != NULL && q == NULL){
            while(p != NULL) {
                temp = p->val + carry;
                carry = temp / 10;
                p->val = temp - 10 * carry;
                p_pre = p;
                p = p->next;
            }
            if(carry == 1){
                ListNode* node = new ListNode(1);
                node->val = 1;
                p_pre->next = node;
            }
        }
        else{
            if(carry == 1){
                ListNode* node = new ListNode(1);
                node->val = 1;
                p_pre->next = node;
            }
        }
        return l1;
    }
};

简单一点的

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode dummyHead = new ListNode(0);
    ListNode p = l1, q = l2, curr = dummyHead;
    int carry = 0;
    while (p != null || q != null) {
        int x = (p != null) ? p.val : 0;
        int y = (q != null) ? q.val : 0;
        int sum = carry + x + y;
        carry = sum / 10;
        curr.next = new ListNode(sum % 10);
        curr = curr.next;
        if (p != null) p = p.next;
        if (q != null) q = q.next;
    }
    if (carry > 0) {
        curr.next = new ListNode(carry);
    }
    return dummyHead.next;
}
}