Number of palindromes in C language (leetcode)

Give you an integer x , If x Is a palindrome integer , return true ; otherwise , return false .

Palindrome number refers to positive order （ From left to right ） Reverse order （ From right to left ） Read all the same integers .

for example ,121 It's palindrome. , and 123 No .

 

 

 

  Part of the code is as follows :

int isPalindrome(int x) {
	char a[100];

	sprintf(a, "%d", x);// Integer x, Convert to string a in 

	int left = 0, right = 0;// Judge inward from both sides of the array , Define two left and right indexes 
	right = strlen(a) - 1;// Array from 0 Start , Minus one digit 

	for (right, left; right > left; right--, left++)
		// You judge inward from the head and tail , Index of the head ++, Tail index --, If the index of the header is larger than the index of the tail , Explain that the judgment is complete 
	{
		if (a[right] != a[left])
		{
			return 0;
		}
	}
	return 1;
}

The complete code has been put into github:

GitHub - frankRenlf/c_dailyWorkhttps://github.com/frankRenlf/c_dailyWork.git

If you have questions, you can point out in the comments , If you think it's OK, give me praise and attention

You can also focus on this series , There will be updates later , And other code output