给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
题目来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/add-two-numbers
感觉写的很啰嗦,但是不知道哪里可以优化一下。
/**
* 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 oneMov = l1, twoMov=l2;
ListNode resultHeader = new ListNode(0);
int sum=0, carry=0;
ListNode newResultMov = resultHeader;
ListNode temp;
boolean flag = false;
while (oneMov != null && twoMov != null){
if(flag){
temp = new ListNode(0);
newResultMov.next = temp;
newResultMov = temp;
}else {
newResultMov.next = null;
flag = true;
}
sum = oneMov.val + twoMov.val + carry;
carry = sum / 10;
sum = sum % 10;
newResultMov.val = sum;
oneMov = oneMov.next;
twoMov = twoMov.next;
}
temp = null;
if(oneMov!=null){
temp = oneMov;
}else if(twoMov!=null) {
temp = twoMov;
}
oneMov = temp;
while (oneMov!=null && carry>0){
temp = new ListNode(0);
newResultMov.next = temp;
newResultMov = temp;
sum = oneMov.val + carry;
carry = sum / 10;
sum = sum % 10;
newResultMov.val = sum;
oneMov = oneMov.next;
}
if(oneMov == null && carry==0){
return resultHeader;
}else if(carry != 0){
temp = new ListNode(0);
newResultMov.next = temp;
temp.val = carry;
return resultHeader;
}else {
newResultMov.next = oneMov;
}
return resultHeader;
}
}