zoukankan      html  css  js  c++  java
  • 单链表反转函数

    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, and it's the head of the reversed list
                if(pNext == NULL)
                       pReversedHead = pNode;

                // reverse the linkage between nodes
                 pNode->m_pNext = pPrev;

                // move forward on the the list
                 pPrev = pNode;
                 pNode = pNext;
           }

          return pReversedHead;
    }

  • 相关阅读:
    mysql学习总结(四)
    mysql学习总结(三)
    mysql学习总结(二)
    mysql学习总结
    学习总结(三十)
    断点续传
    错误总结
    学习总结(三十六)
    学习总结(三十五)
    Linux命令
  • 原文地址:https://www.cnblogs.com/xiawen/p/3096059.html
Copyright © 2011-2022 走看看