[LeetCode] Valid Palindrome II

bool Check(string str, int s, int e)
{
	while (s <= e)
	{
		if (str[s++] != str[e--])
			return false;
	}
	return true;
}

bool validPalindrome(string str) 
{
	int s = 0, e = str.length() - 1;

	while (s <= e)
	{
		if (str[s] != str[e])
			return Check(str, s + 1, e) || Check(str, s, e - 1);

		s++;
		e--;
	}
	return true;
}