用头插法实现单链表整表创建

#include<iostream>
#include<cstring>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef struct node{
int id;
node *next;
node();
node(int);
}node;
node::node(){
id = 0;
next = NULL;
}
node::node(int i){
id = i;
next = NULL;
}
node *head;
void createList(int n){
if(n<0) return;
head=new node(1);
node *temp;
for(int i=2;i<=n;i++){
temp=new node(i);
temp->next=head->next;
head->next=temp;
}
}
void createList_2(int n){//顺序建表
if(n<0) return;
head=new node(1);
node *temp,*p=head;
for(int i=2;i<=n;i++){
temp=new node(i);
p->next=temp;
p=temp;
}
}

void print(){
node *p=head;
while(p){
cout<<p->id<<" ";
p=p->next;
}cout<<endl;
}
int main(){
int n;
while(cin>>n){
createList_2(n);
print();
}
return 0;
}