头发茂密的ITer

#include <iostream>using namespace std;//顺序表的二路归并操作 ，数组存储 ,传入的数组从小到大排列，合并后的数组仍然是从小到大排列 void mergeArray(int a[],int m,int b[],int n,int c[]) //传入数组和数组的长度 ，不是下标 {    int i=0,j=0,k=0;    wh...

#include <iostream>#include <stdlib.h>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode;LNode * createLinkList() //构造带头结点的链表 ,尾插法，构造的节点要有序...

#include <iostream>#include <stdlib.h>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode;LNode * createLinkList() //构造带头结点的链表 ,尾插法，构造的节点要有序...

#include <iostream>#define SIZE 10using namespace std;typedef struct LNode{ int data; struct LNode *next;};void reverseArray(int a[],int s) //数组的逆置函数{ int i=0,j=s,temp;...

#include <iostream>#include <stdlib.h>using namespace std; /* run this program using the console pauser or add your own getch, system("pause") or input loop */typedef struct LNode{...

#include <iostream>#include <stdlib.h>using namespace std;typedef struct DLnode{    int data;    struct DLnode *left;    struct DLnode *right;}DLnode; DLnode* createDLinkList()...

#include <iostream>#include <stdlib.h> using namespace std;typedef struct LNode{    char c;    struct LNode *next;    }LNode;void createLinkList(int n,LNode *&head)  //  我是用t...