双链表
2. 两数相加(中等)
思路:这道题个位数在前,比较容易。==while() 循环里 l1 != null || l2 != null 用的或。==因为为空的话直接赋值为0不影响。
特别注意while循环后,是否会有溢出。
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode pre = new ListNode(-1);
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;
ListNode node = new ListNode(sum);
cur.next = node;
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;
}
445. 两数相加 II(中等)
思路:这题头节点是高位,最简单的就是两个链表翻转一下,结果也要翻转一次。
进阶:不能对列表中的节点进行翻转如何处理?
一个小tips,逆序处理,似乎一般都会用到栈。
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 sum = carry;
sum += stack1.isEmpty()? 0: stack1.pop();
sum += stack2.isEmpty()? 0: stack2.pop();
ListNode node = new ListNode(sum % 10);
node.next = head;
head = node;
carry = sum / 10;
}
return head;
}
21. 合并两个有序链表(简单)
比较简单的一题。
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null)
return l2;
if (l2 == null)
return l1;
ListNode dummy = new ListNode(-1);
ListNode cur = dummy;
while(l1 != null && l2 != null){
if (l1.val < l2.val){
cur.next = l1;
l1 = l1.next;
cur = cur.next;
}else{
cur.next = l2;
l2 = l2.next;
cur = cur.next;
}
}
if (l1 == null)
cur.next = l2;
if (l2 == null)
cur.next = l1;
return dummy.next;
}