Loading

面试题 02.05. [链表]链表求和

面试题 02.05 链表求和

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode head = new ListNode(0);
        ListNode prev = head;
        int carry = 0;
        while (l1 != null || l2 != null || carry != 0){
			int sum = (l1 == null ? 0 : l1.val) + (l1 == null ? 0 : l2.val) + carry;
            carry = sum / 10;
            prev.next = new ListNode(sum % 10);
            prev = prev.next;
            l1 = l1 == null ? null : l1.next;
            l2 = l2 == null ? null : l2.next;
        }
        return head.next;
    }
}
posted @ 2020-10-22 10:37  上海井盖王  阅读(64)  评论(0)    收藏  举报