[第二轮] 2/25-3/3 CareerCup 2.5

https://github.com/quantumrose/C ... r/2.5.AddLists.java
forward: pad zeros in front of shorter list

https://gist.github.com/lazyGoose/5061684
reverseOrlder, calculate each sum, and create a sumNode, add the every result.

I am here to copy the second solution :)

* Problem 2.5: add two numbers in the list
* Solution: add it up one digit by digit, indicate the carry digit, if one list is ended, fill 0; insert the sum to the tail of the list
* Follow up: use stacks to store the list, and then same strategy as above, only thing to pay attention is this time, the sum result should be insert from the head of the list.

c/c++实现

https://github.com/StanleyLee/CareerCup/blob/master/2_5.cpp

直接一位一位加

follow up:
先比较位数，不一样长，在头补零，然后再用递归相加

https://gist.github.com/skxie/8cbafe1200d970f50aa5

https://gist.github.com/flatlight/5069988
链表版的高精度算法
第二题直接reverse了。。不过应该不是interviewer想要的答案，回头再写一下padding zero的方法

https://gist.github.com/ThunderXu/5070704
Backward. Add nums and save the answer to a new list, add carry if it is necessary.
Forward. Calculate the diff of digits first and add nums, save answer to a new list, use recursion to ensure that a digit can get the number of carry from latter digits when calculation.

看了大家的方法，感覺我的這個很不靠譜，不能計算大數的加法，以後再改改。
* Method: Get the values from list, add them, create a list from the summary.
* FOLLOW UP: Vice versa.
C Language：
https://gist.github.com/hukun01/5074045

https://github.com/1094401996/Ca ... wodot5/Reverse.java
follow up
https://github.com/1094401996/Ca ... wodot5/forward.java

https://gist.github.com/

this is my sol