<![CDATA[FelixTT的专栏]]>

<![CDATA[FelixTT的专栏]]>https://blog.youkuaiyun.com/FelixTTzh-cnhttps://blog.youkuaiyun.com/<![CDATA[第25题：写一个函数,它的原形是int continumax(char *outputstr,char *intputstr)，在字符串中找出连续最长的数字串，并把这个串的长度返回]]>https://blog.youkuaiyun.com/FelixTT/article/details/8229237https://blog.youkuaiyun.com/FelixTT/article/details/8229237FelixTTTue, 27 Nov 2012 12:35:07 +0800<![CDATA[4.在二元树中找出和为某一值的所有路径题目：输入一个整数和一棵二元树。从树的根结点开始往下访问一直到叶结点所经过的所有结点形成一条路径。打印出和与输入整数相等的所有路径。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8204885https://blog.youkuaiyun.com/FelixTT/article/details/8204885FelixTTTue, 20 Nov 2012 18:15:59 +0800<![CDATA[求子数组的最大和]]>https://blog.youkuaiyun.com/FelixTT/article/details/8181634https://blog.youkuaiyun.com/FelixTT/article/details/8181634FelixTTWed, 14 Nov 2012 10:22:21 +0800<![CDATA[求最长重复子串（后缀数组）]]>https://blog.youkuaiyun.com/FelixTT/article/details/8160146https://blog.youkuaiyun.com/FelixTT/article/details/8160146FelixTTWed, 07 Nov 2012 23:09:29 +0800<![CDATA[SQL语句先前写的时候，很容易把一些特殊的用法忘记，特此整理了一下SQL语句操作，方便写SQL时方便一点]]>https://blog.youkuaiyun.com/FelixTT/article/details/8159465https://blog.youkuaiyun.com/FelixTT/article/details/8159465FelixTTWed, 07 Nov 2012 20:33:08 +0800<![CDATA[目前最全的常用SQL语句示例(急用速查).]]>https://blog.youkuaiyun.com/FelixTT/article/details/8159437https://blog.youkuaiyun.com/FelixTT/article/details/8159437FelixTTWed, 07 Nov 2012 20:26:56 +0800<![CDATA[第20题：题目：输入一个表示整数的字符串，把该字符串转换成整数并输出。例如输入字符串"345"，则输出整数345。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8158860https://blog.youkuaiyun.com/FelixTT/article/details/8158860FelixTTWed, 07 Nov 2012 17:34:28 +0800<![CDATA[第18题：题目：n个数字（0,1,„,n-1）形成一个圆圈，从数字0开始，每次从这个圆圈中删除第m个数字（第一个为当前数字本身，第二个为当前数字的下一个数字）。当一个数字删除后，从被删除数字的下]]>https://blog.youkuaiyun.com/FelixTT/article/details/8158678https://blog.youkuaiyun.com/FelixTT/article/details/8158678FelixTTWed, 07 Nov 2012 16:59:06 +0800<![CDATA[第7题微软亚院之编程判断俩个链表是否相交给出俩个单向链表的头指针，比如h1，h2，判断这俩个链表是否相交，并找出第一个相交结点。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8158167https://blog.youkuaiyun.com/FelixTT/article/details/8158167FelixTTWed, 07 Nov 2012 15:30:26 +0800<![CDATA[一个n个整数序列取m个数，使其概率相同问题]]>https://blog.youkuaiyun.com/FelixTT/article/details/8155663https://blog.youkuaiyun.com/FelixTT/article/details/8155663FelixTTTue, 06 Nov 2012 23:54:42 +0800<![CDATA[在一个字符串中找到第一个只出现一次的字符。如输入abaccdeff，则输出b]]>https://blog.youkuaiyun.com/FelixTT/article/details/8149304https://blog.youkuaiyun.com/FelixTT/article/details/8149304FelixTTMon, 05 Nov 2012 16:05:46 +0800<![CDATA[输入一颗二元树，从上往下按层打印树的每个结点，同一层中按照从左往右的顺序打印。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8148162https://blog.youkuaiyun.com/FelixTT/article/details/8148162FelixTTMon, 05 Nov 2012 11:21:37 +0800<![CDATA[输入一颗二元查找树，将该树转换为它的镜像，即在转换后的二元查找树中，左子树的结点都大于右子树的结点。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8146204https://blog.youkuaiyun.com/FelixTT/article/details/8146204FelixTTSun, 04 Nov 2012 17:23:28 +0800<![CDATA[将矩阵右旋转90度]]>https://blog.youkuaiyun.com/FelixTT/article/details/8145946https://blog.youkuaiyun.com/FelixTT/article/details/8145946FelixTTSun, 04 Nov 2012 15:39:45 +0800<![CDATA[输入一个已经按升序排序过的数组和一个数字，在数组中查找两个数，使得它们的和正好是输入的那个数字。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8145888https://blog.youkuaiyun.com/FelixTT/article/details/8145888FelixTTSun, 04 Nov 2012 15:25:20 +0800输入那个数则，--end。若首尾元素和 #include using namespace std; //在m数组中查找和为sum的两个数，并将其输出 void FindNumber(int m[], int len, int sum) { int begin = 0; /]]><![CDATA[求二叉树中节点的最大距离]]>https://blog.youkuaiyun.com/FelixTT/article/details/8144580https://blog.youkuaiyun.com/FelixTT/article/details/8144580FelixTTSat, 03 Nov 2012 21:01:58 +0800<![CDATA[输入一个单向链表，输出该链表中倒数第k个结点。链表的倒数第0个结点为链表的尾指针。]]>https://blog.youkuaiyun.com/FelixTT/article/details/8144513https://blog.youkuaiyun.com/FelixTT/article/details/8144513FelixTTSat, 03 Nov 2012 20:32:21 +0800