Skip to content

Instantly share code, notes, and snippets.

@wayetan
Created January 5, 2014 09:27
Show Gist options
  • Save wayetan/8266222 to your computer and use it in GitHub Desktop.
Save wayetan/8266222 to your computer and use it in GitHub Desktop.
Add Two Numbers
/**
* You are given two linked lists representing two non-negative numbers.
* 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.
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
*/
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1 == null)
return l2;
if(l2 == null)
return l1;
ListNode head = new ListNode(0);
ListNode cur = head;
int advance = 0;
while(l1 != null && l2 != null){
int sum = l1.val + l2.val + advance;
advance = sum / 10;
sum = sum % 10;
cur.next = new ListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
}
if(l1 != null){
if(advance != 0)
cur.next = addTwoNumbers(l1, new ListNode(advance));
else
cur.next = l1;
}else if(l2 != null){
if(advance != 0)
cur.next = addTwoNumbers(l2, new ListNode(advance));
else
cur.next = l2;
}else if(advance != 0){
cur.next = new ListNode(advance);
}
return head.next;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment