LeetCode 2.两数相加

给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。

如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例：

输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出：7 -> 0 -> 8
原因：342 + 465 = 807

1.

package test;

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

	public static void main(String[] args) {
		test12 t = new test12();
		ListNode l1 = new ListNode(2);
		l1.next = new ListNode(4);
		l1.next.next = new ListNode(3);
		ListNode l2 = new ListNode(5);
		l2.next = new ListNode(6);
		l2.next.next = new ListNode(4);
		t.addTwoNumbers(l1, l2);
			
	}
	
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode dummyHead = new ListNode(0);
		ListNode p = l1, q = l2, curr = dummyHead;
		int carry = 0;
		while(p != null || q != null) {
			int x = (p != null) ? p.val : 0;
			int y = (q != null) ? q.val : 0;
			int sum = x + y + carry;
			carry = sum / 10;
			curr.next = new ListNode(sum % 10);
			curr = curr.next;
			if(p != null) p = p.next;
			if(q != null) q = q.next;
		}
		if(carry > 0) {
			curr.next = new ListNode(1);
		}
		while(dummyHead.next != null) {
			System.out.println(dummyHead.next.val);
			dummyHead = dummyHead.next;
		}
		return dummyHead;
    }

}

输出：

2.递归方法

package test;

import test.test12.ListNode;

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

	public static void main(String[] args) {
		test13 t = new test13();
		ListNode l1 = new ListNode(5);
//		l1.next = new ListNode(4);
//		l1.next.next = new ListNode(3);
		ListNode l2 = new ListNode(3);
//		l2.next = new ListNode(6);
//		l2.next.next = new ListNode(4);
		t.addTwoNumbers(l1, l2);
	}
	
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		int l1val = 0;
		int l2val = 0;
		
		if(l1 == null) {
			l1val = 0;
		} else {
			l1val = l1.val;
		}
		if(l2 == null) {
			l2val = 0;
		} else {
			l2val = l2.val;
		}
		
		if((l1val + l2val) >= 10) {
			if(l1.next != null) {
				l1.next.val++;
			} 
			else if(l2.next != null) {
				l2.next.val++;
			}
		}
		
		ListNode rtnNode = new ListNode((l1val + l2val) % 10);
		
		if(l1.next == null && l2.next == null) {
			if((l1val + l2val) >= 10) {
				rtnNode.next = new ListNode(1);
			} else {
				rtnNode.next = null;
			}
		}
		else if(l1.next == null && l2.next != null) {
			rtnNode.next = addTwoNumbers(new ListNode(0), l2.next);
		}
		else if(l1.next != null && l2.next == null) {
			rtnNode.next = addTwoNumbers(l1.next, new ListNode(0));
		}
		else {
			rtnNode.next = addTwoNumbers(l1.next, l2.next);
		}
		return rtnNode;
	}
}