for_casech的博客

#include #include void mysort(int *a, int low, int m) { int shang = low; int xia = m; int temp = a[shang]; while (shang < xia) { while (shang temp) xia--; a[shang] = a[xia]; while

#include using namespace std; void myswap(int a[],int l,int m,int r,int *&b) { int p = 0; int i=l, j = m + 1; while (i <= m&&j <= r) { if (a[i] < a[j]) { b[p++] = a[i++]; } else

创建一个结构体 C语言风格 写起来比较舒服 void CreateBitree(BsTreeNode * &pRoot,int * &arr); void change(BsTreeNode * node,BsTreeNode * &pTail); struct BsTreenode { int m_value; BsTreenode *m_left; BsTreenode *m

using namespace std; bool isPostTreeTraversal(int arr[],int leng) { if (leng <= 0 || NULL == arr) { return false; } int root = arr[leng - 1]; int m = 0; for (; m < leng - 1; m++) { if (arr

class Sum { public: Sum() { num++; sum+=num; } int getSum(){return sum;} static int num; static int sum; } int Sum::num=0; int Sum::sum=0; void main() { Sum *p=new Sum[100]; delete []p; cout<<

数组有比如 1 -2 3 -4 5 6 -5 9  1+（-2）为小于1 不求和进行重置  5+6-5 =6 +9 上手敲了不在编译器上敲在粘贴了 int SumMaxSub(int arr[],int len) {   int sum=0,temp=0;    for(int i=0;i    {          if(temp        

8 8 / \ 转换 / \ 6 10 --> 10 6 / \ / \ / \ / \ 5 7 9 11 11 9 7 5 #include using namespa

#include using namespace std; struct ListNode { int m_lvaue; ListNode*m_next; ListNode() { m_lvaue = 0; m_next = NULL; } }; void createListNode(ListNode*&node,int *&arr,int len,int fitstr

void ReveseListNodes(ListNode *&node) { if (!node || !node->m_next) return; ListNode *p = node; ListNode*pp = p; ListNode*ppp = NULL; while (p) { pp = p; p = p->m_next; pp->m_next = ppp;

#ifndef _SHU_H #define _SHU_H #define _CRT_SECURE_NO_WARNINGS #include #include #include #include typedef struct Node//树 { int data; struct Node *you; struct Node *zuo; }node,*N; typedef struc

此时此刻没有学到数据结构这块 所以 思想还是停留在C  的坑 #include using namespace std; class data { public: data(int i):x(i){} virtual ~data(){ cout << "data.....\n"; } virtual void pint() = 0; int getvalue(){ return

#include #include #include using namespace std; template class stack { private: class s { private: T *data; s * zuo; s *you; public: s() :data(0), next(0){} s(T*da):data(da),zuo(0),y

#define _CRT_SECURE_NO_WARNINGS #include #include int x[100] = { 0 }; //数组X用来存放路径 int val[100] = { -1 };//物品单价 int weight[100] = { -1 };//存放物品的重量 int isOverLoad(int n, int c) { int i, w = 0

#include #include #define X 8 #define Y 8 int chess[X][Y]; int nextxy(int *x, int *y, int conut) { switch (conut) { case 0: if (*x + 2 = 0 && chess[*x + 2][*y - 1] == 0) { *x = *x + 2;

#ifndef RB_H_ #define RB_H_ #include #include template class RB; template class Node { friend RB; private: Node() :zuo(0), you(0),data(0){} Node(T *&s):data(s),zuo(0),you(0){} ~Node(){ delete

#ifndef WRAPPER_H #define WRAPPER_H #include "Except.h" template class Cref { public: Cref() :obj(NULL){} explicit Cref(const Objct &x) :obj(&x){} const Objct &get()const { if (usNull())throw N

template int maxlen(T *data,const int n) { int p = 10; int d = 0; for (int i = 0; i < n; i++) { while (data[i] >= p) { p *= 10; ++d; } } return d; } template void readsort(T data[],

#include #include #include void shellsort(unsigned int k[], int xia) { int i; int j; int flag; int zhong = xia; int tmp; while (zhong > 1) { zhong = zhong / 2; do { flag = 0; for (i

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; int a[8];int c = 0; int n = 4; bool flag(int pos) { int i; for (i = 0; i < pos; ++i) { if (a[i] == a[pos]) { return false; }

#include #include #include using namespace std; template class stack { public: stack() :head(0), end(0),top(0){} void Push(T *d); T *Pop(); int len(){ return top; } ~stack() { while (hea

/*汉诺塔递归和非递归算法实现*/ #include using namespace std; typedef struct Tower{ int height; char a,b,c; }Tower; typedef struct Node{ Tower element; Node* pNext; }Node,*LinkList; typedef struct