LeetCode #2 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

 

分析

    根据代码提交结果，两个参与运算的链表的长度并不一定相同，所以在代码编写是要考虑到某一条链表l1遍历完时另一条链表l2依然有数据，此时可以认为l1的next指针指向一个val为0的节点，将其与l2相加即可，实现起来还是挺简单的。

 

代码

/**
 * 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) 
    {
        ListNode *head = new ListNode(0);
		ListNode *result = head;
		int carry = 0;
		while (l1 != NULL && l2 != NULL)
		{
			int temp = l1->val + l2->val + carry;
			head->val = temp % 10;
			carry = temp / 10;
			if (l1->next == NULL && l2->next != NULL)
			{
				l1->next =  new ListNode(0);
			}
			else if (l2->next == NULL && l1->next != NULL)
			{
				l2->next = new ListNode(0);
			}
			else if (l2->next == NULL && l1->next == NULL)
			{
				break;
			}
			l1 = l1->next;
			l2 = l2->next;

			ListNode *temp1 = new ListNode(0);
			head->next = temp1;
			head = head->next;
		}

		if (carry)
		{
			ListNode *zero = new ListNode(0);
			zero->val = carry;
			head->next = zero;
		}
		else
			head = NULL;

		return result;
    }
};

 

转载于:https://my.oschina.net/yangkunxing/blog/876469