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

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/cpp/chapter_backtracking/permutations_i.cpp
View File

@ -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) {

2
codes/cpp/chapter_backtracking/permutations_ii.cpp
View File

@ -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) {

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

@ -4,7 +4,7 @@
* Author: Krahets (krahets@163.com)
*/
#include "../include/include.hpp"
#include "../utils/common.hpp"
vector<TreeNode *> res;

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

@ -4,7 +4,7 @@
* Author: Krahets (krahets@163.com)
*/
#include "../include/include.hpp"
#include "../utils/common.hpp"
vector<TreeNode *> path;
vector<vector<TreeNode *>> res;

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

@ -4,7 +4,7 @@
* Author: Krahets (krahets@163.com)
*/
#include "../include/include.hpp"
#include "../utils/common.hpp"
vector<TreeNode *> path;
vector<vector<TreeNode *>> res;

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

@ -4,7 +4,7 @@
* Author: Krahets (krahets@163.com)
*/
#include "../include/include.hpp"
#include "../utils/common.hpp"
/* 判断当前状态是否为解 */
bool isSolution(vector<TreeNode *> &state) {