|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
#include<iostream>
using namespace std;
typedef struct LIST1{
int num;
LIST1* next;
LIST1(int x) : num(x), next(NULL){}
}list1;
class Linked{
private:
public:
list1* head;
Linked(){
head = NULL;
}
void creat(int n,list1* head){
// system("pause");
int i=0;
list1* p;
//list1* p1;
//p->num = n;
//cout<<p->num<<endl;
p = head;
// p = new list1(1);
cout<<87<<endl;
for(i=0;i<n;i++){//注意:为尾插法,head无值
p = new list1(i+1);
head->next = p;
p->next = NULL;
head = head->next;
}
//return head;
}
//void delete(list1* h){//删除h结点,但不到下一个
//}
void bianli(list1* h){
int i = 0;
while(h!=NULL){
cout<<h->num<<endl;
h = h->next;
}
}
};
int main(){
int i=0,n=0,m=0;
cin>>n;
cin>>m;
Linked* l1;
list1* p;
l1->creat(n,l1->head);
cout<<"78"<<endl;
l1->bianli(p);
return 0;
}
|
|