1
class Solution {
2
 public:
3
  int shortestSequence(vector<int> &rolls, int k) {
4
    int len = 1;
5
    set<int> data;
6

7
    for (int i = 0; i < rolls.size(); i++) {
8
      data.insert(rolls[i]);
9

10
      if (data.size() == k) {
11
        len++;
12
        data = set<int>();
13
      }
14
    }
15

16
    return len;
17
  }
18
};