You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (1 -> 4 -> 3) + (5 -> 8 -> 4)Output: 6 -> 2 -> 8
/** * 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) { ListNode dummyHead = new ListNode(0); ListNode p = l1, q = l2, cur = dummyHead; int carry = 0, sum = 0; while (p != null || q != null) { int x = (p == null ? 0 : p.val); int y = (q == null ? 0 : q.val); sum = carry + x + y; carry = sum / 10; cur.next = new ListNode(sum % 10); cur = cur.next; if (p != null) p = p.next; if (q != null) q = q.next; } if (carry > 0) { cur.next = new ListNode(carry); } return dummyHead.next; }//addTwoNumbers } 1562 / 1562 test cases passed. Status:
Accepted
Runtime: 50 ms T(n) = O(max(m,n)) S(n) = O(max(m,n))Your runtime beats 87.48 % of java submissions.