u012713968的专栏

//单链表交换任意两个元素(不包括表头)#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Lin

//单链表排序#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist(){ pHea

//单链表交换任意两个元素(不包括表头)#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Lin

//有个二级单链表，其中每个元素都含有一个指向一个单链表的指针。写程序把这个二级链表展开称一级单链表#include using namespace std;struct LinkNode{ int nValue; LinkNode *pNext; LinkNode(int Value = 0):nValue(Value),pNext(NULL){}};class Link

//删除单链表给定节点#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist(){

//单链表交换任意两个元素(不包括表头)#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Lin

//查找单链表中间元素#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist(){

//查找单链表中间元素#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist(){

//查找单链表到时第四个元素#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist

//两链表相交，计算相交点#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist()

//单链表反转#include using namespace std;struct LinkNode{ LinkNode *pNext; int nValue; LinkNode(int value = 0) { nValue = value; pNext = NULL; }};class Linklist{public: Linklist(){ pHe

# include # include typedef struct Node{ int data; struct Node * pNext;}NODE, *PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK, *PSTACK;void Init_stack(PSTACK pS);void Push_stack(PSTACK p