shuangyan5230的专栏

class IntCell{ public: IntCell() { storedValue = 0; } IntCell(int initialValue) { storedValue = initialValue; } int read() { return storedValue; } vo

void CTest::TestJosephTwo(){ CircleList jobs; int n = 15; // 人数，一共15人，从1 开始 int m = 4; // 每回报m这个数的人退出队列 for(int i=1; i<=n; i++) { jobs.AddTail(i); } // 数

template class CircleListNode{ T data; CircleListNode *next;public: CircleListNode():next(NULL){} CircleListNode(T value):data(value),next(NULL){} T& GetData() { r

#pragma once#include using namespace std;/** * 结点类 */template class ListNode{private: T data; ListNode *next;public: ListNode():next(NULL){} ListNode(T value):data(value)

void CTest::TestJoseph(){ CircleList jobs; for(int i=1; i<16; i++) { jobs.AddTail(i); } jobs.SetBegin(); // 最后留下1个人，也就是说要删除14个人 int len = jobs.GetCount(); f

#pragma once#include using namespace std;/** * 结点类 */template class ListNode{private: T data; ListNode *next;public: ListNode():next(NULL){} ListNode(T value):data(value)

/** * 字符串模式匹配BF算法 */int QString::Find(const char *pstr, const char *psubstr, int start){ int lenstr = strlen(pstr); int lensbustr = strlen(psubstr); int i=start; int j=0; whi

// 大整数问题void BigInt(int *pNum1, int size1, int *pNum2, int size2, int *pRet){ if(pRet == NULL) return; memset(pRet, 0, sizeof(int) * (size1 + size2)); for(int i = 0; i < si

#include "LinkStack.hpp"#include using namespace std;int main(){ LinkStack stack; cout << "输入带括号的字符串 ((a)(b))" << endl; char ch;

#ifndef LINKSTACK_H#define LINKSTACK_H#include using namespace std;template class LinkStackNode { public: T data; LinkStack

#ifndef SEQUENCESTACK_H#define SEQUENCESTACK_H#include #include // 断言using namespace std;template class SequenceStack { private

#include #include using namespace std;int main(){ vector squares(100); for(unsigned int i = 0; i< squares.size(); i++) squares[i] = i * i; for(unsigned int i=0; i<squares.size

#ifndef IntCell_H#define IntCell_Hclass IntCell{ public: explicit IntCell(int initialValue = 0); int read() const; void write(int x); private: int storedValue; };#

#pragma once#include #include #include #include template class BinaryTreeNode{public: BinaryTreeNode() : m_pLeft(NULL), m_pRight(NULL), m_pParent(NULL){} BinaryTreeNode(const T