int compare(sqlist A,sqlist B)
{
    j=0;
    while(j<A.length&&j<B.length)
    {
        if(A.elem[j]<B.elem[j])  return (-1);
        else if(A.elem[j]>B.elem[j])  return(1);
        {
            else j++;
        }
    }
    if(A.length==j<B.length)  return (0);
    else if(A.length<j<B.length)  return (-1);
         else return(1);
}

是比较链表A,B中的元素大小

#include<iostream>
using namespace std;
struct SqList
{
    char elem[100];
    int length;
};
int compare(struct SqList A,struct SqList B)
{
    int j=0;
    while(j<A.length&&j<B.length)
    {
        if(A.elem[j]<B.elem[j]) cout<<1;
        else if(A.elem[j]>B.elem[j])  cout<<2;
            else   j++;
        
    }
    if(A.length==B.length)  cout<<3;
    else if(A.length<B.length)  cout<<4;
         else cout<<5;

}
int main()
{
    int N;
    struct SqList C={"afternnn",8};
    struct SqList D={"afternoon",9};
    N=compare(C,D);
    return 0;
   
}
这是我自己编的。。请教哪里有错？