leetcode----Add Two Numbers

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

Subscribe to see which companies asked this question.

题目的中文意思是给出两个单向链表，然后要求对链表进行按位加和，如果慢10 的话，取余。

这个题一看可能很好理解，需要注意的是给出的单向链表的类，这个类中有两个属性和一个构造方法，属性是当前节点的值和下一个节点对象，通过这两个属性可以定义一个单向的链表，构造方法是用对当前节点赋值。

如果理解了给出的类的定义，这个题目的思路就很清晰了，下面是一种实现。

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode returnNode = null;
        ListNode h3 = null;
        int carry = 0;
        while (l1 != null || l2 != null) {
            ListNode node = new ListNode(0);
            int x1 = (l1 == null ? 0 : l1.val);
            int x2 = (l2 == null ? 0 : l2.val);
            int x = x1 + x2 + carry;

            node.val = x % 10;
            carry = x / 10;

            if (returnNode == null) {
                returnNode = node;
                h3 = node;
            } else {
                h3.next = node;
                h3 = node;
            }
            if (l1 != null) l1 = l1.next;
            if (l2 != null) l2 = l2.next;
        }
        if (carry == 1)
            h3.next = new ListNode(1);
        return returnNode;
    }