GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — leetcode-algorithms/src/AddTwoNumbers.java at master · anishLearnsToCode/leetcode-algorithms Expand file tree/ Copy pathAddTwoNumbers.javaMore file actions 36 lines (31 loc) · 933 Bytes / Copy pathAddTwoNumbers.javaFile metadata and controls36 lines (31 loc) · 933 Bytes 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 // https://leetcode.com/problems/add-two-numbers // T: O(max(|l1|, |l2|)) // S: O(max(|l1|, |l2|)) public class AddTwoNumbers { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode result = new ListNode(); ListNode current = result; int carry = 0; while (l1 != null || l2 != null) { current.next = new ListNode(); current = current.next; int sum = get(l1) + get(l2) + carry; current.val = sum % 10; carry = sum / 10; l1 = next(l1); l2 = next(l2); } if (carry > 0) { current.next = new ListNode(carry); } return result.next; } private ListNode next(ListNode node) { if (node == null) return null; return node.next; } private int get(ListNode node) { if (node == null) return 0; return node.val; } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |