LeetCode 2. 两数相加
原题链接
中等
/**
* 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 dummy = new ListNode();
int t = 0;
ListNode current = dummy;
while(l1 != null || l2 != null || t != 0){
if(l1 != null) {
t += l1.val;
l1 = l1.next;
}
if(l2 != null){
t += l2.val;
l2 = l2.next;
}
current = current.next = new ListNode(t % 10);
t = t / 10;
}
return dummy.next;
}
}