110,536
社区成员
发帖
与我相关
我的任务
分享
int[] array={3,4,5,6,8,9};
int missingNum=((array[0]+array[array.Length-1])*(array.Length+1))/2-array.Sum();
static int GetValue(int[] n)
{
int low = 0;
int high = n.Length - 1;
while (low < high)
{
int mid = (low + high) / 2;
if (n[mid] > n[0] + mid) high = mid;
else low = mid;
if (high - low == 1)
{
if (n[high] - n[low] == 1) low = high;
break;
}
}
return n[low] + 1;
}