The second edition of Zhejiang University data structure Exercise 3.5 The inverse of the list m element the answer is a bit wrong.

ElementType Find (list L, int m)  {      list p1 = L;     List P2 = L;      List pLast = NULL;      int c = 0;      while (p1) {          if (c = = m) {              P2 = L;          }          P1 = p1->next;          P2 = p2->next;          PLast = p2;          C + +;      }      if (C > m)        return plast->data;  
    else          return-1;}  

　　

ElementType Find (list L, int m)  {      list pcurrent = L;     List pfind = L;          for (int i =0; i<m;i++)        if (pcurrent)            pcurrent = pcurrent->next;        else            return-1;     while (pcurrent) {        Pfind = pfind->next;        Pcurrent = pcurrent->next;    }    return pfind->data;}

　　

The second edition of Zhejiang University data structure Exercise 3.5 The inverse of the list m element the answer is a bit wrong.