64,648
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
#include<cstdio>
using namespace std;
typedef struct mynode
{
int *element;
struct mynode * next;
}node,*n; //节点
class list
{
int maxlength;
int length;
n newnode;
public:
list(int max=30){maxlength=max;length=0;newnode->element=new int[maxlength];}
~list(){delete[] newnode->element;}
void Insert(int i,int dt);
void Delete(int i);
void print()
{
n p=(n)malloc(sizeof(n));
p=newnode->next;
while(p)
{
cout<<"元素是:"<<p->element<<" ";
p=p->next;
}
}
};
void list::Insert(int i,int dt)
{
if(i<1||length>=maxlength-1) exit(1);
for(int j=0;j<i-1;++j)
{
newnode=newnode->next;
}
n s=(n)malloc(sizeof(n));
s->next=newnode->next;
newnode->next=s;
}
int main()
{
list listInstance(50);
for(int i=1;i<8;++i)
{
listInstance.Insert(i,i+3);
}
listInstance.print();
cin.get();
}
typedef struct mynode
{
int *element;
struct mynode * next;
}node,*n; //节点
class list
{
int maxlength;
int length;
n newnode;
public:
list(int max=30){maxlength=max;length=0;newnode->element=new int[maxlength];}
~list(){delete[] newnode->element;}
void Insert(int i,int dt);
void Delete(int i);
void print()
{
n p=newnode->next;
while(p)
{
cout<<"元素是:"<<p->element<<" ";
p=p->next;
}
}
};
void list::Insert(int i,int dt)
{
n ptr=newnode;
if(i<1||length>=maxlength-1) exit(1);
for(int j=0;j<i-1;++j)
{
ptr=ptr->next;
}
n s=(n)malloc(sizeof(n));
s->next=newnode->next;
newnode->next=s;
}
int main()
{
list listInstance(50);
for(int i=1;i<8;++i)
{
listInstance.Insert(i,i+3);
}
listInstance.print();
system("pause");
return 0;
}
没看逻辑