- 博客(17)
- 收藏
- 关注
RSS订阅
1原创 表达式求值
感觉自己正在慢慢走向真正的代码之路..比较笨拙写了好久才写出来，课本上的思路又借鉴了几行别人的代码。即使比较坎坷起码还是把它写出来了..加油加油！#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define
2022-01-22 21:13:44
346
原创 数制度的转换C++
顺序栈实现：#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;//顺序栈typedef struct { int* base; i
2022-01-18 15:50:32
329
原创 线性有序表的合并
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Lnode* next;}Lnode,*Link.
2022-01-05 16:33:13
780
原创 线性表的合并
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Lnode* next;}Lnode, *Lin.
2022-01-04 22:12:59
422
原创 双向链表的插入和删除(自我练习)
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;//双链表的存储结构typedef struct DuLnode { int data.
2021-12-23 20:50:50
379
原创 单链表的插入(自我练习)
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Lno.
2021-12-20 15:37:58
279
原创 单链表的删除(自我练习)
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Lno.
2021-12-20 14:54:41
363
原创 单链表的查找(自我练习)
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Lno.
2021-12-19 22:42:29
341
原创 单链表的取值(自我练习)
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Ln.
2021-12-19 21:36:11
492
原创 后插法创建单链表
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;typedef struct Lnode { int data; struct Lno.
2021-12-09 20:00:04
642
原创 前插法创建单链表(自我练习)
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;typedef struct Lnode{ int data; struct Lnod.
2021-12-09 19:59:20
573
原创 顺序表的删除（自我练习）
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;//定义一个顺序存储结构的数据类型typedef struct { int* elem.
2021-12-05 21:18:23
844
原创 顺序表的插入（自我练习）
#include<iostream>using namespace std;#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define MAXSIZE 100 #define SIZE 4 typedef int Status;//定义一个顺序存储结构的数据类型typedef struct { int* elem.
2021-12-05 20:49:41
393
原创 贪心算法之活动安排（自我练习）
#include<iostream>using namespace std;#define MAXSIZE 5int s[5] = { 1,3,6,8,9 };int f[5] = { 2,6,9,11,12 };void timeSelector(int s[], int f[], int n) { int j = 0, index = 1; int temp[MAXSIZE] = { 1 }; for (int i = 1; i < n; i++) { if (s.
2021-12-02 21:12:00
680
原创 顺序表的初始化（自我练习）
#include<iostream>using namespace std;//并不知道为什么要定义这些东西但老师说要定义2021.11.30#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE - 1#define OVERFLOW - 2#define SIZE 4 typedef int Status;//定义一个顺序存储的结构类型SqListtypedef st.
2021-11-30 22:09:49
395
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人