LeetCode 2. Add Two Numbers 解题报告

2. Add Two Numbers

My Submissions
Total Accepted: 120829  Total Submissions: 544194  Difficulty: Medium

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

Subscribe to see which companies asked this question

Show Tags
Show Similar Problems
Have you met this question in a real interview? 
Yes
 
No

Discuss


    以链表的形式存储两个十进制数,计算两数和。需要运用后插法构建结果的链表。

    我的AC代码如下

public class AddTwoNumbers {

	public static void main(String[] args) {
		addTwoNumbers(new ListNode(5), new ListNode(5));
	}

	public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		if (l1 == null)
			return l2;
		if (l2 == null)
			return l1;

		ListNode head = new ListNode(0);
		ListNode pre = head;
		int carry = 0;
		while (l1 != null || l2 != null || carry != 0) {
			int sum = 0;
			if (l1 != null) {
				sum += l1.val;
				l1 = l1.next;
			}
			if (l2 != null) {
				sum += l2.val;
				l2 = l2.next;
			}
			sum += carry;
			carry = sum / 10;

			ListNode cur = new ListNode(sum % 10);
			pre.next = cur;
			pre = cur;
		}
		return head.next;
	}
}

class ListNode {

	int			val;
	ListNode	next;

	ListNode(int x) {
		val = x;
	}
}


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值