LeetCode-Add Two Numbers

2. Add Two Numbers

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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

链表的结构为:

package leetcode;

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

实现代码如下:

package leetcode;

/*2017-3-2
 * lk
 * 功能:链表,实现两个数的相加
 * 例如:9237 + 869
 * Input:链表为 * 7->3->2->9,9->->6->8
 * Output:输出链表为6->0->1->1->0->1
 * */
public class AddTwoNums {
	public static void main(String[] args){
		//ListNode ll = new ListNode(0);
		//ll.next = null;
		AddTwoNums add = new AddTwoNums();
		ListNode l1 = new ListNode(6);
		ListNode l2 = new ListNode(8);
		l1.next = null;
		l2.next = null;
		
		ListNode ll= add.addTwoNumbers(l1,l2);
		System.out.println(ll.val);
		System.out.println(ll.next.val);
	}
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode ret = l1;
		ListNode pre = new ListNode(0);//用于最后结果的进位
		pre.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;
			pre = l1;
			l1 = l1.next;
			l2 = l2.next;
		}
		if(l2 != null){
			pre.next = l2;
			l1 = l2;
		}
		while(l1 != null){
			l1.val = l1.val + flag;
			flag = l1.val/10 ;
			l1.val = l1.val%10;
			pre = l1;
			l1 = l1.next;
		}
		if(flag > 0){
			ListNode node = new ListNode(1);
			pre.next = node;
		}
		return ret;
	}
}


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值