题目：

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

思路：这道题要求我们实现的是链表相加，我们先创建一个链表存放数据，创建两个变量用来存放两个指针的数据，分别为val1和val2，当在l1上的指针不为空时将l1.val赋值给val1，另一条指针同理，接下来难点在如何进位，应该将数值 之和对10取余用作值，之和除以10用作进位。

public class Solution{

       public ListNode addTwoNumbers(ListNode l1, ListNode l2){

            ListNode  result = new ListNode(0);

            ListNode  preNode = result;

            ListNode node1 = l1;   

            ListNode node2 = l2;   

            int sum =  0;

             while(node1 != null || node2 != null || sum>0){

                    ListNode node = new ListNode(0);

                    int val1 = 0;

                    if(node1 != null){

                           val1 = node1.val;   

                           node1 = node1.next;                        
                    }           

                    int val2 = 0; 

                   if (node2 !=null){  

                         val2 = node2.val;     

                         node2 = node2.next;   

                       }          

                   node.val = (val1+val2+sum)%10; //取值

                   sum = (val1+val2+sum)/10;   //进位

                   preNode.next = node;     

                   preNode = node; 

                }      

       return result.next;   

      }

}   
             

最后

以上就是自然小甜瓜最近收集整理的关于add-two-numbers （两数之和）题目：的全部内容，更多相关add-two-numbers内容请搜索靠谱客的其他文章。