题目:
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
需要考虑的几种情况:
<1>L1和L2都为空,输出为空
<2>L1、L2中有一个为空,另一个不为空
<3>L1、L2都不为空
如果把第二种情况当成第三种L1、L2长度不一致进行考虑,需要注意一下几个问题:
①长度不一致,假设L1还有数据,L2已经为空,怎么处理L2的val
②对于500+500的情况,会有一个进位产生,怎么处理进位
代码附上,后期看到优质代码重新更新博客。