yue_luo_的博客

顺序表应用2：多余元素删除之建表算法#include<iostream>#include<cstdlib>#define MAX 101#define OVERFLOW -1using namespace std;typedef struct{ int *elem; int listlen; int listsize;}list;list CreatList

顺序表应用3：元素位置互换之移位算法#include<iostream>#include<cstdlib>#define MAX 101#define OVERFLOW -1using namespace std;typedef struct{ int *elem; int listlen; int listsize;}list;list CreatList

顺序表应用4：元素位置互换之逆置算法#include<iostream>#include<cstdlib>#define MAX 101#define OVERFLOW -1using namespace std;typedef struct{ int *elem; int listlen; int listsize;}list;void Creatlist

3665顺序表应用8：最大子段和之动态规划法#include<iostream>#include<cstdlib>#define MAX 100010#define OVERFLOW -1using namespace std;int cnt ;typedef struct{ int *elem; int listlen1; int listsize1;}li

3330顺序表应用6：有序顺序表查询#include<iostream>#include<cstdlib>#define MAX 21010#define OVERFLOW -1using namespace std;int q ;typedef struct{ int *elem1,*elem2,*elem3; int listlen1; int listsi

3663顺序表应用4-2：元素位置互换之逆置算法(数据改进）#include<iostream>#include<cstdlib>#define MAX 1100010//注意大小#define OVERFLOW -1using namespace std;int q ;typedef struct{ int *elem1,*elem2,*elem3; int list

3324顺序表应用1：多余元素删除之移位算法#include<iostream>#include<cstdlib>#define MAX 101#define OVERFLOW -1using namespace std;typedef struct{ int *elem; int listlen; int listsize;}list;void CreatL

顺序表应用5：有序顺序表归并#include<iostream>#include<cstdlib>//exit 函数#define MAX 21010#define OVERFLOW -1using namespace std;int q ;typedef struct{ int *elem1,*elem2,*elem3; int listlen1,listlen2,l