<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[C__Monkey的专栏]]></title><description><![CDATA[我可以接受失败，但绝对不能接受自己都未曾奋斗过。－迈克·乔丹]]></description><link>https://blog.youkuaiyun.com/C__Monkey</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; C__Monkey]]></copyright><item><title><![CDATA[二叉树的遍历以及搜索]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079685</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079685</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 08:47:45 +0800</pubDate><description><![CDATA[#include 
#include 
#define ElemType char
#define  MaxQsize 20
#define TRUE 1
#define FALSE 0

using namespace std;

typedef struct BiTNode
{
   ElemType data;
   struct BiTNode *lchild,*r]]></description><category></category></item><item><title><![CDATA[循环队列]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079623</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079623</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 08:15:29 +0800</pubDate><description><![CDATA[循环队列的类型定义
　　#define QueueSize 100 //应根据具体情况定义该值


　　typedef char DataType; //DataType的类型依赖于具体的应用


　　typedef struct{


　　int front; //头指针，队非空时指向队头元素


　　int rear; //尾指针，队非空时指向队尾元素的下一位置]]></description><category></category></item><item><title><![CDATA[二分查找算法 递归和非递归]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079611</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079611</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 08:02:16 +0800</pubDate><description><![CDATA[二分查找算法： 

1) 递归方法实现： 

int BSearch(elemtype a[],elemtype x,int low,int high) 

/*在下届为low，上界为high的数组a中折半查找数据元素x*/ 

{ 

int mid; 

if(low>high) return -1; 

mid=(low+high)/2; 

if(x==a[]]></description><category></category></item><item><title><![CDATA[优先队列priority_queue容器的使用方法：出队，入队，删除队首元素，判断是否为空]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079606</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079606</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:53:50 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
priority_queue pq;

//入队，插入新元素；
pq.push(1);
pq.push(2);
pq.push(3);
pq.push(9);

//返回队列中元素数目；
cout 

//所有元素出队，删除所有元素
while (p]]></description><category></category></item><item><title><![CDATA[用vector向量容器装入10个整数，使用迭代器iterator和accumulate算法统计这10个元素的和]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079605</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079605</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:53:14 +0800</pubDate><description><![CDATA[#include 
#include 
#include 


using namespace std;


int main()
{
vector v;


int n;

for (vector::size_type i=0; i 
{
cin >> n;
v.push_back(n);
}


for(vector::iterator index]]></description><category></category></item><item><title><![CDATA[用map实现数字分离]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079604</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079604</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:52:43 +0800</pubDate><description><![CDATA[#pragma warning(disable:4786)
#include 
#include 
#include 
using namespace std;


int main()
{
map m;
m['0'] = 0;
m['1'] = 1;
m['2'] = 2;
m['3'] = 3;
m['4'] = 4;
m['5'] = 5;
m['6'] =]]></description><category></category></item><item><title><![CDATA[双向链表容器list的头尾中，全部删除]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079602</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079602</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:51:53 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
list l;
for (size_t i=1; i 
{
l.push_back(i);
}


list::iterator it;
for(it=l.begin(); it != l.end(); ++it)
{
cout 
}
cout]]></description><category></category></item><item><title><![CDATA[双向链表容器list的头部、尾部、中间的插入]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079601</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079601</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:51:27 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
list l;

//从尾部插入
for (size_t i=1; i != 6; ++i)
{
l.push_back(i);
}

list::iterator it;
for(it=l.begin(); it != l.end(); ++it)
{]]></description><category></category></item><item><title><![CDATA[容器元素的删除erase,size，clear方法的使用]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079600</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079600</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:50:48 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
vector v;


for(size_t i=0; i !=10 ; ++i)
{
v.push_back(i);
}


for (vector::iterator it =v.begin(); it != v.end(); ++it)
{
co]]></description><category></category></item><item><title><![CDATA[把字符指针赋给一个字符串对象]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079599</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079599</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:50:17 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
string s;
char ss[50000];
scanf("%s",&ss);//注意字符数组的数据名也要取地址，不然ss只是指向第一个字符的地址；
s = ss;   //直接把指针赋值给string 对象了

cout 

return 0;]]></description><category></category></item><item><title><![CDATA[把输入的整数或者实数数据当成字符串来处理，方便]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079598</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079598</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:49:33 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;




int main()
{
string s;
s="123456789";
int sum =0;
for (size_t i=0; i != s.length() ; ++i)
{
if(s[i]=='1')
sum+=1;
if(s[i]=='2')]]></description><category></category></item><item><title><![CDATA[vertor容器里面的insert()方面要求插入的位置，是元素的迭代器位置，而不是元素的下标]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079597</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079597</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:47:48 +0800</pubDate><description><![CDATA[#include 
#include 


using namespace std;


int main()
{
vector v(5);


v[0]=0;
v[1]=2;
v[2]=4;

vector::iterator index;
for(index = v.begin(); index != v.end(); ++index)
{
cout]]></description><category></category></item><item><title><![CDATA[string对象追加可用加号或者用append追加]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079595</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079595</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:47:07 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
string s;
s.append("123");
s.append("abc");
s.append("456");


cout 


cin.get();
return 0;
}]]></description><category></category></item><item><title><![CDATA[string对象与数值相互转换]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079594</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079594</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:46:27 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;


//c++方法：将数值转换为string


string converToString(double x)
{
ostringstream o;
if (o 
return o.str();
return "conversion error";
}


/]]></description><category></category></item><item><title><![CDATA[string对象的insert,replace,earse,变成空串的方法]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079593</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079593</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:44:59 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
string s;
s = "abcdedf";
//插入
string::iterator it;
s.insert(s.begin(),'1');
cout 
cout 
cout 
//替换,从第三个位置，连续4个位置，替换fan
s.replace]]></description><category></category></item><item><title><![CDATA[stack容器的用法：入栈、出栈、访问栈顶元素，判断是否为空]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079592</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079592</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:43:39 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
stack s;
//入栈
s.push(1);
s.push(2);
s.push(3);
s.push(4);
s.push(9);

//读取栈顶元素
cout 

//返回堆栈元素数量
cout 

//判断堆栈是否为空
cout]]></description><category></category></item><item><title><![CDATA[sort默认升序排序]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079591</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079591</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:41:44 +0800</pubDate><description><![CDATA[#include 
#include 
#include  //reverse ,sort算法用的到


using namespace std;


int main()
{
vector v;
for (size_t i=0; i != 10; ++i)
{
v.push_back(i);
}

vector::iterator it ;


for (i]]></description><category></category></item><item><title><![CDATA[set容器元素的插入和中序遍历，反向遍历，反向迭代器reverse_iterator和rbegin(),rend();]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079590</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079590</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:41:09 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
set s;
s.insert(1);
s.insert(12);
s.insert(6);
s.insert(8);//没用


//中序遍历集合中的所有元素


set::iterator it;
for (it=s.begin(); it !=]]></description><category></category></item><item><title><![CDATA[reverse反向排列]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079589</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079589</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:40:34 +0800</pubDate><description><![CDATA[#include 
#include 
#include  //reverse算法用的到


using namespace std;


int main()
{
vector v;

for (size_t i=0; i != 10; ++i)
{
v.push_back(i);
}

vector::iterator it;
for (it=v.begin]]></description><category></category></item><item><title><![CDATA[queue队列容器入队，出队，读取队首元素，队尾元素，判断是否为空]]></title><link>https://blog.youkuaiyun.com/C__Monkey/article/details/8079588</link><guid>https://blog.youkuaiyun.com/C__Monkey/article/details/8079588</guid><author>C__Monkey</author><pubDate>Wed, 17 Oct 2012 07:40:07 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{


queue q;
q.push(1);
q.push(2);
q.push(3);
q.push(9);


//返回队列元素数量
cout 


//队列是否为空
cout 


//读取队首元素
cout 


//读取队尾]]></description><category></category></item></channel></rss>