首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Leetcode2——Add Two Numbers

Leetcode2——Add Two Numbers

作者头像
Tyan
发布2019-05-26 08:48:05
2800
发布2019-05-26 08:48:05
举报
文章被收录于专栏:SnailTyanSnailTyan

版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://cloud.tencent.com/developer/article/1434532

文章作者:Tyan

博客:noahsnail.com | CSDN | 简书

1. 问题描述

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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

2. 求解

方法一

先求解两个链表的和,直接一个链表结束或两个链表同时结束,然后再处理没结束链表的剩下部分。

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int sum = 0;
        int a = 0;
        int b = 0;
        int quotient = 0;
        ListNode head = new ListNode(0);
        ListNode current = head;
        while(l1 != null && l2 !=null) {
            a = l1.val;
            b = l2.val;
            sum = a + b + quotient;
            current.next = new ListNode(sum % 10);
            quotient = sum / 10;
            l1 = l1.next;
            l2 = l2.next;
            current = current.next;
        }
        ListNode temp = null;
        if(l1 != null) {
            temp = l1;
        }else if(l2 != null) {
            temp = l2;
        }else {
            if(quotient != 0) {
                temp = new ListNode(0);
            }
        }
        while(temp != null) {
            sum = temp.val + quotient;
            current.next = new ListNode(sum % 10);
            quotient = sum / 10;
            temp = temp.next;
            current = current.next;
        }
        if(quotient != 0) {
             current.next = new ListNode(quotient);
        }
        return head.next;
    }
}

方法二

方法一中的代码有较多的冗余,例如current.next = new ListNode(sum % 10);出现了两次,两次while循环的逻辑是非常类似的,经过代码的变换可以将两部分合成一部分,即同时处理两个链表直至两个链表都结束。

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int sum = 0;
        int a = 0;
        int b = 0;
        int quotient = 0;
        ListNode head = new ListNode(0);
        ListNode current = head;
        while(l1 != null || l2 !=null) {
            if(l1 ==null) {
                a = 0;
            }else {
                a = l1.val;
                l1 = l1.next;
            }
            if(l2 == null) {
                b = 0;
            }else {
                b = l2.val;
                l2 = l2.next;
            }
            sum = a + b + quotient;
            current.next = new ListNode(sum % 10);
            quotient = sum / 10;
            current = current.next;
        }
        if(quotient != 0) {
             current.next = new ListNode(quotient);
        }
        return head.next;
    }
}
本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
原始发表:2017年03月16日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. 问题描述
  • 2. 求解
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档