LeetCode 学习记录 2.Add Two Numbers

1 题目要求：

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.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

2 解决方法

从高到低依次相加

ListNode * addTwoNumbers(ListNode* l1, ListNode* l2) {
	ListNode result(0), *p = &result;
	int carrier = 0;
	while (l1 || l2 || carrier) {
		int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carrier;
		carrier = sum / 10;
		p->next = new ListNode(sum % 10);
		p = p->next;
		l1 = l1 ? l1->next : l1;
		l2 = l2 ? l2->next : l2;
	}
	return result.next;
}

时间复杂度O(n)

空间复杂度O(1)

更快的算法

#include <bits/stdc++.h>
static int __initialSetup = [](){
	std::ios::sync_with_stdio(false);
	cin.tie(NULL);
	return 0;
}
();
class Solution {
    public:
     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *rst = NULL;
        ListNode *end = NULL;
        ListNode *cur = NULL;
        int carry = 0;
        while(carry !=0 || l1 != NULL || l2 != NULL)
        {
            int val1 = 0;
            int val2 = 0;
            if(l1!=NULL)
            {
                val1 = l1->val;
                l1 = l1->next;
            }
            if(l2 != NULL)
            {
                val2 = l2->val;
                l2 = l2->next;
            }
            
            int total = carry + val1 + val2;
            carry = total/10;
            total = total %10;
            
            cur = new ListNode(total);
            if(rst == NULL)
            {
                rst = cur;
                end = cur;
            }
            else
            {
                end->next = cur;
                end = cur;
            }
        }
        return rst;
    }
};

cin，cout效率低，是因为先把要输出的东西存入缓冲区，再输出，导致效率降低，而std::ios::sync_with_stdio(false)语句可以来打消iostream的输入 输出缓存，可以节省许多时间。