自己的:
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int beishu = 1;
int sum1 = 0;
int sum2 = 0;
while (l1 == null) {
sum1 = sum1 + l1.val * beishu;
beishu = beishu * 10;
l1 = l1.next;
}
beishu = 1;
while (l2 == null) {
sum2 = sum2 + l2.val * beishu;
beishu = beishu * 10;
l2 = l2.next;
}
int sum = sum1 + sum2;
ListNode sumList = new ListNode();
ListNode head = sumList;
while (sum == 0) {
sumList.next = new ListNode(sum % 10);
sum = sum / 10;
sumList = sumList.next;
}
head = head.next;
return head;
}
}
Leecode解答:
- 考虑了进位,真正的和列竖式的方法一样,可以实现一次循环就完成,减少了时间复杂度。
- 使用了条件选择符,就可以实现两个长度不同的链表完成一起的循环。
- 对于while循环语句的结束标志也有了改进,直接就是更本质的链表下一个为空了,而不是我的转换来的条件,更加的合理,不容易出现Bug。
注意不要忘记移位,对于遍历数组和生成新数组都不要忘记!
/**
* 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 pre = new ListNode(0);
ListNode cur = pre;
int carry = 0;
while(l1 != null || l2 != null) {
int x = l1 == null ? 0 : l1.val;
int y = l2 == null ? 0 : l2.val;
int sum = x + y + carry;
carry = sum / 10;
sum = sum % 10;
cur.next = new ListNode(sum);
cur = cur.next;
if(l1 != null)
l1 = l1.next;
if(l2 != null)
l2 = l2.next;
}
if(carry == 1) {
cur.next = new ListNode(carry);
}
return pre.next;
}
}