CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 11:41:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Rename the common modules in Java, C++ and C.

Browse Source
This commit is contained in:
krahets
2023-04-24 04:11:18 +08:00
parent c6eecfd0dc
commit 145975b335
120 changed files with 122 additions and 380 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -6,7 +6,7 @@
package chapter_array_and_linkedlist;
import include.*;
import utils.*;
public class linked_list {
/* 在链表的节点 n0 之后插入节点 P */

2
codes/java/chapter_backtracking/preorder_traversal_i_compact.java
View File

@@ -6,7 +6,7 @@
package chapter_backtracking;
import include.*;
import utils.*;
import java.util.*;
public class preorder_traversal_i_compact {

2
codes/java/chapter_backtracking/preorder_traversal_ii_compact.java
View File

@@ -6,7 +6,7 @@
package chapter_backtracking;
import include.*;
import utils.*;
import java.util.*;
public class preorder_traversal_ii_compact {

2
codes/java/chapter_backtracking/preorder_traversal_iii_compact.java
View File

@@ -6,7 +6,7 @@
package chapter_backtracking;
import include.*;
import utils.*;
import java.util.*;
public class preorder_traversal_iii_compact {

2
codes/java/chapter_backtracking/preorder_traversal_iii_template.java
View File

@@ -6,7 +6,7 @@
package chapter_backtracking;
import include.*;
import utils.*;
import java.util.*;
public class preorder_traversal_iii_template {

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

@@ -6,7 +6,7 @@
package chapter_computational_complexity;
import include.*;
import utils.*;
import java.util.*;
public class space_complexity {

2
codes/java/chapter_graph/graph_adjacency_list.java
View File

@@ -7,7 +7,7 @@
package chapter_graph;
import java.util.*;
import include.*;
import utils.*;
/* 基于邻接表实现的无向图类 */
class GraphAdjList {

2
codes/java/chapter_graph/graph_adjacency_matrix.java
View File

@@ -6,7 +6,7 @@
package chapter_graph;
import include.*;
import utils.*;
import java.util.*;
/* 基于邻接矩阵实现的无向图类 */

2
codes/java/chapter_graph/graph_bfs.java
View File

@@ -7,7 +7,7 @@
package chapter_graph;
import java.util.*;
import include.*;
import utils.*;
public class graph_bfs {
/* 广度优先遍历 BFS */

2
codes/java/chapter_graph/graph_dfs.java
View File

@@ -7,7 +7,7 @@
package chapter_graph;
import java.util.*;
import include.*;
import utils.*;
public class graph_dfs {
/* 深度优先遍历 DFS 辅助函数 */

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

@@ -7,7 +7,7 @@
package chapter_hashing;
import java.util.*;
import include.*;
import utils.*;
public class hash_map {
public static void main(String[] args) {

2
codes/java/chapter_heap/heap.java
View File

@@ -6,7 +6,7 @@
package chapter_heap;
import include.*;
import utils.*;
import java.util.*;
public class heap {

2
codes/java/chapter_heap/my_heap.java
View File

@@ -6,7 +6,7 @@
package chapter_heap;
import include.*;
import utils.*;
import java.util.*;
/* 大顶堆 */

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

@@ -6,7 +6,7 @@
package chapter_searching;
import include.*;
import utils.*;
import java.util.*;
public class hashing_search {

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

@@ -6,7 +6,7 @@
package chapter_searching;
import include.*;
import utils.*;
public class linear_search {
/* 线性查找（数组） */

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

@@ -7,7 +7,7 @@
package chapter_stack_and_queue;
import java.util.*;
import include.*;
import utils.*;
/* 基于链表实现的栈 */
class LinkedListStack {

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

@@ -6,7 +6,7 @@
package chapter_tree;
import include.*;
import utils.*;
/* AVL 树 */
class AVLTree {

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

@@ -7,7 +7,7 @@
package chapter_tree;
import java.util.*;
import include.*;
import utils.*;
/* 二叉搜索树 */
class BinarySearchTree {

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

@@ -6,7 +6,7 @@
package chapter_tree;
import include.*;
import utils.*;
public class binary_tree {
public static void main(String[] args) {

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

@@ -6,7 +6,7 @@
package chapter_tree;
import include.*;
import utils.*;
import java.util.*;
public class binary_tree_bfs {

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

@@ -6,7 +6,7 @@
package chapter_tree;
import include.*;
import utils.*;
import java.util.*;
public class binary_tree_dfs {

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

@@ -1,36 +0,0 @@
/**
* File: ListNode.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
*/
package include;
/* Definition for a singly-linked list node */
public class ListNode {
public int val;
public ListNode next;
public ListNode(int x) {
val = x;
}
/* Generate a linked list with an array */
public static ListNode arrToLinkedList(int[] arr) {
ListNode dum = new ListNode(0);
ListNode head = dum;
for (int val : arr) {
head.next = new ListNode(val);
head = head.next;
}
return dum.next;
}
/* Get a list node with specific value from a linked list */
public static ListNode getListNode(ListNode head, int val) {
while (head != null && head.val != val) {
head = head.next;
}
return head;
}
}

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

@@ -1,118 +0,0 @@
/**
* File: PrintUtil.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
*/
package include;
import java.util.*;
class Trunk {
Trunk prev;
String str;
Trunk(Trunk prev, String str) {
this.prev = prev;
this.str = str;
}
};
public class PrintUtil {
/* Print a matrix (Array) */
public static <T> void printMatrix(T[][] matrix) {
System.out.println("[");
for (T[] row : matrix) {
System.out.println(" " + row + ",");
}
System.out.println("]");
}
/* Print a matrix (List) */
public static <T> void printMatrix(List<List<T>> matrix) {
System.out.println("[");
for (List<T> row : matrix) {
System.out.println(" " + row + ",");
}
System.out.println("]");
}
/* Print a linked list */
public static void printLinkedList(ListNode head) {
List<String> list = new ArrayList<>();
while (head != null) {
list.add(String.valueOf(head.val));
head = head.next;
}
System.out.println(String.join(" -> ", list));
}
/**
* The interface of the tree printer
* This tree printer is borrowed from TECHIE DELIGHT
* https://www.techiedelight.com/c-program-print-binary-tree/
*/
public static void printTree(TreeNode root) {
printTree(root, null, false);
}
/* Print a binary tree */
public static void printTree(TreeNode root, Trunk prev, boolean isLeft) {
if (root == null) {
return;
}
String prev_str = " ";
Trunk trunk = new Trunk(prev, prev_str);
printTree(root.right, trunk, true);
if (prev == null) {
trunk.str = "———";
} else if (isLeft) {
trunk.str = "/———";
prev_str = " |";
} else {
trunk.str = "\\———";
prev.str = prev_str;
}
showTrunks(trunk);
System.out.println(" " + root.val);
if (prev != null) {
prev.str = prev_str;
}
trunk.str = " |";
printTree(root.left, trunk, false);
}
/* Helper function to print branches of the binary tree */
public static void showTrunks(Trunk p) {
if (p == null) {
return;
}
showTrunks(p.prev);
System.out.print(p.str);
}
/* Print a hash map */
public static <K, V> void printHashMap(Map<K, V> map) {
for (Map.Entry<K, V> kv : map.entrySet()) {
System.out.println(kv.getKey() + " -> " + kv.getValue());
}
}
/* Print a heap (PriorityQueue) */
public static void printHeap(Queue<Integer> queue) {
List<Integer> list = new ArrayList<>(queue);
System.out.print("堆的数组表示：");
System.out.println(list);
System.out.println("堆的树状表示：");
TreeNode root = TreeNode.listToTree(list);
printTree(root);
}
}

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

@@ -1,67 +0,0 @@
/**
* File: TreeNode.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
*/
package include;
import java.util.*;
/* Definition for a binary tree node. */
public class TreeNode {
public int val; // 节点值
public int height; // 节点高度
public TreeNode left; // 左子节点引用
public TreeNode right; // 右子节点引用
public TreeNode(int x) {
val = x;
}
/* Generate a binary tree given an array */
public static TreeNode listToTree(List<Integer> list) {
int size = list.size();
if (size == 0)
return null;
TreeNode root = new TreeNode(list.get(0));
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
int i = 0;
while (!queue.isEmpty()) {
TreeNode node = queue.poll();
if (++i >= size)
break;
if (list.get(i) != null) {
node.left = new TreeNode(list.get(i));
queue.add(node.left);
}
if (++i >= size)
break;
if (list.get(i) != null) {
node.right = new TreeNode(list.get(i));
queue.add(node.right);
}
}
return root;
}
/* Serialize a binary tree to a list */
public static List<Integer> treeToList(TreeNode root) {
List<Integer> list = new ArrayList<>();
if (root == null)
return list;
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
while (!queue.isEmpty()) {
TreeNode node = queue.poll();
if (node != null) {
list.add(node.val);
queue.add(node.left);
queue.add(node.right);
} else {
list.add(null);
}
}
return list;
}
}

36
codes/java/include/Vertex.java
View File

@@ -1,36 +0,0 @@
/**
* File: Vertex.java
* Created Time: 2023-02-15
* Author: Krahets (krahets@163.com)
*/
package include;
import java.util.*;
/* 顶点类 */
public class Vertex {
public int val;
public Vertex(int val) {
this.val = val;
}
/* 输入值列表 vals ，返回顶点列表 vets */
public static Vertex[] valsToVets(int[] vals) {
Vertex[] vets = new Vertex[vals.length];
for (int i = 0; i < vals.length; i++) {
vets[i] = new Vertex(vals[i]);
}
return vets;
}
/* 输入顶点列表 vets ，返回值列表 vals */
public static List<Integer> vetsToVals(List<Vertex> vets) {
List<Integer> vals = new ArrayList<>();
for (Vertex vet : vets) {
vals.add(vet.val);
}
return vals;
}
}