单链表

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;


typedef struct Node{
int data;
struct Node *next;
}Node;


int InitList(Node* List);


int main(){
//ifstream infile("input.txt");
Node *List=new Node; //头指针
List->next=NULL;
InitList(List);
Node *p;
while(List->next!=NULL){
p=List->next;
cout<<p->data<<endl;
delete List;
List=p;
}
}


int InitList(Node* List){
int Temp;
Node *p;
ifstream infile("input.txt");
while(infile>>Temp){
p=new Node;
p->data=Temp;
p->next=List->next;
List->next=p;
}
return 0;
}