【C++】【LeetCode】【指针】2. Add Two Numbers

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.

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

Subscribe to see which companies asked this question.

解法:

关于指针和链表

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* tmp = new ListNode(0);
        ListNode* head = tmp;
        
        while(l1!=NULL || l2!=NULL || carry!=0) {
            int sum = (l1?l1->val:0) + (l2?l2->val:0)+carry;
            carry = sum/10;
            tmp->next = new ListNode(sum%10);
            l2 = l2 ? l2->next:l2;
            l1 = l1 ? l1->next:l1;
            tmp = tmp->next;
        }
        
        return head->next;
    }
};