数据结构与算法实验
moyangxian
总会过去的
展开
-
第十四次试验
#include<iostream>using namespace std;const int N=1010;int g[N][N]={{ 1, 1, 1, 1, 1, 1 },{ 1, 0, 0, 0, 1, 1 },{ 1, 0, 1, 0, 0, 1 },{ 1, 0, 0, 0, 1, 1 },{ 1, 1, 0, 0, 0, 1 },{ 1, 1, 1, 1, 1, 1 }};bool vis[N][N];struct Node{ int x,y;}原创 2020-12-23 20:12:11 · 107 阅读 · 0 评论 -
第十三次试验
#include<iostream>#include<vector>#include<queue>#include<cstring>using namespace std;const int N=1e4+10;int g[N][N];int n,m;struct Edge{ int to,next,w;}e[N];int head[N],tot;void init(){ memset(head,-1,sizeof(hea原创 2020-12-16 20:22:35 · 93 阅读 · 0 评论 -
第十二次实验
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int INF=0x3f3f3f3f;const int N=50;struct HTNode{ char data[N]; double w; int fa,l,r;}ht[N];int num[N];struct HCode{ char cd[N]; int原创 2020-12-09 20:33:10 · 122 阅读 · 0 评论 -
第十次试验
A(B(D(,G)),C(E,F))#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<cstdlib>using namespace std;const int MaxSize=100;typedef struct Node{ int data; struct Node *l; struct Node原创 2020-11-25 20:30:20 · 111 阅读 · 0 评论 -
第九次试验
#include<iostream>using namespace std;int x;int fun(int n){ if(n==1) return x; return x*fun(n-1);}int main(){ int n; cin>>x>>n; cout<<fun(n)<<endl; return 0;}#include<iostream>原创 2020-11-18 20:35:28 · 93 阅读 · 0 评论 -
第八次试验
#include<iostream>#include<cstdio>#include<cstdlib>using namespace std;char str[100];char mp[100]={"ngzqtcobmuhelkpdawxfyivrsj"};typedef struct snode{ char data; struct snode *next;} LinkStrNode; //声明链串节点类型void StrAssign原创 2020-11-11 20:01:56 · 105 阅读 · 0 评论 -
第七次试验
#include<iostream>#include<cstdlib>#include<string>#include<cmath>#include<cctype>#include<cstdio>using namespace std;#define MaxSize 100typedef char ElemType;typedef struct{ ElemType data[MaxSize]; int front原创 2020-11-04 20:28:34 · 119 阅读 · 0 评论 -
第六次试验
#include <cstdio>#include <cstdlib>#include <iostream>#include <cmath>#define MaxSize 100typedef int ElemType;int n,num=1;typedef struct{ ElemType data[MaxSize]; int top; //栈指针} SqStack; //声明顺序栈类型void InitStack(Sq原创 2020-10-28 20:36:36 · 81 阅读 · 0 评论 -
第五次试验
#include<iostream>#include<cstdio>#include<cstdlib>using namespace std;int n,m;typedef int ElemType;typedef struct LNode{ ElemType data; struct LNode *next;}LinkList;void DispList(LinkList *L,int m){ LinkList *p = L原创 2020-10-21 20:39:11 · 11682 阅读 · 1 评论 -
第四次试验
#include<iostream>#include<cstdio>#include<stdlib.h>#include<cstring>#include<string>using namespace std;typedef struct Node{ char data; bool flag; struct Node *next;}Node;string str;void InitList(Node原创 2020-10-14 20:50:07 · 94 阅读 · 0 评论 -
第三次试验
#include<iostream>#include<cstdio>#include<cstdlib>using namespace std;typedef int DataType;typedef struct SqList{ DataType z[100]; DataType data[100]; int length;}SqList;void CreateList(SqList *&L,DataType a[],i原创 2020-09-27 20:47:32 · 103 阅读 · 0 评论 -
第二次试验
#include<bits/stdc++.h>using namespace std;typedef struct student { int num; char name[10]; char sex[10]; int English; int computer; int math; int sum; double average;}Student;typedef struct NODE{ Student data; struct NODE *next;原创 2020-09-23 20:38:29 · 140 阅读 · 0 评论 -
第一次实验
#include <stdio.h>#include <stdlib.h>typedef struct student { int num; char name[10]; char sex[10]; int English; int computer; int math; int sum; double average;}Student;const int N = 100;Student stu[N];int n;void InputStu(Stude原创 2020-09-16 22:57:59 · 123 阅读 · 0 评论