leetcode 2. 两数相加

leetcode 2. 两数相加

---

题意

给定两个非空链表来表示两个非负整数。位数按照逆序方式存储，它们的每个节点只存储单个数字。将两数相加返回一个新的链表。

---

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode headNode = new ListNode(0);
        ListNode curNode = headNode;
        ListNode _l1 = l1;
        ListNode _l2 = l2;
        int carry = 0;
        while (null != _l1 || null != _l2)
        {
            int v1;
            int v2;
            if (null == _l1)
            {
                v1 = 0;
            }
            else
            {
                v1 = _l1.val;
            }
            if (null == _l2)
            {
                v2 = 0;
            }
            else
            {
                v2 = _l2.val;
            }
            int temp = v1 + v2 + carry;
            if (temp >= 10)
            {
                temp %= 10;
                carry = 1;
            }
            else
            {
                carry = 0;
            }
            ListNode nextNode = new ListNode(temp);
            curNode.next = nextNode;
            curNode = curNode.next;
            if (null != _l1)
            {
                _l1 = _l1.next;
            }
            if (null != _l2)
            {
                _l2 = _l2.next;
            }
        }
        if (1 == carry)
        {
            ListNode nextNode = new ListNode(1);
            curNode.next = nextNode;
            curNode = curNode.next;
        }
        headNode = headNode.next;
        return headNode;
    }
}