FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm-examples/cpp-algorithm/src/math/combination.cpp at main · codejsha/algorithm-examples · GitHub
codejsha
/
algorithm-examples
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
2
Code
Issues
0
Pull requests
0
Discussions
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm-examples
/
cpp-algorithm
/
src
/
math
/
combination.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
71 lines (63 loc) · 2.24 KB
Breadcrumbs
algorithm-examples
/
cpp-algorithm
/
src
/
math
/
combination.cpp
Copy path
File metadata and controls
71 lines (63 loc) · 2.24 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#
include
"
combination.h
"
void
GenerateCombinationHelper
(
const
std::vector<
int
>& seq,
const
int
k, std::vector<std::vector<
int
>>& result, std::vector<
int
>& current,
const
int
start)
{
if
(
static_cast
<
int
>(current.
size
()) == k)
{
result.
push_back
(current);
return
;
}
for
(
int
i = start; i <
static_cast
<
int
>(seq.
size
()); ++i)
{
current.
push_back
(seq[i]);
GenerateCombinationHelper
(seq, k, result, current, i +
1
);
current.
pop_back
();
}
}
auto
Combination::GenerateCombination
(
const
std::vector<
int
>& seq,
const
int
k) -> std::vector<std::vector<int>>
{
std::vector<std::vector<
int
>> result;
std::vector<
int
> combination;
GenerateCombinationHelper
(seq, k, result, combination,
0
);
return
result;
}
void
GenerateCombinationHelper
(
const
std::vector<std::string>& seq,
const
int
k, std::vector<std::vector<std::string>>& result, std::vector<std::string>& current,
const
int
start)
{
if
(
static_cast
<
int
>(current.
size
()) == k)
{
result.
push_back
(current);
return
;
}
for
(
int
i = start; i <
static_cast
<
int
>(seq.
size
()); ++i)
{
current.
push_back
(seq[i]);
GenerateCombinationHelper
(seq, k, result, current, i +
1
);
current.
pop_back
();
}
}
auto
Combination::GenerateCombination
(
const
std::vector<std::string>& seq,
const
int
k) -> std::vector<std::vector<std::string>>
{
std::vector<std::vector<std::string>> result;
std::vector<std::string> combination;
GenerateCombinationHelper
(seq, k, result, combination,
0
);
return
result;
}
void
GenerateCombinationHelper
(
const
std::string& str,
const
int
k, std::vector<std::string>& result,
const
std::string& current,
const
int
start)
{
if
(k ==
0
)
{
result.
push_back
(current);
return
;
}
for
(
int
i = start; i <=
static_cast
<
int
>(str.
length
()) - k; ++i)
{
std::string new_current = current + str[i];
GenerateCombinationHelper
(str, k -
1
, result, new_current, i +
1
);
}
}
auto
Combination::GenerateCombination
(
const
std::string& str,
const
int
k) -> std::vector<std::string>
{
std::vector<std::string> result;
const
std::string combination;
GenerateCombinationHelper
(str, k, result, combination,
0
);
return
result;
}
Back
|
FazBrowse Home
|
New Git URL