Created
September 2, 2015 16:53
-
-
Save cxtadment/112412cda2e1f52c1eb4 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Definition for singly-linked list. | |
| * public class ListNode { | |
| * int val; | |
| * ListNode next; | |
| * ListNode(int x) { | |
| * val = x; | |
| * next = null; | |
| * } | |
| * } | |
| */ | |
| public class Solution { | |
| /** | |
| * @param l1: the first list | |
| * @param l2: the second list | |
| * @return: the sum list of l1 and l2 | |
| */ | |
| public ListNode addLists(ListNode l1, ListNode l2) { | |
| // write your code here | |
| ListNode dummy = new ListNode(0); | |
| ListNode curr = dummy; | |
| int count = 0; | |
| while (l1 != null || l2 != null) { | |
| int val1 = (l1 == null) ? 0 : l1.val; | |
| int val2 = (l2 == null) ? 0 : l2.val; | |
| int temp = val1 + val2 + count; | |
| if (temp > 9) { | |
| ListNode newNode = new ListNode(temp - 10); | |
| count = 1; | |
| curr.next = newNode; | |
| } else { | |
| ListNode newNode = new ListNode(temp); | |
| count = 0; | |
| curr.next = newNode; | |
| } | |
| curr = curr.next; | |
| l1 = (l1 == null) ? null : l1.next; | |
| l2 = (l2 == null) ? null : l2.next; | |
| } | |
| if (count == 1) { | |
| ListNode newNode = new ListNode(count); | |
| curr.next = newNode; | |
| curr = curr.next; | |
| } | |
| return dummy.next; | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment