path: root / pract_SI / Pract. 05 / Solutions / task4.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

bool isPalindrom(const int *arr, int size)
{
	for (int i = 0; i < size / 2; i++)
	{
		if (arr[i] != arr[size - i - 1])
			return false;
	}
	return true;
}

bool isPalindrom(int number)
{
	int buffer[MAX_SIZE];
	int size = 0;
	while (number > 0) //1505
	{
		buffer[size] = number % 10; //5 0 5 1
		number /= 10;
		size++;
	}

	return isPalindrom(buffer, size);
}