Leetcode Week9

来源：互联网发布：前端wap 淘宝页面模板编辑：程序博客网时间：2024/06/06 07:42

/*
9.列表式数字的相加 add two number
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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

/*    /**     * 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;        ListNode* tail = new ListNode(0);        ListNode* ptr = tail;                while(l1 != NULL || l2 != NULL){            int val1=0;            if(l1 != NULL){                val1 = l1->val;                l1 = l1->next;            }            int val2=0;            if(l2 != NULL){                val2 = l2->val;                l2 = l2->next;            }                        int temp = val1 + val2 +carry;            ptr->next = new ListNode(temp % 10);            carry = temp / 10;            ptr = ptr->next;        }        if(carry == 1){            ptr->next = new ListNode(1);        }        return tail->next;    }};*/

0 0