数据结构习题
浚jskp
这个作者很懒,什么都没留下…
展开
-
逆置顺序表
将顺序表中所有元素逆置#include<iostream>#include<cstdio>#define maxSize 100using namespace std;typedef struct{ int data[maxSize]; int length;}Sqlist;void scan(Sqlist &L,int lengt...原创 2019-08-28 15:49:23 · 190 阅读 · 0 评论 -
栈-二进制转换
#include<iostream>using namespace std;#define maxsize 100int judge(int x){ int i,result=0; int stack[maxsize],top=-1; while(x!=0) { i=x%2; x=x/2; sta...原创 2019-09-02 15:34:53 · 174 阅读 · 0 评论 -
循环队列-队尾删除,队头插入!!!
#include<malloc.h>#include<iostream>#define maxsize 100using namespace std;typedef struct{ int data[maxsize]; int front1; int rear;}squeue;void init(squeue &qu){ qu....原创 2019-09-02 15:22:59 · 3350 阅读 · 0 评论 -
链队-不设头指针,只设尾指针!!!
#include<malloc.h>#include<queue>#include<iostream>#define maxsize 100using namespace std;typedef struct Qnode{ int data; struct Qnode *next;}Qnode;typedef struct{ ...原创 2019-09-02 15:01:41 · 1191 阅读 · 0 评论 -
将链表中奇数偶数分离
将链表A中的偶数保存到链表B中,奇数留在链表A中;#include<malloc.h>#include<iostream>#include <stdio.h>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode;void crea...原创 2019-08-28 17:44:36 · 1101 阅读 · 1 评论 -
将链表逆置
#include<malloc.h>#include<iostream>#include <stdio.h>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode;void createlistF(LNode *&c,int a...原创 2019-08-28 17:30:28 · 160 阅读 · 0 评论 -
删除一个递增链表中重复的值
#include<malloc.h>#include<iostream>#include <stdio.h>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode;void createlistF(LNode *&c,int a...原创 2019-08-28 17:02:31 · 125 阅读 · 0 评论 -
删除链表中最小值***
#include<malloc.h>#include<iostream>#include <stdio.h>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode;void createlistF(LNode *&c,int a...原创 2019-08-28 16:53:35 · 325 阅读 · 0 评论 -
顺序表快排
#include<iostream>#include<cstdio>#define maxSize 100using namespace std;typedef struct{ int data[maxSize]; int length;}Sqlist;void scan(Sqlist &L,int length)//创建{ for...原创 2019-08-28 16:29:22 · 156 阅读 · 0 评论 -
删除顺序表下标i到j的元素
#include<iostream>#include<cstdio>#define maxSize 100using namespace std;typedef struct{ int data[maxSize]; int length;}Sqlist;void scan(Sqlist &L,int length)//创建{ for...原创 2019-08-28 15:59:05 · 1592 阅读 · 0 评论 -
括号对称(顺序栈)
输入 ( ) { } [ ]等三种括号,若对称输出yes,否则输出no;且左括号不能出现在右括号之前;例(){} [] 为 yes { ( [ ] ) } 为 yes }{}()] 为 no#include<stdio.h>#include<string.h>const int m...原创 2019-03-01 22:40:15 · 605 阅读 · 0 评论