典型问题分析3—LinkList中遍历操作与删除操作混合使用

#include <iostream>
#include "LinkList.h"

using namespace std;
using namespace DTLib;


int main()
{
    LinkList<int> list;

    for(int i=0; i<5; i++)
    {
        list.insert(i);
    }


    for(list.move(0); !list.end(); list.next())
    {
        if(list.current() == 3)
        {
            list.remove(list.find(list.current()));
            cout << list.current() <<endl;
        }
    }
　　
    return 0;

}

bool remove(int i)
    {
        bool ret = ((0<=i) && (i<m_length));

        if(ret)
        {
           Node* current = position(i);
           Node* toDel = current->next;

           if(m_current == toDel)
           {
                m_current = toDel->next;
           }
           current->next = toDel->next;

           m_length--;

           destroy(toDel);

          //  m_length--;
        }

        return ret;
    }