add two numbers

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.


 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class  {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode prev=new ListNode(0);
        ListNode head=prev;
        int carry=0;
        while(l1!=null||l2!=null||carry!=0)
        {
            ListNode cur=new ListNode(0);
            int sum=((l2==null)?0 :l2.val)+((l1==null)?0 :l1.val)+carry;            
            carry=sum/10;
            cur.val=sum%10;
            prev.next=cur;
            prev=cur;
            
            l1=((l1==null)?l1:l1.next);
            l2=((l2==null)?l2:l2.next);
        }
        return head.next;
    }
}

TIPS：
链表一旦为空，则直接输出为0

add two numbers

近期文章

近期评论

标签

热门

文章归档

分类目录

功能