int findNearPosition(int array[], int len, int A, int B)
{
if (array == null || len == 0)
return 0;
int A_pos = -1;
int B_pos = -1;
int minDist = len;
for (int i=0; i<len; i++)
{
if (array[i] == A)
{
if (B_pos != -1)
{
minDist = min(i-B_pos, minDist);
}
A_pos = i;
}
if (array[i] == B)
{
if (A_pos != -1)
{
minDist = min(i-A_pos, minDist);
}
B_pos = i;
}
}
return minDist;
}
求数组中两个元素的最小距离
最新推荐文章于 2023-11-27 05:00:00 发布