2. Add Two Numbers

最新推荐文章于 2020-05-28 01:19:19 发布

Shezzer

最新推荐文章于 2020-05-28 01:19:19 发布

阅读量245

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Shezzer/article/details/79793095

版权

该博客讨论了如何解决将两个逆序存储在链表中的非负整数相加的问题。博主首先尝试直接将链表数字相加，然后意识到逐位计算并处理进位是更好的方法。解决方案涉及迭代链表，处理不同长度和进位，并提供了一个时间复杂度为O(max(m,n))，空间复杂度为O(max(m,n))的算法。博主还提到了非逆序存储的链表相加会增加问题难度。" 49254233,5535747,使用EasySQLMAIL进行Oracle订单异常监控与邮件发送,"['数据库', 'Oracle', '邮件服务', '数据监控', '自动化']

摘要由CSDN通过智能技术生成

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.

My Solution:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        boolean carry = false;
        ListNode result = new ListNode(0);
        ListNode p = result;
        while(l1 != null || l2 != null){
        	int s = 0;
        	if(carry == true) {
        		s = 1;
        		carry = false;
        	}
            int a = l1 == null ? 0 : l1.val;
            int b = l2 == null ? 0 : l2.val;
            s += a + b;
            if(s >= 10) {
            	carry = true;
            	s %= 10;
            }
            p.next = new ListNode(s);
            p = p.next;
            if(l1 !=null)
            	l1 = l1.next;
            if(l2 !=null)
            	l2 = l2.next;
        }
        if(carry) {
        	p.next = new ListNode(1);
        }
        return result.next;
    }
}

Solution:

Intuition

Keep track of the carry using a variable and simulate digits-by-digits sum starting from the head of list, which contains the least-significant digit.

Illustration of Adding two numbers

Figure 1. Visualization of the addition of two numbers: .
Each node contains a single digit and the digits are stored in reverse order.

Algorithm

Just like how you would sum two numbers on a piece of paper, we begin by summing the least-significant digits, which is the head of and . Since each digit is in the range of $0 \dots 9$ , summing two digits may "overflow". For example