-
Notifications
You must be signed in to change notification settings - Fork 0
/
trace_back_algs.h
49 lines (35 loc) · 2.12 KB
/
trace_back_algs.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#ifndef TRACE_BACK_ALGS_
#define TRACE_BACK_ALGS_
#include <vector>
#include <string>
namespace track_back
{
// https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/comments/
std::vector<std::string> letterCombinations(std::string digits);
void track_back_for_letter(std::vector<std::string>& combinations, std::string curr, std::string digits);
std::vector<std::string> letterCombinations_v2(std::string digits);
// https://leetcode-cn.com/problems/generate-parentheses/comments/
std::vector<std::string> generateParenthesis(int n);
void track_back_generate_parenthesis(std::vector<std::string>& combinations, std::string curr, int left_count, int right_count, int n);
std::vector<std::string> generateParenthesis_v2(int n);
// https://leetcode-cn.com/problems/sudoku-solver/
void solveSudoku(std::vector<std::vector<char>>& board);
bool track_back_solveSudoku(std::vector<std::vector<char>>& board, int x, int y);
bool is_legal(std::vector<std::vector<char>>& board, int x, int y);
void solveSudoku_v2(std::vector<std::vector<char>>& board);
bool track_back_solveSudoku_v2(std::vector<std::vector<char>>& board, int x, int y,
std::vector<std::vector<bool>> & rows,
std::vector<std::vector<bool>> & cols,
std::vector<std::vector<bool>> & boxs);
void solveSudoku_solver(std::vector<std::vector<char>>& board);
bool solveSudokuHelper(std::vector<std::vector<char>>& board, int n,
std::vector<std::vector<bool>> & rows,
std::vector<std::vector<bool>> & cols,
std::vector<std::vector<bool>> & boxs);
// https://leetcode-cn.com/problems/combination-sum-ii/
std::vector<std::vector<int>> combinationSum2(std::vector<int>& candidates, int target);
void track_back_combination_sum(std::vector<std::vector<int>>& combinations, std::vector<int> curr, std::vector<int>& candidates, int index, int target);
// https://leetcode-cn.com/problems/subsets/
std::vector<std::vector<int>> subsets(std::vector<int>& nums);
} // namespace track_back
#endif // TRACE_BACK_ALGS_