每日一题2---两数相加

代码

/**
 * 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;
        int carry = 0;
        while (p!=null||q!=null){
            int x=0,y=0;
            if(p!=null){
                x=p.val;
                p=p.next;
            }
            if(q!=null){
                y=q.val;
                q=q.next;
            }
            int sum=carry+x+y;
            carry=sum/10;
            curr.next=new ListNode(sum%10);
            curr=curr.next;
        }
        if(carry>0){
            curr.next=new ListNode(carry);
        }
        return dummyHead.next;
    }
}

解析

时间复杂度：O(max(m, n))
空间复杂度：O(max(m, n))

结果

执行用时：3 ms
内存消耗：40.2 MB