这个题目在于熟悉链表操作,知道链表原理和实际操作起来不一样
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode node = new ListNode(0);
ListNode rnode = node;
int carry = 0;
while(l1 != null || l2 != null) {
if(l1 != null) {
carry+= l1.val;
l1 = l1.next;
}
if(l2 != null) {
carry+= l2.val;
l2 = l2.next;
}
node.val = carry % 10;
carry = carry / 10;
if(l1 == null && l2 == null){
if(carry == 1) node.next = new ListNode(1);
return rnode;
}
node.next = new ListNode(0);
node = node.next;
}
return rnode;
}
}