【题目】*445. 两数相加 II
给你两个 非空 链表来代表两个非负整数。数字最高位位于链表开始位置。它们的每个节点只存储一位数字。将这两数相加会返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
进阶:如果输入链表不能修改该如何处理?换句话说,你不能对列表中的节点进行翻转。
示例:
输入:(7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 8 -> 0 -> 7
【解题思路1】逆序处理-栈
/**
* 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) {
Stack<Integer> stack1 = new Stack<>();
Stack<Integer> stack2 = new Stack<>();
while(l1 != null){
stack1.push(l1.val);
l1 = l1.next;
}
while(l2 != null){
stack2.push(l2.val);
l2 = l2.next;
}
int carry = 0;
ListNode head = null;
while(!stack1.isEmpty() || !stack2.isEmpty() || carry > 0){
int x = !stack1.isEmpty() ? stack1.pop() : 0;
int y = !stack2.isEmpty() ? stack2.pop() : 0;
int sum = (x + y + carry) % 10;
carry = (x + y + carry) / 10;
ListNode node = new ListNode(sum);
node.next = head;
head = node;
}
return head;
}
}
【解题思路2】反转链表
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1 == null){
return l2;
}
if(l2 == null){
return l1;
}
ListNode node1 = reverse(l1);
ListNode node2 = reverse(l2);
int carry = 0;
ListNode newHead = new ListNode(0);
ListNode cur = newHead;
while(node1 != null || node2 != null){
int x = node1 != null ? node1.val : 0;
int y = node2 != null ? node2.val : 0;
int num = (x + y + carry) % 10;
carry = (x + y + carry) /10;
ListNode node = new ListNode(num);
cur.next = node;
cur = node;
if(node1 != null){
node1 = node1.next;
}
if(node2 != null){
node2 = node2.next;
}
}
if(carry > 0){
cur.next = new ListNode(carry);
}
ListNode res = reverse(newHead.next);
return res;
}
public ListNode reverse(ListNode head){
if(head == null){
return null;
}
ListNode pre = null;
while(head != null){
ListNode temp_next = head.next;
head.next = pre;
pre = head;
head = temp_next;
}
return pre;
}
}