#include<bits/stdc++.h>
using namespace std;
int n = 10, a[110] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int find(int x)
{
	int left = 1, right = n, mid, ans = -1;
	while(left <= right)
	{
		mid = (left + right) / 2;
		if(a[mid] == x)
		{
			ans == mid;
			break;
		}
		else if(a[mid] < x) left = mid + 1;
		else if(a[mid] > x) right = mid - 1;
	}
	return ans;
}
int main()
{
	cout << find(2);
	return 0;
}

有大佬可以帮我看看问题出在哪了吗