path: root/Computer_Science/leetcode/5-longest_palindromic_substring.c~

char* longestPalindrome(char* s) {
	int *lo, *hi;

	*(p + (*hi) + 1) = '0';
	return p + *lo;
}