<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[donshing的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/donshing</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; donshing]]></copyright><item><title><![CDATA[颠倒一个句子中的词的顺序，比如将“我叫克丽丝”转换为“克丽丝叫我”，实现速度最快，移动最少]]></title><link>https://blog.youkuaiyun.com/donshing/article/details/12432245</link><guid>https://blog.youkuaiyun.com/donshing/article/details/12432245</guid><author>donshing</author><pubDate>Tue, 08 Oct 2013 14:23:45 +0800</pubDate><description><![CDATA[如“I am a student”--->"student a am I"

 
void swap(char* a,char* b)
{
	*a =*a^*b;
	*b =*a^*b;
	*a =*a^*b;
}

void ReverseWord(char* input,int len)
{	
	int low = 0;
	int high = 0;
	while(high<len)
	{]]></description><category></category></item><item><title><![CDATA[一棵排序二叉树，令 f=(最大值+最小值)/2，  设计一个算法，找出距离f 值最近、大于f 值的结点。  复杂度如果是O(n2)则不得分]]></title><link>https://blog.youkuaiyun.com/donshing/article/details/12349793</link><guid>https://blog.youkuaiyun.com/donshing/article/details/12349793</guid><author>donshing</author><pubDate>Sun, 06 Oct 2013 16:17:31 +0800</pubDate><description><![CDATA[RT

 
typedef struct BinTreeNode
{
	int	data;
	struct BinTreeNode *pLeft;
	struct BinTreeNode *pRight;
}*pBinTreeNode;
BinTreeNode*  GetCloseNode(BinTreeNode* root,int mid)
{
	BinTreeNode* node = NU]]></description><category></category></item><item><title><![CDATA[二叉树两个结点的最低共同父结点]]></title><link>https://blog.youkuaiyun.com/donshing/article/details/12346631</link><guid>https://blog.youkuaiyun.com/donshing/article/details/12346631</guid><author>donshing</author><pubDate>Sun, 06 Oct 2013 14:52:08 +0800</pubDate><description><![CDATA[题目：输入二叉树中的两个结点，输出这两个结点在数中最低的共同父结点。 

 
typedef struct BinTreeNode
{
	int	data;
	struct BinTreeNode *pLeft;
	struct BinTreeNode *pRight;

}*pBinTreeNode;
       BinTreeNode * getLCA(BinTreeNode * roo]]></description><category></category></item><item><title><![CDATA[求一个二叉树中任意两个节点间的最大距离]]></title><link>https://blog.youkuaiyun.com/donshing/article/details/12322775</link><guid>https://blog.youkuaiyun.com/donshing/article/details/12322775</guid><author>donshing</author><pubDate>Sat, 05 Oct 2013 23:58:33 +0800</pubDate><description><![CDATA[题目：求一个二叉树中任意两个节点间的最大距离， 两个节点的距离的定义是这两个节点间边的个数， 比如某个孩子节点和父节点间的距离是1，和相邻兄弟节点间的距离是2，优化时间空间复 杂度。 
看了那么多网上的答案，总觉得有点复杂，自己写了一个，欢迎指正
#define max(a,b) a>b?a:b

typedef struct BinTreeNode
{
int data;
stru]]></description><category></category></item></channel></rss>