1
class Solution {
2
  public int smallestEqual(int[] nums) {
3
    int index = 0;
4
    for (int i = 0; i < nums.length; i++) {
5
      if (index == nums[i]) {
6
        return i;
7
      }
8
      if (++index == 10) {
9
        index = 0;
10
      }
11
    }
12
    return -1;
13
  }
14
}