你有两个用链表代表的整数,其中每个节点包含一个数字。数字存储按照在原来整数中相反的顺序,使得第一个数字位于链表的开头。写出一个函数将两个整数相加,用链表形式返回和。
您在真实的面试中是否遇到过这个题?给出两个链表 3->1->5->null
和 5->9->2->null
,返回 8->0->8->null
相关题目 Expand
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
/**
* @param l1: the first list
* @param l2: the second list
* @return: the sum list of l1 and l2
*/
public ListNode addLists(ListNode l1, ListNode l2) {
// write your code here
int carry = 0;
ListNode head = new ListNode(0);
ListNode p = l1;
ListNode q = l2;
ListNode r = head;
while(p!=null&&q!=null){
r.next = new ListNode((p.val+q.val+carry)%10);
carry = (p.val+q.val+carry)/10;
p = p.next;
q = q.next;
r = r.next ;
}
ListNode l;
l = (p!=null?p:q);
while(l!=null){
r.next = new ListNode(l.val%10+carry);
carry = l.val/10;
l = l.next;
r = r.next;
}
if(carry!=0){
r.next = new ListNode(carry);
}
return head.next;
}
}