Java
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0);
ListNode p = l1, q = l2, curr = dummyHead;
int carry = 0;//进位
while (p != null || q != null) //遍历链表，直到两个链表都都遍历的底
{
int x = (p != null) ? p.val : 0;//x为当前链表节点P的值，如果链表已经到底了，就取0
int y = (q !=
