1
class Solution {
2
 public:
3
  int smallestEqual(vector<int> &nums) {
4
    int i = 0;
5
    while (i < nums.size() && i % 10 != nums[i]) i++;
6
    return i >= nums.size() ? -1 : i;
7
  }
8
};