码迷,mamicode.com
首页 > 其他好文 > 详细

2. Add Two Numbers

时间:2016-05-01 13:31:15      阅读:162      评论:0      收藏:0      [点我收藏+]

标签:

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

 

Subscribe to see which companies asked this question

Hide Tags
 Linked List Math
Hide Similar Problems
 (M) Multiply Strings (E) Add Binary
 
 
/**
 * 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 && l2 == null)
            return null;
        if(l2 == null)
            return l1;
        if(l1 == null)
            return l2;
        
        int previous = 0;
        int sum = l1.val+l2.val;
        previous = sum/10;
        ListNode r = new ListNode(sum%10);
        ListNode rc = r;
        
        l1 = l1.next;
        l2 = l2.next;
        while(l1 != null && l2 != null)
        {
            sum = l1.val+l2.val + previous;
            previous = sum/10;
            r.next = new ListNode(sum%10);
            r = r.next;
            l1 = l1.next;
            l2 = l2.next;
        }
        
        while(l1 != null)
        {
            sum = l1.val + previous;
            previous = sum/10;
            r.next = new ListNode(sum%10);
            r = r.next;
            l1 = l1.next;
        }
        
        while(l2 != null)
        {
            sum = l2.val + previous;
            previous = sum/10;
            r.next = new ListNode(sum%10);
            r = r.next;
            l2 = l2.next;
        }
        
        if(previous != 0)
            r.next = new ListNode(1);
        return rc;
        
    }
}

 

 

2. Add Two Numbers

标签:

原文地址:http://www.cnblogs.com/neweracoding/p/5450358.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!