blacop的博客

#include <stdio.h>#include <stdlib.h>#define LEN sizeof(ElemType)#define OK 1#define TRUE 1#define ERROR -1#define FALSE -1#define OVERFLOW -2typedef int ElemTypetypedef int Statusconst LIST_INI

#pragma once#include "stdafx.h"//用vector实现矩阵， vector传参必须用模板泛型template <typename Object>class Matrix {private: //2维的矩阵，2维的vector数组，vector就是一种动态数组 vector<vector<Object>> array;public: //

//最大子列和 动态规划 在线处理//动态规划//算法4 在线处理,T(N)=O(N)//在线的意思是指每输入一个数据就进行即时处理，在任何一个地方中止输入，算法都能正确给出当前的解int MaxSubsequSum4(int A[], int length) { int ThisSum, MaxSum; int i; ThisSum = MaxSum = 0;

#pragma once#include "stdafx.h"#define MAXK 1e7//class AlgoMath {//public:// AlgoMath() {}// virtual ~AlgoMath() {}//};//级数求和//伪 lanmda 写法 //double Series=（double base, int limit, int Consta

#pragma once#include "stdafx.h"#include "Stack.h"//方法的声明实现的 分离写法 容易 报错，IDE还找不到错误的地方//表达式求值class Calculator {private: //Calculator's stack,运算存储区 Stack<double> s; //7个方法public: //建立

#pragma once#include "stdafx.h"#include "StackNode.h"//LinkStack,链式栈的类定义template <typename T>class Stack {private: StackNode<T>* top; //cur ptr // 7个方法public: //Construct Function()

#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define INFEASIBLE -1#define OVERFLOW -2/*#define ElemType int#define Status int*/typedef int E

#pragma once#include "stdafx.h"#include "BinTreeNode.h"#include "Stack.h"//二叉树类BinTree的声明template <typename T>class BinTree {private: //指向根结点 BinTreeNode<T>* root; //输入stop时，终止结点的输入