/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverse(ListNode head) {
if(head == null) return null;
ListNode p = head, q = p.next, r = null;
while(q != null) {
p.next = r;
r = p;
p = q;
q = q.next;
}
p.next = r;
return p;
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = null;
int temp = 0, val = 0;
while(l1 != null && l2 != null) {
val = (l1.val + l2.val + temp) % 10;
temp = (l1.val + l2.val + temp) / 10;
ListNode p = new ListNode(val);
p.next = result;
result = p;
l1 = l1.next;
l2 = l2.next;
}
while(l1 != null) {
val = (l1.val + temp) % 10;
temp = (l1.val + temp) / 10;
ListNode p = new ListNode(val);
p.next = result;
result = p;
l1 = l1.next;
}
while(l2 != null) {
val = (l2.val + temp) % 10;
temp = (l2.val + temp) / 10;
ListNode p = new ListNode(val);
p.next = result;
result = p;
l2 = l2.next;
}
if(temp != 0) {
ListNode p = new ListNode(temp);
p.next = result;
result = p;
}
return reverse(result);
}
}
力扣leetcode 2. 两数相加 java
最新推荐文章于 2023-11-25 01:07:03 发布