#include <stdio.h>
#include <math.h>
#include <string.h>
int fh(char c)
{
    if((c>='a'&&c<='z')||(c>='A'&&c<='Z'))
        return(1);
    else
        return(0);
}


int longzf(char b[80])
{
    int i,kg=1,cd=0,cd1=0,dz=0,dz1=0;
    for(i=0;b[i]!='\n';i++)
    {
        if(fh(b[i]))
        {
            if(kg==1)
            {
                dz=i;
                kg=0;
            }
            else
                cd++;
        }
        else
        {
            kg=1;
            if(cd>cd1)
            {               
                cd1=cd;
                cd=0;
                dz1=dz;
            }
        }
    }
    return(dz1);
}


void main()
{
    char a[80];
    int i;
    gets(a);
    for(i=longzf(a);fh(a[i]);i++)
        printf("%c",a[i]);
    printf("\n");
}

目的求一串字符中最长的单词，运行的不完美，当相同长度的单词或者相同的单词过多 输出的结果变成了Actx....
请高手给我说说原因。。。好象是第一个单词最长了就会这样

[ 本帖最后由 hywhll888 于 2011-7-10 20:13 编辑 ]

解决了
#include <stdio.h>
#include <math.h>
#include <string.h>
int fh(char c)
{
    if((c>='a'&&c<='z')||(c>='A'&&c<='Z'))
        return(1);
    else
        return(0);
}


int longzf(char b[80])
{
    int i,kg=1,cd=0,cd1=0,dz=0,dz1=0;
    for(i=0;b[i]!='\0';i++)
    {
        if(fh(b[i]))
        {
            if(kg==1)
            {
                dz=i;
                kg=0;
            }
            else
                cd++;
        }
        else
        {
            kg=1;
            if(cd>cd1)
            {               
                cd1=cd;
                cd=0;
                dz1=dz;
            }
        }
    }
    if(cd>cd1)
    dz1=dz;
    return(dz1);
}


void main()
{
    char a[80];
    int i;
    gets(a);
    for(i=longzf(a);fh(a[i]);i++)
        printf("%c",a[i]);
    printf("\n");
}

加个注释啊

#include <stdio.h>
#include <string.h>

int MaxStr(char *s,char *res)
{
    char *p = s;
    char *q = s;
    int n = 0,max = 0;
    while(*(p-1))
    {
        if(*p>='a' && *p<='z' ||
            *p>='A' && *p<='Z')
        {
            n++;
            p++;
        }
        else if(*p == ' ' || !*p)
        {
            if(n>max)
            {
                q = p-n;               
                max = n;
            }
            p++;
            n = 0;
        }
        else
            p++;
    }
    strncpy(res,q,max);
    return max;
}
int main()
{
    char a[] = "I am  student  studentstudent       student";
    char m[10];
    int n = MaxStr(a,m);
    for(int i = 0;i<n;i++)
        putchar(m[i]);
    printf("\n");
    return 0;
}