字符串寻找最长回文

//---------------------------------------------------------------------------
#include<stdio.h>
#include<conio.h>
#include<string.h>
#pragma hdrstop

//---------------------------------------------------------------------------

#pragma argsused
//求固定长度字符串的回文长度
int huiwen_jud(char *a_jud,char*b_jud)//a,b 回文开始和结束的地方
{
  char *p1_jud,*p2_jud;
  int sum=0;
  p1_jud = a_jud;p2_jud = b_jud;

  //注意偶回文与奇回文有所不同,奇偶回文只要判断一次就好了，所以循环要放里面

  if((p2_jud-p1_jud)%2 == 0) //奇回文
  {
    while(1)
    {
      if(*p1_jud != *p2_jud)  break;
      if((p2_jud -p1_jud) == 0)
      {
       sum = 1; //判断
       break;
      }//if
      else
       {