<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cuijianhui的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cuijianhui</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cuijianhui]]></copyright><item><title><![CDATA[约瑟夫环问题]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/83453047</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/83453047</guid><author>cuijianhui</author><pubDate>Sun, 23 Aug 2009 09:19:35 +0800</pubDate><description><![CDATA[

问题描述：n个人（编号从1到n），从1开始报数，报到m的退出，剩下的人继续从1开始报数。求胜利者的编号。

 

C语言指针版本


 



 1:  #include &amp;lt;stdio.h&amp;gt;
 2:  #include &amp;lt;stdlib.h&amp;gt;
 3:  
 4:  int main()
 5:  {
 6:      int n,m;
 ...]]></description><category></category></item><item><title><![CDATA[对C++中string类型的总结]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/83453046</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/83453046</guid><author>cuijianhui</author><pubDate>Sun, 23 Aug 2009 09:17:57 +0800</pubDate><description><![CDATA[

string类对象的构造
简化构造函数原型如下（注意，为了简便，把模板中最后一个默认参数省略了）：




1:  explicit basic_string();
2:  string(const char *s);
3:  string(const char *s, size_type n);
4:  string(const string&amp;amp; str);
5:...]]></description><category></category></item><item><title><![CDATA[二叉树]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4210383</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4210383</guid><author>cuijianhui</author><pubDate>Sat, 23 May 2009 11:00:00 +0800</pubDate><description><![CDATA[#ifndef BINARYTREETWO_H#define BINARYTREETWO_H #include "LinkedQueue.h"#include "LinkedStack.h" template class T> struct BinTreeNode //二叉树结点类定义{     T data;  //数据域    BinTreeNodeT>]]></description><category></category></item><item><title><![CDATA[二叉搜索树]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4210379</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4210379</guid><author>cuijianhui</author><pubDate>Sat, 23 May 2009 10:59:00 +0800</pubDate><description><![CDATA[#ifndef BST_H#define BST_H #include using namespace std; templateclass K,class T>struct BSTNode     //二叉搜索树结点类{     K key;   //关键码域     T data;  //数据域     BSTNodeK,T> *left,*righ]]></description><category></category></item><item><title><![CDATA[静态搜索表]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4210373</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4210373</guid><author>cuijianhui</author><pubDate>Sat, 23 May 2009 10:57:00 +0800</pubDate><description><![CDATA[#ifndef STATICSEARCHLIST_H#define STATICSEARCHLIST_H #include #include using namespace std; const int defaultSize = 100; templateclass K,class T>class StaticSearchList; //数据表类的前视定义]]></description><category></category></item><item><title><![CDATA[表达式的计算(链栈表示)]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4167548</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4167548</guid><author>cuijianhui</author><pubDate>Mon, 11 May 2009 13:05:00 +0800</pubDate><description><![CDATA[注：此代码只能完成简单的加减乘除四则运算，但是不支持单目运算，更复杂的形式留待以后有时间再进一步完善。  #include "LinkedStack.h"#include  class Calculator{public:     Calculator()     {         t.MakeEmpty();         t.Push(#]]></description><category></category></item><item><title><![CDATA[多项式及其运算(用单链表表示)]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4165514</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4165514</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 15:59:00 +0800</pubDate><description><![CDATA[#ifndef POLYNOMAL_H#define POLYNOMAL_H #include #include using namespace std; struct Term   //多项式结点的定义{     float coef;   //系数     int exp; //指数     Term *link;   //链域     Term]]></description><category></category></item><item><title><![CDATA[最小优先级队列(数组表示)]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164930</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164930</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:45:00 +0800</pubDate><description><![CDATA[ #ifndef PQUEUE_H#define PQUEUE_H #include #include  const int DefaultPQSize = 50;    //优先级队列数组的默认长度 templateclass T>class PQueue{public:     PQueue(int sz = DefaultPQSize);]]></description><category></category></item><item><title><![CDATA[约瑟夫环问题(循环链表表示)]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164923</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164923</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:44:00 +0800</pubDate><description><![CDATA[ #include "CircList.h" templateclass T>void Josephus(CircListT> &Js,int n,int m)     //n---总数，m---目标数{     CircLinkNodeT> *p = Js.GetHead()->link,*pre = NULL;     for (int i = 0;i n-1;++]]></description><category></category></item><item><title><![CDATA[循环链表]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164919</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164919</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:43:00 +0800</pubDate><description><![CDATA[ #ifndef CIRCLIST_H#define CIRCLIST_H #include using namespace std; templateclass T>struct CircLinkNode {     T data;     CircLinkNodeT> *link;     CircLinkNode(CircLinkNodeT> ]]></description><category></category></item><item><title><![CDATA[循环队列]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164912</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164912</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:40:00 +0800</pubDate><description><![CDATA[#ifndef SEQQUEUE_H#define SEQQUEUE_H #include #include using namespace std; templateclass T>class SeqQueue{public:     SeqQueue(int sz = 10);     ~SeqQueue()     {         ]]></description><category></category></item><item><title><![CDATA[顺序栈]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164909</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164909</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:40:00 +0800</pubDate><description><![CDATA[ #ifndef SEQSTACK_H#define SEQSTACK_H #include #include using namespace std; const int stackIncreament = 20;  //栈溢出时扩展空间的增量 templateclass T>class SeqStack{public:     SeqSt]]></description><category></category></item><item><title><![CDATA[顺序表]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164904</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164904</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:38:00 +0800</pubDate><description><![CDATA[ #ifndef SEQLIST_H#define SEQLIST_H #include using namespace std; const int defaultSize = 100;const int increasement = 50; templateclass T>class SeqList{public:     SeqList]]></description><category></category></item><item><title><![CDATA[双向链表]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164898</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164898</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:37:00 +0800</pubDate><description><![CDATA[ #ifndef DBLLIST_H#define DBLLIST_H #include using namespace std; templateclass T>struct DblNode {     T data;  //链表结点数据     DblNodeT> *lLink,*rLink;   //链表前驱(左链)、后继(右链)指针     ]]></description><category></category></item><item><title><![CDATA[双端队列(数组表示)]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164894</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164894</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:35:00 +0800</pubDate><description><![CDATA[ #ifndef SEQDEQUE_H#define SEQDEQUE_H #include #include using namespace std; templateclass T>class SeqDeque{public:     SeqDeque(int sz = 100);     ~SeqDeque()     {     ]]></description><category></category></item><item><title><![CDATA[双端队列(链表表示)]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164888</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164888</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:33:00 +0800</pubDate><description><![CDATA[ #ifndef LINKEDDEQUE_H#define LINKEDDEQUE_H #include #include using namespace std; templateclass T>struct LinkNode        //链式队列节点类的定义{     T data;  //数据域     LinkNodeT> *link;]]></description><category></category></item><item><title><![CDATA[链式栈]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164871</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164871</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:28:00 +0800</pubDate><description><![CDATA[ #ifndef LINKEDSTACK_H#define LINKEDSTACK_H #include #include using namespace std; templateclass T>struct LinkNode        //链栈节点类的定义{     T data;  //数据域     LinkNodeT> *link; /]]></description><category></category></item><item><title><![CDATA[链式队列]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164865</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164865</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:27:00 +0800</pubDate><description><![CDATA[ #ifndef LINKEDQUEUE_H#define LINKEDQUEUE_H #include #include using namespace std; templateclass T>struct LinkNode        //链式队列节点类的定义{     T data;  //数据域     LinkNodeT> *link;]]></description><category></category></item><item><title><![CDATA[静态链表]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164859</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164859</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:24:00 +0800</pubDate><description><![CDATA[注：此代码还没有完全完善，也不太想去完善了，等以后要用的时候再完善吧   #ifndef STATICLIST_H#define STATICLIST_H #include using namespace std; const int maxSize = 100;    //静态链表大小 templateclass T>struct  SLink]]></description><category></category></item><item><title><![CDATA[单链表]]></title><link>https://blog.youkuaiyun.com/cuijianhui/article/details/4164846</link><guid>https://blog.youkuaiyun.com/cuijianhui/article/details/4164846</guid><author>cuijianhui</author><pubDate>Sun, 10 May 2009 10:17:00 +0800</pubDate><description><![CDATA[#ifndef  LINKEDLIST_H#define LINKEDLIST_H #include using namespace std; templateclass T>struct LinkNode        //链表节点类的定义{     T data;  //数据域     LinkNodeT> *link; //链指针域     Lin]]></description><category></category></item></channel></rss>