LeetCode之两数之和

题目描述：

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

解题思路：

将两个链表从头节点开始同时遍历，用递归的方式计算每个节点的和，用和除10得到的商创建新的节点，余数用变量保存，参与下个节点的和。

 public class ListNode {
     int val;
     ListNode next;
     ListNode(int x) { val = x; }
 }
 
class Solution {
    int c = 0;
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        
        ListNode head = null;
        if (l1 != null && l2 != null) {
            head = new ListNode((l1.val + l2.val + c)%10);
            c = (l1.val + l2.val + c)/10;
            head.next = addTwoNumbers(l1.next, l2.next);
        } else if (l1 != null) {
            head = new ListNode((l1.val + c)%10);
            c = (l1.val + c)/10;
            head.next = addTwoNumbers(l1.next, null);
        } else if (l2 != null) {
            head = new ListNode((l2.val + c)%10);
            c = (l2.val + c)/10;
            head.next = addTwoNumbers(null, l2.next);
        } else {
            if (c != 0) {
                head = new ListNode(c);
                head.next = null;
            }
        }
        return head;
        
    }
}