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

2025-11-02 12:58:42 +08:00 · 2023-04-24 04:11:18 +08:00
parent c6eecfd0dc
commit 145975b335
120 changed files with 122 additions and 380 deletions
--- a/codes/cpp/chapter_array_and_linkedlist/array.cpp
+++ b/codes/cpp/chapter_array_and_linkedlist/array.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 随机返回一个数组元素 */
 int randomAccess(int *nums, int size) {
--- a/codes/cpp/chapter_array_and_linkedlist/linked_list.cpp
+++ b/codes/cpp/chapter_array_and_linkedlist/linked_list.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 在链表的节点 n0 之后插入节点 P */
 void insert(ListNode *n0, ListNode *P) {
--- a/codes/cpp/chapter_array_and_linkedlist/list.cpp
+++ b/codes/cpp/chapter_array_and_linkedlist/list.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* Driver Code */
 int main() {
--- a/codes/cpp/chapter_array_and_linkedlist/my_list.cpp
+++ b/codes/cpp/chapter_array_and_linkedlist/my_list.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 列表类简易实现 */
 class MyList {
--- a/codes/cpp/chapter_backtracking/permutations_i.cpp
+++ b/codes/cpp/chapter_backtracking/permutations_i.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 回溯算法：全排列 I */
 void backtrack(vector<int> &state, const vector<int> &choices, vector<bool> &selected, vector<vector<int>> &res) {
--- a/codes/cpp/chapter_backtracking/permutations_ii.cpp
+++ b/codes/cpp/chapter_backtracking/permutations_ii.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 回溯算法：全排列 II */
 void backtrack(vector<int> &state, const vector<int> &choices, vector<bool> &selected, vector<vector<int>> &res) {
--- a/codes/cpp/chapter_backtracking/preorder_traversal_i_compact.cpp
+++ b/codes/cpp/chapter_backtracking/preorder_traversal_i_compact.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 vector<TreeNode *> res;

--- a/codes/cpp/chapter_backtracking/preorder_traversal_ii_compact.cpp
+++ b/codes/cpp/chapter_backtracking/preorder_traversal_ii_compact.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 vector<TreeNode *> path;
 vector<vector<TreeNode *>> res;
--- a/codes/cpp/chapter_backtracking/preorder_traversal_iii_compact.cpp
+++ b/codes/cpp/chapter_backtracking/preorder_traversal_iii_compact.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 vector<TreeNode *> path;
 vector<vector<TreeNode *>> res;
--- a/codes/cpp/chapter_backtracking/preorder_traversal_iii_template.cpp
+++ b/codes/cpp/chapter_backtracking/preorder_traversal_iii_template.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 判断当前状态是否为解 */
 bool isSolution(vector<TreeNode *> &state) {
--- a/codes/cpp/chapter_binary_search/binary_search.cpp
+++ b/codes/cpp/chapter_binary_search/binary_search.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 二分查找（双闭区间） */
 int binarySearch(vector<int> &nums, int target) {
--- a/codes/cpp/chapter_computational_complexity/space_complexity.cpp
+++ b/codes/cpp/chapter_computational_complexity/space_complexity.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 函数 */
 int func() {
--- a/codes/cpp/chapter_computational_complexity/time_complexity.cpp
+++ b/codes/cpp/chapter_computational_complexity/time_complexity.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 常数阶 */
 int constant(int n) {
--- a/codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp
+++ b/codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
 vector<int> randomNumbers(int n) {
--- a/codes/cpp/chapter_graph/graph_adjacency_list.cpp
+++ b/codes/cpp/chapter_graph/graph_adjacency_list.cpp
@ -4,7 +4,7 @@
 * Author: what-is-me (whatisme@outlook.jp), Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于邻接表实现的无向图类 */
 class GraphAdjList {
--- a/codes/cpp/chapter_graph/graph_adjacency_matrix.cpp
+++ b/codes/cpp/chapter_graph/graph_adjacency_matrix.cpp
@ -4,7 +4,7 @@
 * Author: what-is-me (whatisme@outlook.jp)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于邻接矩阵实现的无向图类 */
 class GraphAdjMat {
--- a/codes/cpp/chapter_graph/graph_bfs.cpp
+++ b/codes/cpp/chapter_graph/graph_bfs.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"
 #include "./graph_adjacency_list.cpp"

 /* 广度优先遍历 BFS */
--- a/codes/cpp/chapter_graph/graph_dfs.cpp
+++ b/codes/cpp/chapter_graph/graph_dfs.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"
 #include "./graph_adjacency_list.cpp"

 /* 深度优先遍历 DFS 辅助函数 */
--- a/codes/cpp/chapter_hashing/array_hash_map.cpp
+++ b/codes/cpp/chapter_hashing/array_hash_map.cpp
@ -4,7 +4,7 @@
 * Author: msk397 (machangxinq@gmail.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 键值对 int->String */
 struct Entry {
--- a/codes/cpp/chapter_hashing/hash_map.cpp
+++ b/codes/cpp/chapter_hashing/hash_map.cpp
@ -4,7 +4,7 @@
 * Author: msk397 (machangxinq@gmail.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* Driver Code */
 int main() {
--- a/codes/cpp/chapter_heap/heap.cpp
+++ b/codes/cpp/chapter_heap/heap.cpp
@ -4,7 +4,7 @@
 * Author: LoneRanger(836253168@qq.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 void testPush(priority_queue<int> &heap, int val) {
    heap.push(val); // 元素入堆
--- a/codes/cpp/chapter_heap/my_heap.cpp
+++ b/codes/cpp/chapter_heap/my_heap.cpp
@ -4,7 +4,7 @@
 * Author: LoneRanger (836253168@qq.com), what-is-me (whatisme@outlook.jp)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 大顶堆 */
 class MaxHeap {
--- a/codes/cpp/chapter_searching/hashing_search.cpp
+++ b/codes/cpp/chapter_searching/hashing_search.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 哈希查找（数组） */
 int hashingSearchArray(unordered_map<int, int> map, int target) {
--- a/codes/cpp/chapter_searching/leetcode_two_sum.cpp
+++ b/codes/cpp/chapter_searching/leetcode_two_sum.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 方法一：暴力枚举 */
 vector<int> twoSumBruteForce(vector<int> &nums, int target) {
--- a/codes/cpp/chapter_searching/linear_search.cpp
+++ b/codes/cpp/chapter_searching/linear_search.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 线性查找（数组） */
 int linearSearchArray(vector<int> &nums, int target) {
--- a/codes/cpp/chapter_sorting/bubble_sort.cpp
+++ b/codes/cpp/chapter_sorting/bubble_sort.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 冒泡排序 */
 void bubbleSort(vector<int> &nums) {
--- a/codes/cpp/chapter_sorting/bucket_sort.cpp
+++ b/codes/cpp/chapter_sorting/bucket_sort.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 桶排序 */
 void bucketSort(vector<float> &nums) {
--- a/codes/cpp/chapter_sorting/counting_sort.cpp
+++ b/codes/cpp/chapter_sorting/counting_sort.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 计数排序 */
 // 简单实现，无法用于排序对象
--- a/codes/cpp/chapter_sorting/insertion_sort.cpp
+++ b/codes/cpp/chapter_sorting/insertion_sort.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 插入排序 */
 void insertionSort(vector<int> &nums) {
--- a/codes/cpp/chapter_sorting/merge_sort.cpp
+++ b/codes/cpp/chapter_sorting/merge_sort.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 合并左子数组和右子数组 */
 // 左子数组区间 [left, mid]
--- a/codes/cpp/chapter_sorting/quick_sort.cpp
+++ b/codes/cpp/chapter_sorting/quick_sort.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 快速排序类 */
 class QuickSort {
--- a/codes/cpp/chapter_sorting/radix_sort.cpp
+++ b/codes/cpp/chapter_sorting/radix_sort.cpp
@ -5,7 +5,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 获取元素 num 的第 k 位，其中 exp = 10^(k-1) */
 int digit(int num, int exp) {
--- a/codes/cpp/chapter_stack_and_queue/array_deque.cpp
+++ b/codes/cpp/chapter_stack_and_queue/array_deque.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于环形数组实现的双向队列 */
 class ArrayDeque {
--- a/codes/cpp/chapter_stack_and_queue/array_queue.cpp
+++ b/codes/cpp/chapter_stack_and_queue/array_queue.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于环形数组实现的队列 */
 class ArrayQueue {
--- a/codes/cpp/chapter_stack_and_queue/array_stack.cpp
+++ b/codes/cpp/chapter_stack_and_queue/array_stack.cpp
@ -4,7 +4,7 @@
 * Author: qualifier1024 (2539244001@qq.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于数组实现的栈 */
 class ArrayStack {
--- a/codes/cpp/chapter_stack_and_queue/deque.cpp
+++ b/codes/cpp/chapter_stack_and_queue/deque.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* Driver Code */
 int main() {
--- a/codes/cpp/chapter_stack_and_queue/linkedlist_deque.cpp
+++ b/codes/cpp/chapter_stack_and_queue/linkedlist_deque.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 双向链表节点 */
 struct DoublyListNode {
--- a/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp
+++ b/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于链表实现的队列 */
 class LinkedListQueue {
--- a/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp
+++ b/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp
@ -4,7 +4,7 @@
 * Author: qualifier1024 (2539244001@qq.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 基于链表实现的栈 */
 class LinkedListStack {
--- a/codes/cpp/chapter_stack_and_queue/queue.cpp
+++ b/codes/cpp/chapter_stack_and_queue/queue.cpp
@ -4,7 +4,7 @@
 * Author: qualifier1024 (2539244001@qq.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* Driver Code */
 int main() {
--- a/codes/cpp/chapter_stack_and_queue/stack.cpp
+++ b/codes/cpp/chapter_stack_and_queue/stack.cpp
@ -4,7 +4,7 @@
 * Author: qualifier1024 (2539244001@qq.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* Driver Code */
 int main() {
--- a/codes/cpp/chapter_tree/avl_tree.cpp
+++ b/codes/cpp/chapter_tree/avl_tree.cpp
@ -4,7 +4,7 @@
 * Author: what-is-me (whatisme@outlook.jp)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* AVL 树 */
 class AVLTree {
--- a/codes/cpp/chapter_tree/binary_search_tree.cpp
+++ b/codes/cpp/chapter_tree/binary_search_tree.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 二叉搜索树 */
 class BinarySearchTree {
--- a/codes/cpp/chapter_tree/binary_tree.cpp
+++ b/codes/cpp/chapter_tree/binary_tree.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* Driver Code */
 int main() {
--- a/codes/cpp/chapter_tree/binary_tree_bfs.cpp
+++ b/codes/cpp/chapter_tree/binary_tree_bfs.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 /* 层序遍历 */
 vector<int> levelOrder(TreeNode *root) {
--- a/codes/cpp/chapter_tree/binary_tree_dfs.cpp
+++ b/codes/cpp/chapter_tree/binary_tree_dfs.cpp
@ -4,7 +4,7 @@
 * Author: Krahets (krahets@163.com)
 */

-#include "../include/include.hpp"
+#include "../utils/common.hpp"

 // 初始化列表，用于存储遍历序列
 vector<int> vec;
--- a/codes/cpp/include/CMakeLists.txt
+++ b/codes/cpp/include/CMakeLists.txt
@ -1,4 +0,0 @@
-add_executable(include
-        include.hpp PrintUtil.hpp
-        ListNode.hpp TreeNode.hpp
-        Vertex.hpp)
--- a/codes/cpp/utils/CMakeLists.txt
+++ b/codes/cpp/utils/CMakeLists.txt
@ -0,0 +1,4 @@
+add_executable(utils
+        common.hpp print_utils.hpp
+        list_node.hpp tree_node.hpp
+        vertex.hpp)
--- a/codes/cpp/include/include.hpp
+++ b/codes/cpp/include/include.hpp
@ -1,5 +1,5 @@
 /**
- * File: PrintUtil.hpp
+ * File: common.hpp
 * Created Time: 2021-12-19
 * Author: Krahets (krahets@163.com)
 */
@ -20,9 +20,9 @@
 #include <unordered_set>
 #include <vector>

-#include "ListNode.hpp"
-#include "PrintUtil.hpp"
-#include "TreeNode.hpp"
-#include "Vertex.hpp"
+#include "list_node.hpp"
+#include "print_utils.hpp"
+#include "tree_node.hpp"
+#include "vertex.hpp"

 using namespace std;
--- a/codes/cpp/include/ListNode.hpp
+++ b/codes/cpp/include/ListNode.hpp
@ -1,5 +1,5 @@
 /**
- * File: PrintUtil.hpp
+ * File: list_node.hpp
 * Created Time: 2021-12-19
 * Author: Krahets (krahets@163.com)
 */
--- a/codes/cpp/utils/print_utils.hpp
+++ b/codes/cpp/utils/print_utils.hpp
@ -1,13 +1,13 @@
 /**
- * File: PrintUtil.hpp
+ * File: print_utils.hpp
 * Created Time: 2021-12-19
 * Author: Krahets (krahets@163.com), msk397 (machangxinq@gmail.com), LoneRanger(836253168@qq.com)
 */

 #pragma once

-#include "ListNode.hpp"
-#include "TreeNode.hpp"
+#include "list_node.hpp"
+#include "tree_node.hpp"
 #include <climits>
 #include <iostream>
 #include <sstream>
--- a/codes/cpp/include/TreeNode.hpp
+++ b/codes/cpp/include/TreeNode.hpp
@ -1,5 +1,5 @@
 /**
- * File: PrintUtil.hpp
+ * File: tree_node.hpp
 * Created Time: 2021-12-19
 * Author: Krahets (krahets@163.com)
 */
--- a/codes/cpp/include/Vertex.hpp
+++ b/codes/cpp/include/Vertex.hpp
@ -1,5 +1,5 @@
 /**
- * File: PrintUtil.hpp
+ * File: vertex.hpp
 * Created Time: 2023-03-02
 * Author: Krahets (krahets@163.com)
 */