Class CombinationIterator
java.lang.Object
g1201_1300.s1286_iterator_for_combination.CombinationIterator
1286 - Iterator for Combination.<p>Medium</p>
<p>Design the <code>CombinationIterator</code> class:</p>
<ul>
<li><code>CombinationIterator(string characters, int combinationLength)</code> Initializes the object with a string <code>characters</code> of <strong>sorted distinct</strong> lowercase English letters and a number <code>combinationLength</code> as arguments.</li>
<li><code>next()</code> Returns the next combination of length <code>combinationLength</code> in <strong>lexicographical order</strong>.</li>
<li><code>hasNext()</code> Returns <code>true</code> if and only if there exists a next combination.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><strong>Input</strong> [“CombinationIterator”, “next”, “hasNext”, “next”, “hasNext”, “next”, “hasNext”] [[“abc”, 2], [], [], [], [], [], []]</p>
<p><strong>Output:</strong> [null, “ab”, true, “ac”, true, “bc”, false]</p>
<p><strong>Explanation:</strong> CombinationIterator itr = new CombinationIterator(“abc”, 2); itr.next(); // return “ab” itr.hasNext(); // return True itr.next(); // return “ac” itr.hasNext(); // return True itr.next(); // return “bc” itr.hasNext(); // return False</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= combinationLength <= characters.length <= 15</code></li>
<li>All the characters of <code>characters</code> are <strong>unique</strong>.</li>
<li>At most <code>10<sup>4</sup></code> calls will be made to <code>next</code> and <code>hasNext</code>.</li>
<li>It is guaranteed that all calls of the function <code>next</code> are valid.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
CombinationIterator
-
-
Method Details
-
next
-
hasNext
public boolean hasNext()
-