给定两个用链表表示的整数,每个节点包含一个数位。
这些数位是反向存放的,也就是个位排在链表首部。
编写函数对这两个整数求和,并用链表形式返回结果。
示例:
输入:(7 -> 1 -> 6) + (5 -> 9 -> 2),即617 + 295
输出:2 -> 1 -> 9,即912
进阶:思考一下,假设这些数位是正向存放的,又该如何解决呢?
示例:
输入:(6 -> 1 -> 7) + (2 -> 9 -> 5),即617 + 295
输出:9 -> 1 -> 2,即912
/**
* 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) {
// l1 = reverse(l1);
// l2 = reverse(l2);
ListNode ret = new ListNode(0);
ListNode node = ret;
int cp = 0;
while(l1!=null||l2!=null){
int val1 = l1==null?0:l1.val;
int val2 = l2==null?0:l2.val;
int sum = cp+val1+val2;
cp = sum/10;
sum = sum%10;
node.next = new ListNode(sum);
node = node.next;
l1 = l1==null?l1:l1.next;
l2 = l2==null?l2:l2.next;
}
if(cp==1){
node.next = new ListNode(1);
node = node.next;
}
node.next = null;
// ListNode head = reverse(ret.next);
// reverse(head);
return ret.next;
}
public ListNode reverse(ListNode head){
ListNode pre,cur,nxt;
pre = null; cur = head;
while(cur!=null){
nxt = cur.next;
cur.next = pre;
pre = cur;
cur = nxt;
}
return pre;
}
}