mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
25 lines
1.1 KiB
Markdown
25 lines
1.1 KiB
Markdown
# [445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)
|
||
|
||
## 题目
|
||
|
||
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.
|
||
|
||
Follow up:
|
||
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.
|
||
|
||
Example:
|
||
|
||
```text
|
||
Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
|
||
Output: 7 -> 8 -> 0 -> 7
|
||
```
|
||
|
||
## 题目大意
|
||
|
||
这道题是第 2 题的变种题，第 2 题中的 2 个数是从个位逆序排到高位，这样相加只用从头交到尾，进位一直进位即可。这道题目中强制要求不能把链表逆序。2 个数字是从高位排到低位的，这样进位是倒着来的。
|
||
|
||
## 解题思路
|
||
|
||
思路也不难，加法只用把短的链表依次加到长的链表上面来就可以了，最终判断一下最高位有没有进位，有进位再往前进一位。加法的过程可以用到递归。 |