LeetCode——2.Add Two Numbers

最新推荐文章于 2020-06-30 16:24:52 发布

gemnwing

最新推荐文章于 2020-06-30 16:24:52 发布

阅读量165

点赞数 1

分类专栏： LeeCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/gemnwing/article/details/81949881

版权

LeeCode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目

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
Explanation: 342 + 465 = 807.

Java实现

/**
 * 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) {
        ListNode ret = new ListNode(0);
        ListNode curr = ret;
        int carry = 0;
        while(l1 != null || l2 != null){
            int a = l1 == null ? 0 : l1.val;
            int b = l2 == null ? 0 : l2.val;
            int sum = carry + a + b;
            carry = sum/10;
            curr.next = new ListNode(sum%10);
            curr = curr.next;
            if(l1 != null) l1 = l1.next;
            if(l2 != null) l2 = l2.next;
        }
        if(carry == 1) curr.next = new ListNode(1);
        return ret.next;
    }
}