C# 代码
public class Solution {
public int FindSmallestInteger(int[] nums, int value) {
int n = nums.Length;
int[] count = new int[value];
for (int i = 0; i < n; i++){
count[(nums[i] % value + value) % value]++;
}
for (int i = 0; i < n; i++){
if (count[i % value] == 0) return i;
count[i % value]--;
}
return n;
}
}