LeetCode——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

/**
 * @author moming
 * @since  JDK1.7
 */
class Solution {
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		if (l1 == null)
			return l2;
		if (l2 == null)
			return l1;

		//ret: 结果存于l1中
		//prel:用于有进位时创建新node
		ListNode ret = l1;
		ListNode prel = new ListNode(0);
		prel.next = l1;

		
		int flag = 0;
		while (l1 != null && l2 != null) {
			l1.val = l1.val + l2.val + flag;
			flag = l1.val / 10;
			l1.val = l1.val % 10;
			prel = l1;
			l1 = l1.next;
			l2 = l2.next;
		}

		if (l2 != null) {			
			l1 = l2;
			prel.next = l1;
		}
		
		while (l1 != null) {
			l1.val += flag;
			flag = l1.val / 10;
			l1.val %= 10;
			prel = l1;
			l1 = l1.next;
		}
		
		if(flag == 1){
			ListNode node = new ListNode(1);
			prel.next = node;
		}

		return ret;
	}
}





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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值