#include "stdafx.h"#include <malloc.h>#include <iostream>#include <stdio.h>#include <math.h>#include <stdlib.h>using namespace std;typedef int DataType;struct LNode{	DataType data;	struct LNode *next;};typedef struct	LNode *LinkList;int getElem(LinkList L,int i,DataType *e){	//找到第i个元素并复制给e	int j = 0;	LinkList p = L->next;	while(p&&j<i)	{		p = p->next;		j++;	}	if(!p ||j>i) return -1;	*e = p->data;	return 1;}//在第i个位置插入eint  insert(LinkList L,int i ,DataType e){	//先找到第i-1个节点	LinkList p = L,s;	int j = 0;	while( p && j<i-1)	{		p = p->next;		j++;	}	if(!p ||j>i+1) return -1;	//生成新节点	s = (LinkList)malloc(sizeof(struct LNode));	s->data = http://www.mamicode.com/e;"%d",&p->data);		p->next = (*L)->next;		(*L)->next = p;	}}*/int insertByTail(LNode **head,DataType data){	/*LNode *p,*temp;	if((*L)->next != NULL) {		*p = (*L)->next->next;	}	//LNode *p = (*L)->next,*temp;	temp = (LNode*)malloc(sizeof(struct LNode));	temp ->data = http://www.mamicode.com/data;"%d",p->data);		p= p->next;	}	if(num ==0)		return 0;	else 		return num;}/*void main(){//最后运行不出结果	LinkList L;	insertByTail(&L,1);	insertByTail(&L,2);	showList(L);}*/