LeetCode-2 Add Two Numbers

LeetCode-2 Add Two Numbers

JAVA:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode first = new ListNode(0);
		ListNode sum = first;
		ListNode beforeend = sum;

		while (l1 != null && l2 != null) {
			sum.val += l1.val + l2.val;
			sum.next = new ListNode(sum.val / 10);
			sum.val %= 10;
			beforeend = sum;
			sum = sum.next;
			l1 = l1.next;
			l2 = l2.next;
		}
		if (l1 == null) {
			while (l2 != null) {
				if (sum.val == 0) {//后续没有进位时,将后续的与sum接上后返回即可
					sum.val = l2.val;
					sum.next = l2.next;
					return first;
				}
				sum.val += l2.val;
				sum.next = new ListNode(sum.val / 10);
				beforeend = sum;
				sum.val %= 10;
				sum = sum.next;
				l2 = l2.next;
			}
		} else {
			while (l1 != null) {
				if (sum.val == 0) {
					sum.val = l1.val;
					sum.next = l1.next;
					return first;
				}
				sum.val += l1.val;
				sum.next = new ListNode(sum.val / 10);
				beforeend = sum;
				sum.val %= 10;
				sum = sum.next;
				l1 = l1.next;
			}
		}
		if (beforeend.next != null && beforeend.next.val == 0)
			beforeend.next = null;
		return first;
    }
}

Run time:424 ms

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值