AddTwoNumbers

LeetCode 2 Add Two Numbers

题目链接:https://leetcode.com/problems/add-two-numbers/description/

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.

大意:将两个单链表求和,注意进位问题;

 public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
            ListNode helper=new ListNode(0);
            ListNode pre =helper;
            int flag=0;   //表示进位大小
            while(l1!=null||l2!=null){
                int val1=0,val2=0;
                if(l1!=null){
                    val1=l1.val;
                    l1=l1.next;
                }
                if(l2!=null){
                    val2=l2.val;
                    l2=l2.next;
                }
                int temp=val1+val2+flag;
                pre.next=new ListNode(temp%10);
                flag=temp/10;
                pre=pre.next;
            }
            if(flag>0)
                pre.next=new ListNode(flag);
            return helper.next;
      }
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值