zoukankan      html  css  js  c++  java
  • 2. 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)
    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;
    }
  • 相关阅读:
    vim cheat
    latex base
    latex font
    lstings
    使用React 如何设计 模板自定义的框架
    react hooks 的更进一步适应性使用
    IDEA反编译jar包源码
    Redis Lua实战
    Spring AOP拦截并打印controller层请求日志
    漏桶算法和令牌桶算法的区别
  • 原文地址:https://www.cnblogs.com/qionglouyuyu/p/5270096.html
Copyright © 2011-2022 走看看