We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly Cancel Create saved search Sign in Sign up Reseting focus {...
解:链表不能随机访问,要删除pToBeDeleted结点,按常规处理是先找到其前驱〔设为p〕,然后做删除操作,但是对于单向链表而言,找到p结点显然不是O能完成的,除非是双向链表,则可直接从pToBeDeleted结点获取到其前驱p,然后执行p->next=pToBeDeleted->next; free;但是这题设计的巧妙之处就是,链表中节点的内存格...