华为机试题目参考.docVIP

链表逆序 1: CList* converseList(CList *head) 2: { 3: CList *conHead = head; 4: CList *before = NULL; 5: CList *after = NULL; 6: ? 7: while (conHead-next != NULL) 8: { 9: after = conHead-next; 10: conHead-next = before; 11: before = conHead; 12: conHead = after; 13: } 14: ? 15: return *conHead; 16: } LinkList.h view plaincopy to clipboardprint? #ifndef?LINKLIST_H ?? #define?LINKLIST_H ?? ??? typedef?int?ElemType;?? typedef?struct?LNode?? {?? ????ElemType?*data;?? ????struct?LNode?*next;?? ????int?length;?? }LNode,?*LinkList;?? LinkList?initList();?? void?insertList(LinkList?l,?ElemType?*data,?int?sizeOfData);?? int?length(LinkList?l);?? void?reverse(LinkList?l);?? #endif?? ? ? LinkList.c view plaincopy to clipboardprint? #include?LinkList.h ?? #include?stdlib.h ?? #include?string.h ?? //************************************ ?? //?Method:????initList ?? //?FullName:??initList ?? //?Access:????public? ?? //?Returns:???LinkList ?? //?Qualifier: ?? //************************************ ?? LinkList?initList()?? {?? ????LinkList?l?=?0;?? ????l?=?(LinkList)malloc(sizeof(LNode));?? ????if(l?==?NULL)?? ????????return?NULL;?? ????l-data?=?0;?? ????l-next?=?NULL;?? ????l-length?=?0;?? ????return?l;?? }?? //************************************ ?? //?Method:????insertList ?? //?FullName:??insertList ?? //?Access:????public? ?? //?Returns:???void ?? //?Qualifier: ?? //?Parameter:?LinkList?l ?? //?Parameter:?ElemType?*?data ?? //?Parameter:?int?sizeOfData ?? //************************************ ?? void?insertList(LinkList?l,?ElemType?*data,?int?sizeOfData)?? {?? ????LNode?*n?=?0;?? ????if(l?==?NULL?||?data?==?NULL)?? ????????return;?? ????n?=?(LNode?*)malloc(sizeof(LNode));?? ????if(n?==?NULL)?? ????????return;?? ????n-data?=?(ElemType?*)malloc(sizeof(ElemType));?? ????if(n-data?==?NULL)?? ????{?? ????????free(n-data);?? ????????free(n);?? ????????return;?? ????}?? ???