[LeetCode] Add Two Numbers

 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

本题主要是要考虑和大于9的情况,要将十位和个位分开

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int one=0;
		int two=0;
		int sum=0;
        sum=l1->val+l2->val+two;
		one=sum%10;
		two=sum/10;
		ListNode *result=new ListNode(one);
		l1=l1->next;
		l2=l2->next;
		ListNode *current=result;
        while(l1!=NULL||l2!=NULL)
        {
            if(l1==NULL)
            {
                sum=l2->val+two;
				l2=l2->next;
            }
            else if(l2==NULL)
            {
                sum=l1->val+two;
                l1=l1->next;
            }
            else 
            {            
				sum=l1->val+l2->val+two;
				l1=l1->next;
				l2=l2->next;
            }
			one=sum%10;
			two=sum/10;
            ListNode  *temp=new ListNode(one);
            current->next=temp;
            current=temp;
        }
		if(two!=0)
		{
			ListNode  *temp=new ListNode(two);
            current->next=temp;
		}
        return result;
       
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值