首页 > 代码库 > [Leetcode] Add Two Numbers

[Leetcode] 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

 

Solution:

 1 /** 2  * Definition for singly-linked list. 3  * public class ListNode { 4  *     int val; 5  *     ListNode next; 6  *     ListNode(int x) { 7  *         val = x; 8  *         next = null; 9  *     }10  * }11  */12 public class Solution {13     public ListNode addTwoNumbers(ListNode l1, ListNode l2) {14         ListNode result=new ListNode(-1);15         ListNode cur=result;16         int carry=0;17         while(l1!=null&&l2!=null){18             int temp=l1.val+l2.val+carry;19             carry=temp/10;20             temp%=10;21             cur.next=new ListNode(temp);22             cur=cur.next;23             l1=l1.next;24             l2=l2.next;25         }26         while(l1!=null){27             int temp=l1.val+carry;28             carry=temp/10;29             temp%=10;30             cur.next=new ListNode(temp);31             cur=cur.next;32             l1=l1.next;33         }34         while(l2!=null){35             int temp=l2.val+carry;36             carry=temp/10;37             temp%=10;38             cur.next=new ListNode(temp);39             cur=cur.next;40             l2=l2.next;41         }42         if(carry!=0){43             cur.next=new ListNode(carry);44         }45         return result.next;46     }47 }

 

[Leetcode] Add Two Numbers