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
这个题目意思应该不会出现大数问题,但当时考虑时担心会出现大数问题,所以利用BigInteger 类在做。
思路:把两个ListNode 结点中val 取出来变成 用BigInteger 来表示,然后进行相加,最后放进返回的ListNode中。
import java.math.BigInteger;
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode ans = new ListNode(-1);
String num1 = "";
String num2 = "";
while(l1!=null){
num1+=l1.val;
l1 = l1.next;
}
while(l2!=null){
num2+= l2.val;
l2 = l2.next;
}
ListNode temp = ans;
num1 = reverseString(num1);
num2 = reverseString(num2);
BigInteger b1 = new BigInteger(num1);
BigInteger b2 = new BigInteger(num2);
b1 = b1.add(b2);
while(b1 != BigInteger.ZERO){
if(ans.val == -1){
temp.val = (b1.mod(BigInteger.TEN)).intValue();
}
else {
temp.next = new ListNode((b1.mod(BigInteger.TEN)).intValue());
temp = temp.next;
}
b1 = b1.divide(BigInteger.TEN);
}
return ans;
}
public String reverseString(String str){
String ans = "";
for(int i=str.length()-1;i>=0;i--){
ans+= str.charAt(i);
}
return ans;
}
}
val 标记为-1 就是标记ListNode 还没初始化,为空链表的状态。 刚好也尝试使用java中的大数类相关操作。