1.两数相加
2.图解过程额
1.
sum = l1.val + l2.val + carry = 7 此时并没有进位 carry = 0 创建一个新节点存放sum
2.
sum = l1.val + l2.val + carry = 10 等于10进位 carry = 1 sum = sum % 10 = 0 存入一个新节点
3.
注意:一定要注意最后的carry是否为1,如果为1就说明最后两位数相加要进位,此时只需要创建一个新节点将carry放入节点,然后cur这个指针指向carry这个节点
3.代码实现
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode prev = new ListNode(0);
ListNode cur = prev;
int carry = 0;//表示进位
while(l1 != null || l2 != null){
//l1或者l2不等于null时,就取l1或者l2的值,如果为null,则取0
int x = l1 != null ? l1.val : 0;
int y = l2 != null ? l2.val : 0;
int sum = x + y + carry;
carry = sum / 10;
sum = sum % 10;
cur.next = new ListNode(sum);
cur = cur.next;
if(l1 != null){
l1 = l1.next;
}
if(l2 != null){
l2 = l2.next;
}
}
if(carry != 0){
cur.next = new ListNode(carry);
}
return prev.next;
}
}