资源列表
1311
- 这是堆砖块的问题，输入砖块的堆砌情况，输出这堆砖块是否牢固，是就输出Yes，否则输出No。-This is the brick pile, the pile of bricks imported, exported all these bricks whether solid, Yes yes on output, output No.
binary_tree_levelorder
- binary_tree_level_order(二叉树层排序): 输入:数组{1,2,3,4,5,6,7,8,9,10},建立二叉树,再进行层排序. 输出:输出排序结果.
Kalman-simulinkkalman滤波器的simulink的M函数的实现方法
- kalman滤波器的simulink的M函数的实现方法，包括干扰信号，测量噪声信号-kalman filter simulink realization of M functions, including signal interference, measurement noise signal
yinhangjia
- 银行家算法 适合操作系统课设 自己编的-Banker
Random
- The file contains a C++ class for generating random numbers in the range 0..NTAB-1
qrtrannnn
- 功能：对矩阵A的左上角的m阶对角块作QR变换：先用Givens变换作QR分解A=QR， 再作相似变换A:=Q AQ=RQ. 输入: n阶HessenbergA，其中A(m+1,m)=0,m>2. 输出: 变换后的Hessenberg形矩阵A. 2 用基本QR算法求实方阵的全部特征值.-Function: the upper left corner of the matrix A, diagonal blocks of order m to QR transfor
zjz
- 非线性被控制对象的神经网络自校正,先进行辨识-Non-linear neural network controlled object self-tuning, first to identify
panduanzifuzhongxinduicheng
- 此程序的作用是用来判断字符是否符合中心对称-The role of this procedure is used to determine whether the centrosymmetric character
FourthordersolvefifthorderCNNequation
- 用四阶经典龙格库塔算法求解5阶细胞神经网络状态方程，得到5路超混沌序列。-With the fourth order classical Runge-Kutta algorithm for 5-order cellular neural network state equation, 5-way super-chaotic sequence are generated.
Dijkstra
- Dijkstra算法思想：每次从V-S取出具有最短特殊路径长度的顶点u，将u添加到S中同时对数组dist作必要的修改，一旦s包含了所有v中顶点，dist就记录了从源到其他顶点之间的最短路径长度。-Dijkstra Algorithm idea: Every time out from the VS special path with the shortest length of vertex u, u will be added to the S in the same time, make t
ark4
- The streamfunction solution for a potential flow around a cylinder
SerializeBinaryTreeAndReconstruct
- 将二叉树序列化 并且重建，序列化时用#代替叶子节点的空孩子节点，详细地写满了注释。-Serialize Binary Tree And Reconstruct