//查找节点-C++何洁月教学PPT
//查找节点template int Find(Node *head, T& item, Node* &prevPtr) { Node *currPtr = head; prevPtr = NULL; while(currPtr != NULL) { if (currPtr->data == item) return 1; prevPtr = currPtr; currPtr = currPtr->NextNode( ); } return 0; }
3.83MB
文件大小:
评论区