dyingfair的专栏

#include <iostream> #include <iomanip> using std::endl; using std::cout; using std::setw; void OutputTuoluo(const int kSize) { int *array_data = new int[kSize*kSize]; int right = kSize;...

BinaryTree.hstruct BSTreeNode { int m_nValue; // value of node BSTreeNode *m_pLeft; // left child of node BSTreeNode *m_pRight; // right child of node }; // 创建二元查找树 void addBSTreeNode(BST...

1 longest common sequence #include <iostream> #include <assert.h> using namespace std; void LCS_LENGTH_1(const char *kArr1, const int kLen1, const char *kArr2, const int kLen2, ...