将顺序表所有元素逆置，要求算法空间复杂度为O(1)

typedef struct
{   int len;
    type data[MAX];
}sqList;
int nizhi2(sqList *a)
{
    if(a->len<0)
    return -1;
    for(int i=0;i<=a->len/2;i++)
     {
        a->data[i]+=a->data[a->len-1-i] ;
        a->data[a->len-1-i]=a->data[i]-a->data[a->len-1-i];
        a->data[i]-=a->data[a->len-1-i];
     }
     return 0;
}