qq_25528663的博客

what follows is code to demonstrate: #include "stdafx.h" #include #include #include #include #include #define N 5 //control number of array int clic =1; int max(int a[],int sub){ int t; if(sub

根据串的大小动态分配空间 // STACK.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include #include #include #include #include #define N 5 struct string { char data[N]; strin

用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

用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*J st

// 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

// STACK.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include #include #include #define N 6 int init(int *&b) { b=(int *)malloc(sizeof(N*(N+1)/2+1)); return 0;

把二维数组压缩存储到一维数组中： 0 12 345 6789 ................ 所以第0行对应0，第1行对应1，第2行对应3....... 0 1 3 6......的数的规律：n(n+1)/2 eg：二维数组b[2][1]对应压缩到一维数组的下标为2（2+1）/2+1=4 的元素 i>=j  return i（i+1）/2+j j>i    return j（

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

编程菜鸟，记录下自己的收获，有能够帮到的地方会很高兴XD

单链表有序插入，同上一个方法

using  linear list to realize the Stack,code as the following: // STACK.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include struct stackpoint{ int data; stack

首次匹配成功，返回待匹配的字符串 data 在 字符串 str  的首个元素位置；否则，返回0： // STACK.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include #include #include #include #include int compare(