摘要： ListNode* ReverseIteratively(ListNode* pHead){ ListNode* pReversedHead = NULL; ListNode* pNode = pHead; ListNode* pPrev = NULL;while(pNode != NULL) {// get the next node, and save it at pNext ListNode* pNext = pNode->m_pNext;// if the next node is null, the currect is the end of original// list, 阅读全文