- 博客(13)
- 资源 (11)
- 收藏
- 关注
原创 DS:串的简单匹配
首次匹配成功,返回待匹配的字符串 data 在 字符串 str 的首个元素位置;否则,返回0:// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include#include#include#include#include int compare(
2017-07-29 12:37:44
271
原创 DS:串的链式存储结构
根据串的大小动态分配空间// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include#include#include#include#include#define N 5struct string{ char data[N]; strin
2017-07-28 11:57:21
397
原创 DS:稀疏矩阵-十字链表
用c++简单实现了十字链表,有很多的不足可以改善,但是基本思想应该是实现了的。XD// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include#include#include#include#include#define I 4#define J
2017-07-27 15:08:36
356
原创 DS:稀疏矩阵-三元组表
用c++写了下,当作是练习吧XD// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include#include#include#include#include#define I 3#define J 4#define maxsize I*Jst
2017-07-26 14:54:38
331
原创 DS:带状矩阵
// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include#include#include#define N 6#define W 3//带宽int absolute(int i,int j){ if(i-j>0) return i-j; e
2017-07-25 10:33:10
831
原创 DS:三角矩阵
// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include#include#include#define N 6int init(int *&b){b=(int *)malloc(sizeof(N*(N+1)/2+1));return 0;
2017-07-24 14:03:19
341
原创 DS:对称矩阵
把二维数组压缩存储到一维数组中:0123456789................所以第0行对应0,第1行对应1,第2行对应3.......0 1 3 6......的数的规律:n(n+1)/2eg:二维数组b[2][1]对应压缩到一维数组的下标为2(2+1)/2+1=4 的元素i>=j return i(i+1)/2+jj>i return j(
2017-07-23 13:25:16
344
原创 DS:Queue
Most feature of Queue is "first in first out",the above code can construct a Queue using Linear List ,many issues could be solved by its thought.a simple and interesting problem within the code.X
2017-07-21 13:18:11
235
原创 DS:using Stack to arrange the array to get max number.
what follows is code to demonstrate:#include "stdafx.h"#include #include #include #include#include #define N 5 //control number of arrayint clic =1;int max(int a[],int sub){ int t;if(sub
2017-07-19 12:02:02
227
原创 Data Structure:stack
using linear list to realize the Stack,code as the following:// STACK.cpp : Defines the entry point for the console application.//#include "stdafx.h"#includestruct stackpoint{int data; stack
2017-07-18 10:27:34
468
原创 How does the lead number of inverse circular function be verified?
I could put some problem sometimes,today i am learning math,i like math though i can resolve to the simple,around chapter of lead number,I agree that some foundamental equation of the lead number can
2017-07-13 17:03:55
170
2019王道数据结构
2018-08-16
IDE(Internet.Download.Manager.6.30.10)
2018-08-09
sql server 2005
2018-08-09
tomcat(简约版)
2018-08-09
2019考研数学题源探析经典1000题解析分册(数学二)
2018-08-09
2019考研数学题源探析经典1000题习题分册(数学二)
2018-08-09
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人