m0_46574072的博客

Mybatis快速入门使用Mybatis准备下载 mybatishttps://github.com/mybatis/mybatis-3/releases搭建Mybatis开发环境2.1 创建数据库和表数据库名：temp;表名:user//创建数据库tempcreate database temp;//创建user表create table user( id int(20) primary key, userName varchar(25) unique, password v

C#快速入门自己看视频写的代码，记录一下上面注释是测试代码，下面注释的是测试 所用到的类using System;using System.Collections;using System.Collections.Generic;using System.Diagnostics;using System.IO;using System.Linq;using System.Reflection;using System.Runtime.Serialization.Formatters.Bi

C语言实现图的遍历//图的基本运算算法#include <stdio.h>#include <malloc.h>#define INF 32767 //定义∞#define MAXV 100 //最大顶点个数typedef char InfoType;//以下定义邻接矩阵类型typedef struct{ int no; //顶点编号 InfoType info; //顶点其他信息} VertexType; //顶点类型

C实现二叉树简单算法//二叉树的基本运算算法#include <stdio.h>#include <malloc.h>#define MaxSize 100typedef char ElemType;typedef struct node { ElemType data; //数据元素 struct node *lchild; //指向左孩子结点 struct node *rchild; //指向右孩子结点} BTNode;void CreateBTre

C语言实现队列链式队列源码//链队运算算法#include <stdio.h>#include <malloc.h>typedef char ElemType;typedef struct DataNode{ ElemType data; struct DataNode *next;} DataNode; //链队数据节点类型定义typedef struct{ DataNode *front; DataNode *rear;} LinkQuNo

C语言实现单链表简单操作链表源码//单链表运算算法#include <stdio.h>#include <malloc.h>typedef char ElemType;typedef struct LNode { ElemType data; struct LNode *next; //指向后继结点} LinkNode; //单链表结点类型void CreateListF(LinkNode *&L,ElemType a[],int n)//

**## C语言实现哈夫曼编码**#include <stdio.h>#include <string.h>#define N 50 //叶子结点数#define M 2*N-1 //树中结点总数typedef struct{ char data[5]; //结点值 int weight; //权重 int parent; //双亲结点 int lchild; //左孩子结点 int rchild; //右孩子结点} HTNode;type

SQL语言基础语句/创建数据库/create database JXGLon(name=JXGL,filename=‘c:\SQLtest\JXGL.mdf’,size=5,maxsize=unlimited,filegrowth=1)log on(name=JXGL_log,filename=‘c:\SQLtest\JXGL_log.ldf’,size=1,maxsize=20,filegrowth=10%)/修改原来数据库/goalter database JXGL

汉诺塔C语言实现#include <stdio.h>void MoveOne(int n,char x,char y){printf(“把%d号从%c挪动到%c.\n”,n,x,y);}void Hanoi(int n,char A,char B,char C){​if(n==1)​ MoveOne(1,A,C);​else{Hanoi(n-1,A,C,B);​ MoveOne(n,A,C);​ Hanoi(n-1,B,A,C);​}