摘要: #include "stdafx.h"#include "stdio.h"#include using namespace std;#define MAXSIZE 50#define swap(a,b) a=a+b;b=a-b;a=a-b;typedef struct Node{int data;struct Node *next;}LNode;void Output(Node *p);void TailOutput(LNode *p);// 头插入法建链表LNode* HeadList(LNode *head){int i;LNode *p,*h;h 阅读全文
posted @ 2013-09-13 18:11 露水上的青蛙 阅读(153) 评论(0) 推荐(0) 编辑