/**
* 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 dumpy = new ListNode(-1);
ListNode cur = dumpy;
int carry = 0; // 保留进位
// carray 不等于0确保最后一位
while (l1 != null || l2 != null || carry != 0) {
int l1val = l1 != null ? l1.val : 0;
int l2val = l2 != null ? l2.val : 0;
int sum = l1val + l2val + carry;
carry = sum / 10; // 计算进位
ListNode sumNode = new ListNode(sum % 10);
cur.next = sumNode;
cur = sumNode;
if (l1 != null) {
l1 = l1.next;
}
if (l2 != null) {
l2 = l2.next;
}
}
return dumpy.next;
}
}
2. 两数相加
最新推荐文章于 2021-04-11 17:06:07 发布