LeetCode||2.Add Two Numbers

2. Add Two Numbers

• Total Accepted: 193274
• Total Submissions: 763487
• Difficulty: Medium

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

这题很像我以前做的大数相加的问题，不过是用链表倒过来做。相加获取的数如果大于10就取模，再向后加。

代码如下

/**
 * 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) {
        if (l1==null) {
			return l2;
		}
		if (l2==null) {
			return l1;
		}
		int result = 0;
		ListNode newhead = new ListNode(-1);
		ListNode l3 = newhead;
		while (l1!=null||l2!=null) {
			if (l1!=null) {
				result += l1.val;
				l1 = l1.next;
			}
			if (l2!=null) {
				result += l2.val;
				l2 = l2.next;
			}
			l3.next = new ListNode(result%10);
			result = result/10;
			l3 = l3.next;
		}
		if (result == 1) {
			l3.next = new ListNode(1);
		}
        return newhead.next;
    }
}