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.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
给定两个代表两个非负数的链表,按数位逆置方式存储(即123存储为3→2→1→NULL),要求返回两数之和的链表。
思路:依次将两个链表同下标元素相加,和的个位数(余10)存入新链表,和的十位数(carry)与下一组元素相加。最后返回新链表,即从个位开始,逆序返回和。
//Java
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0);