本文内容:
1、我的错误解答(java)
2、我的正确解答(java)
3、官方解答(c++)
题目:
给定两个非空链表来代表两个非负数,位数按照逆序方式存储,它们的每个节点只存储单个数字。将这两数相加会返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因: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 ln = l1;
int hit = 0;
long sum = 0;
while (ln.next != null) {
sum = sum + ln.val * (long) Math.pow(10, hit);
ln = ln.next;
hit++;
}
sum = sum + ln.val * (long) Math.pow(10, hit);
ListNode ln2 = l2;
int hit2 = 0;
long sum2 = 0;
while (ln2.next != null) {
sum2 = sum2 + ln2.val * (long) Math.pow(10, hit2);
ln2 = ln2.next;
hit2++;
}
sum2 = sum2 + ln2.val * (long) Math.pow(10, hit2);
long sum3 = sum + sum2;
String sum3Str = String.valueOf(sum3);
//ascii码表中48表示'0',-48的目的是将ascii码值和数字值进行转换
ListNode res = new ListNode((int) sum3Str.charAt(sum3Str.length() - 1)-48);
ListNode temp = res;
//从尾部向链表插入
for (int i = sum3Str.length() - 2; i >= 0; i--) {
while (temp.next != null) {
temp = temp.next;
}
ListNode appendNode = new ListNode((int) sum3Str.charAt(i)-48);
temp.next = appendNode;
}
return res;
}
}
上面的解答不是完全正确的,当数值超过long整型的承受范围就失败了:
我的正确解答(java)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
/**
* 思路:
* 1、链表对应结点相加时增加前一个结点的进位,并保存下一个结点的进位;
* 2、两个链表长度不一致时,要处理较长链表剩余的高位和进位计算的值;
* 3、如果最高位计算时还产生进位,则还需要添加一个额外结点。
* @param l1
* @param l2
* @return
*/
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode res = new ListNode(0);
//用来存放l1和l2对应节点值相加的值
int sum = 0;
//用来存放进位值
int j = 0;
//当l1和l2对应节点都有值时,即长度的交集
while (l1 != null && l2 != null) {
sum = l1.val + l2.val + j;
//进位值清空
j = 0;
//从节点最后添加元素
ListNode temp = res;
while (temp.next != null) {
temp = temp.next;
}
if (sum < 10) {
temp.next = new ListNode(sum);
} else {
temp.next = new ListNode(sum % 10);
//进位值加1
j = 1;
}
l1 = l1.next;
l2 = l2.next;
}
//当l1节点还没遍历完
while (l1 != null) {
//从节点最后添加元素
ListNode temp = res;
while (temp.next != null) {
temp = temp.next;
}
if (j != 0) {
sum = l1.val + j;
l1.val += 1;
j = 0;
}
if (sum < 10) {
temp.next = new ListNode(l1.val);
} else {
temp.next = new ListNode(sum % 10);
j = 1;
}
l1 = l1.next;
}
while (l2 != null) {
ListNode temp = res;
while (temp.next != null) {
temp = temp.next;
}
if (j != 0) {
sum = l2.val + j;
l2.val += 1;
j = 0;
}
if (sum < 10) {
temp.next = new ListNode(l2.val);
} else {
temp.next = new ListNode(sum % 10);
j = 1;
}
l2 = l2.next;
}
//如果有进位,但l1和l2已经被遍历完了
if (j != 0) {
ListNode temp = res;
while (temp.next != null) {
temp = temp.next;
}
temp.next = new ListNode(j);
j = 0;
}
//删除头结点,并且返回
return res.next;
}
}
官方解答(c++)
//结点数据结构
struct ListNode {
ListNode(int x) : val(x), next(NULL){}
int val;
ListNode *next;
};
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
ListNode preHead(0), *p = &preHead;
int carry = 0;
while (l1 || l2 || carry) {
int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
carry = sum / 10;
p->next = new ListNode(sum % 10);
p = p->next;
l1 = l1 ? l1->next : l1;
l2 = l2 ? l2->next : l2;
}
return preHead.next;
};