aboutsummaryrefslogtreecommitdiff
path: root/works/solutions/leetcode/cpp/1286.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'works/solutions/leetcode/cpp/1286.cpp')
-rw-r--r--works/solutions/leetcode/cpp/1286.cpp56
1 files changed, 0 insertions, 56 deletions
diff --git a/works/solutions/leetcode/cpp/1286.cpp b/works/solutions/leetcode/cpp/1286.cpp
deleted file mode 100644
index 1ad0d4e..0000000
--- a/works/solutions/leetcode/cpp/1286.cpp
+++ /dev/null
@@ -1,56 +0,0 @@
-#include <string>
-
-using std::string;
-
-#include <vector>
-
-class CombinationIterator {
-public:
- string chars;
- int char_length;
- int combinationLength;
- bool has_next = true;
- std::vector<int> indices;
-
- CombinationIterator(string characters, int combinationLength)
- : chars(characters), char_length(characters.size()),
- combinationLength(combinationLength) {
- for (int i = 0; i < combinationLength; i++) {
- indices.push_back(i);
- }
- }
-
- string next() {
- string result;
- for (auto index : indices) {
- result.push_back(chars[index]);
- }
-
- int count = 1;
- while (indices[combinationLength - count] == char_length - count) {
- count++;
- if (count > combinationLength) {
- has_next = false;
- return result;
- }
- }
-
- indices[combinationLength - count] += 1;
- for (int i = combinationLength - count + 1; i < combinationLength; i++) {
- indices[i] = indices[i - 1] + 1;
- }
-
- return result;
- }
-
- bool hasNext() {
- return has_next;
- }
-};
-
-/**
- * Your CombinationIterator object will be instantiated and called as such:
- * CombinationIterator* obj = new CombinationIterator(characters,
- * combinationLength); string param_1 = obj->next(); bool param_2 =
- * obj->hasNext();
- */ \ No newline at end of file