问题2:
给定两个非空链表,代表两个非负数,数字逆序存放在链表里,并且每个节点包含一个数字,对数字加和并且以链表的形式返回。
样例
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出: 7 -> 0 -> 8
解释:342 + 465 = 807
思路:
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0); //新建链表,初始化
ListNode p = l1, q = l2, curr = dummyHead; //pq分别指向两个链表,curr指向新链表
int carry = 0; //初始化carry表示进位
while (p != null || q != null) { //两链表均不为空
int x = (p != null) ? p.val : 0; //P不为空,把P的值赋给X
int y = (q != null) ? q.val : 0; //q不为空,把q的值赋给Y
int sum = carry + x + y; //和sum为进位carry加上x,y
carry = sum / 10; //取进位
curr.next = new ListNode(sum % 10); //当前位的值
curr = curr.next;
if (p != null) p = p.next;
if (q != null) q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
}
}