LeetCode4: Add Two Numbers

最新推荐文章于 2020-12-24 10:37:16 发布

huazi0204

最新推荐文章于 2020-12-24 10:37:16 发布

阅读量319

点赞数

分类专栏： LeetCode 文章标签： Leetcode leetcode LeetCode

本文链接：https://blog.csdn.net/huazi0204/article/details/8579755

版权

LeetCode 专栏收录该内容

43 篇文章 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

/**
 * 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) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int carry = 0;
        int sum = 0;
        ListNode res = null;
        ListNode cur = null;
        ListNode prev = null;
        while(l1!=null || l2!=null){
            if(l1!=null && l2!=null){
                sum = l1.val + l2.val + carry;
                l1 = l1.next;
                l2 = l2.next;
            }
            else if(l1==null){
                sum = l2.val + carry;
                l2 = l2.next;
            }
            else if(l2==null){
                sum = l1.val + carry;
                l1 = l1.next;
            }
            carry = 0;
            if(sum >= 10){
                carry = sum/10;
                sum = sum%10;
            }
            cur = new ListNode(sum);
            
            if(res == null){
                res = cur;
            }
            else{
                prev.next = cur;
            }
            prev = cur;
        }
        
        if(carry != 0){
            cur = new ListNode(carry);
            prev.next = cur;
        }

        return res;
    }
}

Bugs found:

1. Ignore the last carry. Input: {9}, {1} Output: {0} Expected: {0, 1}.

------------------------------------------------------------------------------------------------------------------------------------------

LL's solution

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        // Start typing your Java solution below
        // DO NOT write main() function        
        
        if(l1 == null)
            return l2;
        if(l2 == null)
            return l1;
        
        ListNode head = new ListNode(0); 
        ListNode res = head;
        int flag = 0;
        
        while(l1!=null && l2!=null){
            int sum = l1.val + l2.val + flag;
            if(sum>=10){
                flag = 1;
                sum -= 10;
            }
            else
                flag = 0;
            ListNode cur = new ListNode(sum);
            res.next = cur;
            res = cur; 
            l1 = l1.next;
            l2 = l2.next;           
        }
        
        ListNode l3 = (l1==null)?l2:l1;
        while(l3!=null){
            int sum = flag + l3.val;
            if(sum>=10){
                flag = 1;
                sum -= 10;
            }
            else
                flag = 0;
            ListNode cur = new ListNode(sum);
            l3 = l3.next;
            res.next = cur;
            res = cur;  
        }  
        
        if(flag ==1){
            ListNode cur = new ListNode(1);
            res.next = cur;
        }
        
        return head.next;
    }
}

Note:

1. linked list不能把head往后推！得head不动，建一个指针往后跑。

2. sum >= 10, not sum > 10
3. 对于没有空constructor的，可以先建一个demi head, 然后return head.next.