有一个int型数组，每两个相邻的数之间的差值不是1就是-1.现在给定一个数，要求查找这个数在数组中的位置

#include <iostream>
#include <cassert>
using namespace std;


int find(int arr[], unsigned int n, int key)
{
	assert(arr != NULL);
	unsigned int i = 0;
	unsigned int grap = 0;
	while (i<n)
	{
		if (arr[i]==key)
		{
			return i;
		}
		else
		{
			grap = abs(key - arr[i]);
			i += grap;
		}
	}

	return -1;

}
int main()
{
	int arr[6] = {2, 3, 2, 3, 4, 5};
	cout << "坐标为:" << find(arr, 6, 4) << endl;
}