bug player name "u" and "r" about sscanf HOT 7 CLOSED

mathMin(inp1,inp2)
	return (inp1 > inp2 ? inp2 : inp1);

LevenshteinDistance(strs[], strt[])
{
	new n = strlen(strs), m = strlen(strt);
	
	new d[128][128];

	if (n == 0)
		return m;

	if (m == 0)
		return n;

	for (new i; i <= n; i++)
		d[i][0] = i;
	
	for (new j; j <= m; j++)
		d[0][j] = j;

	for (new j = 1; j <= m; j++)
	{
		for (new i = 1; i <= n; i++)
		{
			if (strs[i - 1] == strt[j - 1])
				d[i][j] = d[i - 1][j - 1];
			else
				d[i][j] = mathMin(mathMin(d[i - 1][j] + 1, d[i][j - 1] + 1), d[i - 1][j - 1] + 1);
		}
	}
	return d[n][m];
}

SSCANF:pname(string[])
{
	new Iterator:selected<MAX_PLAYERS>;
	new distance[MAX_PLAYERS], least = MAX_PLAYER_NAME;
	
	foreach(new i: Player)
	{
		new name[MAX_PLAYER_NAME];
		GetPlayerName(i, name, sizeof(name));
		
		if(strfind(name, string, true) != -1)
		{
			distance = LevenshteinDistance(string, name);
			
			if(least > distance)
			{
				Iter_Add(selected, i);
				least = distance;
			}
		}
	}
	
	return Iter_Last(selected);
}

new Array_GetPlayerID[MAX_PLAYERS];
stock GetPlayerIDFromName(name[])
{
	new need_len = strlen(name);
	new count = 0;
	forPlayers(i)
	{
		if(strlen(PN(i)) == need_len) Array_GetPlayerID[count++] = i;
	}
	for(new i = 0; i < count; i++)
	{
		if(!strcmp(name, PN(Array_GetPlayerID[i]), false))
		{
			return Array_GetPlayerID[i];
		}
	}
	return INVALID_PLAYER_ID;
}