algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' into binary_search_tree

Browse Source
This commit is contained in:
Yudong Jin
2023-01-10 13:30:38 +08:00
committed by GitHub
parent 96d54bff3a a86bdeb7cd
commit daa28be3e4
215 changed files with 5618 additions and 1642 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/java/chapter_array_and_linkedlist/array.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: array.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

4
codes/java/chapter_array_and_linkedlist/linked_list.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: linked_list.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -29,9 +29,9 @@ public class linked_list {
/* 访问链表中索引为 index 的结点 */
static ListNode access(ListNode head, int index) {
for (int i = 0; i < index; i++) {
head = head.next;
if (head == null)
return null;
head = head.next;
}
return head;
}

2
codes/java/chapter_array_and_linkedlist/list.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: list.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_array_and_linkedlist/my_list.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: my_list.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_computational_complexity/leetcode_two_sum.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: leetcode_two_sum.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_computational_complexity/space_complexity.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: space_complexity.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_computational_complexity/time_complexity.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: time_complexity.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_computational_complexity/worst_best_time_complexity.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: worst_best_time_complexity.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_hashing/array_hash_map.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: hash_map.java
* Created Time: 2022-12-04
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_hashing/hash_map.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: hash_map.java
* Created Time: 2022-12-04
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_searching/binary_search.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_search.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_searching/hashing_search.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: hashing_search.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_searching/linear_search.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: linear_search.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_sorting/bubble_sort.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: bubble_sort.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_sorting/insertion_sort.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: insertion_sort.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

6
codes/java/chapter_sorting/merge_sort.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: merge_sort.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -28,10 +28,10 @@ public class merge_sort {
// 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++
if (i > leftEnd)
nums[k] = tmp[j++];
// 否则，若“右子数组已全部合并完”或“左子数组元素 < 右子数组元素”，则选取左子数组元素，并且 i++
// 否则，若“右子数组已全部合并完”或“左子数组元素 <= 右子数组元素”，则选取左子数组元素，并且 i++
else if (j > rightEnd || tmp[i] <= tmp[j])
nums[k] = tmp[i++];
// 否则，若“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++
// 否则，若“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++
else
nums[k] = tmp[j++];
}

2
codes/java/chapter_sorting/quick_sort.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: quick_sort.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/array_queue.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: array_queue.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/array_stack.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: array_stack.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/deque.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: deque.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/linkedlist_queue.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: linkedlist_queue.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/linkedlist_stack.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: linkedlist_stack.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/queue.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: queue.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

2
codes/java/chapter_stack_and_queue/stack.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: stack.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

8
codes/java/chapter_tree/avl_tree.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: avl_tree.java
* Created Time: 2022-12-10
* Author: Krahets (krahets@163.com)
@ -138,7 +138,7 @@ class AVLTree {
node = child;
} else {
// 子结点数量 = 2 ，则将中序遍历的下个结点删除，并用该结点替换当前结点
TreeNode temp = minNode(node.right);
TreeNode temp = getInOrderNext(node.right);
node.right = removeHelper(node.right, temp.val);
node.val = temp.val;
}
@ -150,8 +150,8 @@ class AVLTree {
return node;
}
/* 获取最小结点 */
private TreeNode minNode(TreeNode node) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
private TreeNode getInOrderNext(TreeNode node) {
if (node == null) return node;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (node.left != null) {

8
codes/java/chapter_tree/binary_search_tree.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_search_tree.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -101,7 +101,7 @@ class BinarySearchTree {
// 子结点数量 = 2
else {
// 获取中序遍历中 cur 的下一个结点
TreeNode nex = min(cur.right);
TreeNode nex = getInOrderNext(cur.right);
int tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
@ -111,8 +111,8 @@ class BinarySearchTree {
return cur;
}
/* 获取最小结点 */
public TreeNode min(TreeNode root) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
public TreeNode getInOrderNext(TreeNode root) {
if (root == null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left != null) {

2
codes/java/chapter_tree/binary_tree.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_tree.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

5
codes/java/chapter_tree/binary_tree_bfs.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_tree_bfs.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -30,8 +30,7 @@ public class binary_tree_bfs {
public static void main(String[] args) {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
TreeNode root = TreeNode.arrToTree(new Integer[] {
1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null });
TreeNode root = TreeNode.arrToTree(new Integer[] { 1, 2, 3, 4, 5, 6, 7 });
System.out.println("\n初始化二叉树\n");
PrintUtil.printTree(root);

5
codes/java/chapter_tree/binary_tree_dfs.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_tree_dfs.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -43,8 +43,7 @@ public class binary_tree_dfs {
public static void main(String[] args) {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
TreeNode root = TreeNode.arrToTree(new Integer[] {
1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null});
TreeNode root = TreeNode.arrToTree(new Integer[] { 1, 2, 3, 4, 5, 6, 7 });
System.out.println("\n初始化二叉树\n");
PrintUtil.printTree(root);

2
codes/java/include/ListNode.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: ListNode.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

10
codes/java/include/PrintUtil.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: PrintUtil.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -8,6 +8,7 @@ package include;
import java.util.*;
class Trunk {
Trunk prev;
String str;
@ -103,4 +104,11 @@ public class PrintUtil {
System.out.println(kv.getKey() + " -> " + kv.getValue());
}
}
public static void printHeap(PriorityQueue<Integer> queue) {
Integer[] nums = (Integer[])queue.toArray();
TreeNode root = TreeNode.arrToTree(nums);
printTree(root);
}
}

26
codes/java/include/TreeNode.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: TreeNode.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -22,7 +22,7 @@ public class TreeNode {
}
/**
* Generate a binary tree with an array
* Generate a binary tree given an array
* @param arr
* @return
*/
@ -32,19 +32,19 @@ public class TreeNode {
TreeNode root = new TreeNode(arr[0]);
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
int i = 1;
int i = 0;
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
if (++i >= arr.length) break;
if(arr[i] != null) {
node.left = new TreeNode(arr[i]);
queue.add(node.left);
}
i++;
if (++i >= arr.length) break;
if(arr[i] != null) {
node.right = new TreeNode(arr[i]);
queue.add(node.right);
}
i++;
}
return root;
}
@ -71,20 +71,4 @@ public class TreeNode {
}
return list;
}
/**
* Get a tree node with specific value in a binary tree
* @param root
* @param val
* @return
*/
public static TreeNode getTreeNode(TreeNode root, int val) {
if (root == null)
return null;
if (root.val == val)
return root;
TreeNode left = getTreeNode(root.left, val);
TreeNode right = getTreeNode(root.right, val);
return left != null ? left : right;
}
}