数据结构 判断字符串是否为回文

#include
#include
#define MAXSIZE 100
bool judge()
{
 int n = 0;
 char arr[MAXSIZE], c=0;
 while (c != '#')
 {
  c = getchar();
  arr[n++] = c;
 }
 char *front = arr, *rear = arr + n-2;
 while (rear >= front)
 {
  if (*front != *rear)
   return false;
  front++;
  rear--;
 }
 return true;
}
int main()
{
 if (judge())
  printf("是回文");
 else
  printf("不是回文");
 while (1);
}