Algorithms/algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update LinkedListAlgo.java

Browse Source
This commit is contained in:
Shao 2019-06-27 20:42:04 +08:00
parent 1e8a82ebef
commit 5bdf84d5a8
1 changed files with 64 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

91
java/07_linkedlist/LinkedListAlgo.java
View File

@ -41,41 +41,74 @@ public class LinkedListAlgo {
}
// 有序链表合并
public static Node mergeSortedLists(Node la, Node lb) {
if (la == null) return lb;
if (lb == null) return la;
// public static Node mergeSortedLists(Node la, Node lb) {
// if (la == null) return lb;
// if (lb == null) return la;
Node p = la;
Node q = lb;
Node head;
if (p.data < q.data) {
head = p;
// Node p = la;
// Node q = lb;
// Node head;
// if (p.data < q.data) {
// head = p;
// p = p.next;
// } else {
// head = q;
// q = q.next;
// }
// Node r = head;
// while (p != null && q != null) {
// if (p.data < q.data) {
// r.next = p;
// p = p.next;
// } else {
// r.next = q;
// q = q.next;
// }
// r = r.next;
// }
// if (p != null) {
// r.next = p;
// } else {
// r.next = q;
// }
// return head;
//}
//-----------------------------------------
// 有序链表合并 Leetcode 21
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode soldier = new ListNode(0); //利用哨兵结点简化实现难度 技巧三
ListNode p = soldier;
while ( l1 != null && l2 != null ){
if ( l1.val < l2.val ){
p.next = l1;
l1 = l1.next;
}
else{
p.next = l2;
l2 = l2.next;
}
p = p.next;
} else {
head = q;
q = q.next;
}
Node r = head;
while (p != null && q != null) {
if (p.data < q.data) {
r.next = p;
p = p.next;
} else {
r.next = q;
q = q.next;
}
r = r.next;
}
if (p != null) {
r.next = p;
} else {
r.next = q;
if (l1 != null) { p.next = l1; }
if (l2 != null) { p.next = l2; }
return soldier.next;
}
return head;
}
// 删除倒数第K个结点
public static Node deleteLastKth(Node list, int k) {