Cris_7的博客

#include <stdio.h>#include <stdlib.h>struct node { int value; struct node * next;};typedef struct node nodes;nodes *LinkList_Init();void Insert_value(int value_in, nodes *...

//用数组实现栈结构#include<iostream>#include<string>using namespace std;void push(int *stack, int num, int &index, int stack_len){ if (index >= stack_len - 1) cout &a

//用数组实现队列#include <iostream>#include <string>using namespace std;void push(int *queue, int num, int &end_index, int &queue_size, int queue_len){ if

#include<iostream>#include<string>using namespace std;void push(int *stack, int num, int &index, int stack_len){ if (index > stack_len - 1) cout <&am

#include <iostream>#include <string>using namespace std;void push(int *queue, int num, int &end_index, int &queue_size, int queue_len){ if (queue_size == queue_len) .

#include <iostream>#include <algorithm>using namespace std;struct student{ int ID; int Age; int Score;};student stu [3] = { {1, 18, 88}, {2, 19, 90}, {3, 20, ...

#include <iostream>#include <algorithm>using namespace std;struct student{ int ID; int Age; int Score;};student stu [3] = { {1, 18, 88}, {2, 19, 90}, {3,

#include <iostream>using namespace std;void square_print(int **a, int x_temp1, int y_temp1, int x_temp2, int y_temp2){ if(x_temp1 == x_temp2) { for(int i = y_temp1; i <= y...

#include <iostream>using namespace std;void shift_print(int **a, int temp1, int temp2){ //shift_square for(int i = 0; i < temp2 - temp1; i++) { int temp_s = a[temp1][t...

#include <iostream>using namespace std;void round_print(int **a, int x_temp1, int y_temp1, int x_temp2, int y_temp2, bool reverse){ if(reverse) while(x_temp1 <= x_temp2) ...

#include <iostream>#include <stack>#include <string>using namespace std;struct node { int value; node *next;};//add a node at the end of the listnode *add_node(

#include <iostream>#include <string>using namespace std;struct node { int value; node *next;};node *add_node(node *head, int value) { node *new_node = new node(); ne...

#include <iostream>#include <string>#include <stack>using namespace std;struct node { int value; node *next;};node *add_node(node *head, int value) { node *new

#include <iostream>using namespace std;struct node { int value; node *next;};node *add(node *head, int value) { node *new_node = new node(); new_node -> value = value; ...

#include <iostream>#include <stack>using namespace std;struct BitNode { int value; BitNode *left; BitNode *right;};BitNode *Creat_BitNode() { BitNode *P_node; int ...

//头文件//#pragma onceclass Array_Class { private: int capcity; int size; int *Array; public: Array_Class(); Array_Class(int capcity); Array_Class(const Array_Cla...

#include <iostream>#include <vector>using namespace std;void swap (int &a, int &b){ int temp = a; a = b; b = temp;

#include <iostream>#include <vector>#include <ctime>#include <cstdlib>using namespace std;//

#include <stdio.h>#include <stdlib.h>typedef struct node{ int value; struct node *next;} nodes;nodes *LinkList_Init();void Insert_value(int value_in, nodes *P_node);void ...

#include <stdio.h>#include <stdlib.h>typedef struct node { int age; char name[20];} nodes;void Fuc_Print(void* data, int p_len, int len, void (*my_print)(void*)) { for(in...

#include <stdio.h>#include <stdlib.h>#include <string.h>typedef struct node { void **Array; int size; int capacity;}nodes;typedef struct info {

#include <stdio.h>#include <stdlib.h>typedef struct node { int id; int age; char name[20];} nodes;typedef struct Linknode{ void* value; struct Linknode *next;}L...

//区别在于只维护地址域，内存释放需要用户自己来完成#include <stdio.h>#include <stdlib.h>typedef struct Linknode{ struct Linknode *next;}Linknodes;typedef struct LinkList{ Linknodes *p_head; in...

#include <stdio.h>#include <stdlib.h>#define MAX_SIZE 40typedef struct Stack{ void* value[MAX_SIZE]; int Size;}SeqStack;typedef struct node{ int id; int age; ch...

#include <stdio.h>#include <stdlib.h>#define MAX_SIZE 40typedef struct Linknode{ struct Linknode *next;}LinkNodes;typedef struct Stack{ LinkNodes *Stack_Head; int Size;...

//头文件#pragma once#include <stdio.h>#include <stdlib.h>#include <string.h>typedef struct info { int id; int age; char name[20];}info_s;typedef struct AArray { ...

#include <stdio.h>#include <stdlib.h>typedef struct LinkNode{ struct LinkNode* Next;}LinkNodes;typedef struct Mes{ LinkNodes* Use_Node; int id; int age; char na...

#include <stdio.h>#include <stdlib.h>typedef struct BinaryTree { int value; struct BinaryTree* Left; struct BinaryTree* Right; }BinaryTrees;void pre_trival(BinaryTrees *...

#include <iostream>#include <stack>using namespace std;/* 1、将根节点 压入栈中 2、只要 栈size> 0 执行循环 2.1 拿出栈顶元素 2.2 如果栈顶元素的标志位 真 直接输出 执行下一次循环 2.3 如果不是真 该flag的标志位真 2.4 将 右子节点 和 ...

#include <iostream>#include <vector>using namespace std;//冒泡排序//算法时间复杂度 O(n*n)//额外空间复杂度 O(1)void Bubble_Sort(vector <int> &a

#include <iostream>#include <vector>using namespace std;//选择排序//算法时间复杂度 O(n*n)//额外空间复杂度 O(1)void Selection_Sort(vector <int> &num_s){

#include <iostream>#include <vector>using namespace std;//插入排序//算法时间复杂度 log(n*n)//额外空间复杂度 O(1)void Insert_Sort(vector <int> &amp

#include <iostream>#include <vector>using namespace std;//归并排序//算法时间复杂度 O(N*logN)//算法额外空间复杂度 O(N)void Merge(vector <int> &num_s, int left, int mid, int right){

C#中使用DrawString绘制文本时的对齐方式C#代码：void 绘制文字(Graphics 画家){ StringFormat 格式 = new StringFormat(); 格式.Alignment = StringAlignment.Center; //居中 格式.Alignment = StringAlignment.Far; //右对齐 strin...