Difficulty: Medium
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 {
* public int val;
* public ListNode next;
* public ListNode(int x) { val = x; }
* }
*/
My submission 1: Accepted Runtime:234ms
1 public ListNode AddTwoNumbers(ListNode l1, ListNode l2) { 2 ListNode result=new ListNode(0); 3 int carray = 0; 4 ListNode p = l1; 5 ListNode q = l2; 6 ListNode loop = result; 7 while (p != null || q != null) 8 { 9 int a = p != null ? p.val : 0; 10 int b = q != null ? q.val : 0; 11 12 int sum = (a + b + carray)%10; 13 14 //loop.val = sum; 15 //loop = loop.next = new ListNode(0); 16 loop.next = new ListNode(sum); 17 loop = loop.next; 18 19 carray = (a + b + carray) / 10; 20 p = p!=null?p.next:null; 21 q = q!=null?q.next:null; 22 23 } 24 if(carray>0) 25 loop.next=new ListNode(carray); 26 return result.next; 27 }
My submission 2: Accepted Runtime:209ms
1 public ListNode AddTwoNumbers(ListNode l1, ListNode l2) { 2 ListNode result=new ListNode(0); 3 int carray = 0; 4 ListNode p = l1; 5 ListNode q = l2; 6 ListNode loop = result; 7 while (p != null || q != null) 8 { 9 int a = p != null ? p.val : 0; 10 int b = q != null ? q.val : 0; 11 12 int sum = a + b + carray; 13 14 //loop.val = sum; 15 //loop = loop.next = new ListNode(0); 16 loop.next = new ListNode(sum%10); 17 loop = loop.next; 18 19 carray = sum / 10; 20 p = p!=null?p.next:null; 21 q = q!=null?q.next:null; 22 23 } 24 if(carray>0) 25 loop.next=new ListNode(carray); 26 return result.next; 27 }
原文：http://www.cnblogs.com/leakeyash/p/5618527.html
