Add Two Numbers
给两个list, 返回一个list是这两个list的合.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 |
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { if(l1 == null && l2 == null) return null; int carry = 0; ListNode head = new ListNode(0); ListNode p = head; while(l1 != null && l2 != null) { int sum = l1.val + l2.val + carry; carry = sum / 10; p.next = new ListNode(sum % 10); p = p.next; l1 = l1.next; l2 = l2.next; } while(l1 != null){ int sum = l1.val + carry; carry = sum / 10; p.next = new ListNode(sum % 10); p = p.next; l1 = l1.next; } while(l2 != null){ int sum = l2.val + carry; carry = sum / 10; p.next = new ListNode(sum % 10); p = p.next; l2 = l2.next; } if(carry != 0) p.next = new ListNode(carry); return head.next; } } |