Add two numbers

ou 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.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

 public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int sum = l1.val+l2.val;
        int carry = (sum >=10)?1:0;
        //创建一个新的节点
        ListNode node = new ListNode(sum % 10);
        if(l1.next == null && l2.next == null)
        {
            if(carry >= 1)
            {
                node.next = new ListNode(carry);
            }
            return node;
        }
        if(l1.next==null)
        {
            node.next = addTwoNumbers(new ListNode(0+carry),l2.next);
            return node;
        }
        if(l2.next == null)
        {
            node.next = addTwoNumbers(l1.next,new ListNode(0+carry));
            return node;
        }
        l2.next.val+=carry;
        node.next = addTwoNumbers(l1.next, l2.next);
        return node;
    }

 public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode dummyHead = new ListNode(0);
        ListNode p = l1, q = l2, cur = dummyHead;
        int carry = 0;
        while(p != null || q != null)
        {
            int x = (p == null)? 0: p.val;
            int y = (q == null)? 0: q.val;
            int sum = x+y+carry;
            carry = sum / 10;
            cur.next = new ListNode(sum % 10);
            cur = cur.next;
            if(p != null) p = p.next;
            if(q != null) q = q.next;
        }
        if(carry >= 1)
        {
            cur.next = new ListNode(carry);
        }
        return dummyHead.next;
    }

拓展：链表的反转

/**
     * 利用迭代实现链表的反转
     * @param head
     * @return
     */
    public static Linked ReverseLinkedByIteration(Linked head)
    {
        //记录前一个节点
        Linked pre = null;
        //记录当前节点
        Linked cur = head;
        //记录下一个节点
        Linked headNext = null;
        while(cur!=null)
        {
            headNext = cur.next;
            cur.next = pre;//改变链表中节点的指向
            pre = cur;
            cur = headNext;
        }
        return pre;
    }

    /**
     * 利用递归实现链表的反转
     * @param head
     * @return
     */
    public  static Linked ReverseByRecursion(Linked head)
    {
      if(head == null || head.next == null)
      {
          return head;
      }
        //获取当前节点的下一个节点
        Linked pNext = head.next;
        //递归调用
        Linked node = ReverseByRecursion(pNext);
        pNext.next = head;//后一个节点指向前一个节点
        // 打断当前节点的指向
        head.next = null;
        return node;
    }