题目描述:
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
思路解析:
- 循环把每位上的数字加起来,循环的条件是两个头节点不为空。
- 每加一位,就要新建list3的新节点为和的个位数字,和除以10即为进位的数字,继续加到下一位上
- ListNode一个新的节点,作为头节点,然后返回头节点的下一个。
- 最后循环结束需要做的是如果进位上还有值,就继续新建节点放进去。
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1==null)
return l2;
if(l2 ==null)
return l1;
int carry = 0;
ListNode newhead = new ListNode(-1);
ListNode l3 = newhead;
while(l1!=null||l2!=null){
if(l1!=null){
carry += l1.val;
l1=l1.next;
}
if(l2!=null){
carry+=l2.val;
l2 =l2.next;
}
l3.next= new ListNode(carry%10);
carry/=10;
l3 = l3.next;
}
if(carry ==1){
l3.next = new ListNode(1);
}
return newhead.next;
}
}