// test15.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include<iostream>
using namespace std;
template<class ElemType>//單鏈表結(jié)點(diǎn)
struct LNode{
ElemType data;
LNode* next;
};
/**
ListInsert(L, pos, d)
p=L[pos-1]
node->next=p->next
p->next=node
*/
template<class ElemType>
int ListInsert(LNode<ElemType>* L, int pos, ElemType d){
LNode<ElemType>* p=L; //p用于遍歷List
if(pos<=0) return -1; //只能在頭結(jié)點(diǎn)（pos=0）之后插入
for(int i=0;i<pos-1;i++) //尋找插入位置的前一個(gè)結(jié)點(diǎn)
p=p->next;
LNode<ElemType>* node=(LNode<ElemType>*)malloc(sizeof(LNode<ElemType>));
node->data=d;
node->next=p->next;
p->next=node;
return 1;
}
template<class ElemType>
ostream& operator<<(ostream& out, LNode<ElemType>* L){ //重載<<便于輸出LinkList
LNode<ElemType>* p=L->next;
while(p){
out<<p->data<<"-->";
p=p->next;
}
out<<"NULL";
return out;
}
template<class ElemType> //對(duì)單鏈表初始化
LNode<ElemType>* ListInit(){
LNode<ElemType>* p=(LNode<ElemType>*)malloc(sizeof(LNode<ElemType>));
p->data=-1;
p->next=NULL;
return p;
}
int main()
{
LNode<int>* list=ListInit<int>();
for(int i=0;i<10;i++){
ListInsert(list,i+1, i*i);
}
cout<<list;
system("pause");
}