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.
Output: 7 -> 0 -> 8


Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
     
 		
		ListNode head1 = l1;
		ListNode head2 = l2;
		ListNode l3 = new ListNode(0);
		ListNode head3 = l3;
		int ad = 0;
		
		while(head1 != null || head2 != null){
			int a = 0;
			if(head1 != null){
				a = head1.val;
				head1 = head1.next;
			}
			int b = 0;
			if(head2 != null){
				b = head2.val;
				head2 = head2.next;
			}
			a = a + b + ad;
			head3.next = new ListNode(a%10);
			head3 = head3.next;
			ad = a / 10;
		}
		if(ad == 1){
			head3.next = new ListNode(1);
		}
		return l3.next;
	//	return l1;

    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值