weixin_45632016的博客

#include<iostream>#include<string>#include <iomanip>using namespace std;#define HMax 8typedef struct node{ double key; string name; string address; node *next;}*list;li...

#include<iostream>using namespace std;#define Vnum 100 //顶点个数的最大值typedef struct EdgeNode{ int adjvex; float weight; struct EdgeNode *next;}*edgeptr;typedef struct{ int ve...

数据结构实验，实现一个简单的停车管理系统。

@RK#include <iostream>using namespace std; class Node{ public: int data; Node *next;}; class CircleList{ public: Node* head; int length; CircleList() { h...

#include<iostream>using namespace std;typedef struct btnode{ int data; struct btnode *Lchild,*Rchild;} *bitreptr;void CreateBtr(bitreptr &t){ int x; bitreptr p; cin>>x; i...

#include<iostream>#include<algorithm>using namespace std;int main(){ int i, j, m, n, a, b, c; cout<<"请输入总人数和间隔数"<<endl; cin>>n >>m; int *array = new int[n];...

#include<iostream>#include<string>#define max 100using namespace std;typedef struct{ string name; int Politics,Mathematics,Physics,Chemistry;//政治，数学，物理，化学 int Total; ...

查找斐波纳契数列中第 N 个数。所谓的斐波纳契数列是指：前2个数是 0 和 1 。第 i 个数是第 i-1 个数和第i-2 个数的和。斐波纳契数列的前10个数字是：0, 1, 1, 2, 3, 5, 8, 13, 21, 34 …int fibonacci(int n) { // write your code here if(n>2) { int Fib[n]; memset(Fib,0,sizeof(Fib

int maxOfThreeNumbers(int num1, int num2, int num3) { // write your code here if(num1>=num2) { if(num1>=num3) return num1; else return num3; } else{ i

字母的大小写转换大小写之间的ASCII表之间相差32例如：‘A’ = 65,‘a’ = 97;通过所给字母的ASCII，得到所求的字母的ASCII，char lowercaseToUppercase(char character) { int a,b; char character1; a = character; b = a - 32; character1 = b; return character1