检查字符串是否为回文

Question

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int checkpalindrome(char* a,int n);
int main()
{
    char *a;
    int i,n;
    printf("Enter the size of the string but should be odd => ");
    scanf("%d",&n);
    a=(char*)calloc(n,sizeof(char));
    for(i=0;i<n;i++)
    {
        if(i==(n-1)/2)
        {  printf("Enter X\n");}
        scanf("%c",&a[i]);
    }
    if(checkpalindrome(a,n)){
      printf("\nstring is palindrome");
    }
    else{ 
      printf("\nstring is not a palindrome");
    }
    return 0;
}
int checkpalindrome(char *a,int n)
{
    int i;
    for(i=0;i<n;i++)
    {
        if(a[i]==a[n-i])
          continue;
        else
          return 0;
    }
    return 1;
}

check this code i am not getting proper output here the string should be of a's and b's and X should in middle of the string and we have to check whether the string is palindrome or not.

Answer 1

If you want to implement two stacks in a single array then you will need to divide the SIZE of the initialized array by 2. Then you have to distinguish the two stacks with these basic initialization.

int stack[9], SIZE, max1, max2, top1, top2;
SIZE = 10;
max1 = (SIZE/2) - 1; 
max2 = SIZE - 1;
top1 = -1;
top2 = max1;

so by doing this, they are totally separated. so you should have two push methods push1() and push2 and two pop methods pop1() and pop2() separately written in accordance to the respective stack parameters.