当前位置: 代码迷 >> 综合 >> Linked List的相关操作
  详细解决方案

Linked List的相关操作

热度:33   发布时间:2023-12-04 20:09:43.0
//--------------------------Linked_List----------------------------
//类声明
typedef int ElementType;
class List
{
private:class Node{public:ElementType data;Node *next;Node(ElementType value,Node *link=0)  :data(value),next(link)  {}};typedef Node *NodePointer;
public:List();~List();bool empty() const;/*----函数成员----*/
private:NodePointer first;int mySize;
};
//遍历1------------------------------
NodePointer ptr=first;
while(ptr!=0)
{cout<<ptr->data<<" ";ptr->next;
}
//遍历2------------------------------
NodePointer ptr;
for(ptr=first;ptr!=0;ptr=ptr->next)
{cout<<ptr->data<<" ";ptr->next;
}
//插入节点-----------------------------
newptr=new Node(dataVal);
if(predptr!=0)
{newptr->next=predptr->next;predptr->next=newptr;
}
else
{newptr->next=first;first=newptr;
}
//删除节点-----------------------------
if(predptr!=0)
{ptr=predptr->next;predptr->next=ptr->next;
}
else
{ptr=first;first=ptr->next;
}
delete ptr;

  相关解决方案