bool IsH(int n)
{
int* Array = (int*)malloc(sizeof(int));
int tmp = n;
int i = 0,j = 0;
int idx;
while(tmp > 0) //計(jì)輸入整數(shù)的位數(shù)
{
tmp = tmp/10;
i++;
}
i--;
idx = (int)pow((double)10,i);
Array[j] = n/idx;
j++;
while(idx > 1) //Array數(shù)組中存放整數(shù)的每一位
{
Array[j] = (n%idx)/(idx/10);
idx = idx/10;
j++;
}
i = 0; j--;
while(i != j && i != j-1) //判斷是否頭尾相等
{
if(Array[i] != Array[j])
return false;
i++; j--;
}
if(Array[i] != Array[j])
return false;
return true;
}