leetcode 2. 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

342 + 465 = 807.链表模拟加法.

考虑进位.


public class A2AddTwoNumbers {

	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		int sum,x,y;
		ListNode l3 = new ListNode(0);
		ListNode first = l3;
		// 进位
		int c = 0;
		while(l1 != null || l2 != null) {
			x = y = 0;
			if(l1 != null) {
				x = l1.val;
				l1 = l1.next;
			}
			if(l2 != null) {
				y = l2.val;
				l2 = l2.next;
			}
			sum = x + y + c;
			l3.next = new ListNode(sum % 10);
			l3 = l3.next;
			c = sum / 10;
		}
		if(c != 0) {
			l3.next = new ListNode(c);
		}
		return first.next;
	}
}

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


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值