<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ice_camel的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ice_camel</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ice_camel]]></copyright><item><title><![CDATA[字符串的全排列]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/50396393</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/50396393</guid><author>ice_camel</author><pubDate>Thu, 24 Dec 2015 19:12:00 +0800</pubDate><description><![CDATA[题目描述 输入一个字符串，打印出该字符串中字符的全排列。解法一：递归实现 
 从未打印字符中选择一个打印，递归打印剩余字符。具体实现：将要打印的字符移动到剩余字符串的头部，递归至没有剩余字符时一起全部打印。 
C++代码：void permutation(string &str, int start)
{
    if (start == str.size()) {
        cout <<]]></description><category></category></item><item><title><![CDATA[字符串的包含]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/50390819</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/50390819</guid><author>ice_camel</author><pubDate>Thu, 24 Dec 2015 00:33:41 +0800</pubDate><description><![CDATA[题目描述 给定一个字符串a和一短字符串b，只包含小写字母，判断b中元素是否都在a中？
a是”abcd”，b是”bad”，答案是true
a是”abcd”，b是”bce”，答案是false
a是”abcd”，b是”aa”，答案是true
解法一：蛮力轮询 轮询字符串b中每个字符，逐一与a中字符比较。
  时间复杂度：O(nm)； 空间复杂度：O(1)
C++代码：bool stringContain_]]></description><category></category></item><item><title><![CDATA[字符串的旋转]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/50383460</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/50383460</guid><author>ice_camel</author><pubDate>Wed, 23 Dec 2015 00:19:00 +0800</pubDate><description><![CDATA[题目描述给定一个字符串，要求将字符串的前若干(m)位字符移动到字符串的尾部。
**例如**：将字符串"abcdef"的前3个字符'a'、'b'和'c'移到字符串的尾部，得到"defabc"。
解法一：n轮移动，每轮中将每个字符左移一位。  时间复杂度：O(mn)； 空间复杂度：O(1)void leftRotateString_1(string &str, int m)
{
    if (m <]]></description><category></category></item><item><title><![CDATA[06-图4. Saving James Bond - Hard Version (30)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47980833</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47980833</guid><author>ice_camel</author><pubDate>Tue, 25 Aug 2015 18:06:03 +0800</pubDate><description><![CDATA[06-图4. Saving James Bond - Hard Version (30)



时间限制

400 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




This time let us consider]]></description><category></category></item><item><title><![CDATA[05-图3. 六度空间 (30)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47069413</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47069413</guid><author>ice_camel</author><pubDate>Sun, 26 Jul 2015 16:58:39 +0800</pubDate><description><![CDATA[05-图3. 六度空间 (30)



时间限制

1500 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard




“六度空间”理论又称作“六度分隔（Six Degrees of Separation）”理论。这个理论可以通俗地阐述为：“你和任何一个陌生人之间所]]></description><category></category></item><item><title><![CDATA[05-图2. Saving James Bond - Easy Version (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47062445</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47062445</guid><author>ice_camel</author><pubDate>Sun, 26 Jul 2015 00:21:01 +0800</pubDate><description><![CDATA[05-图2. Saving James Bond - Easy Version (25)



时间限制

200 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




This time let us consider]]></description><category></category></item><item><title><![CDATA[05-图1. List Components (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47058019</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47058019</guid><author>ice_camel</author><pubDate>Sat, 25 Jul 2015 16:58:26 +0800</pubDate><description><![CDATA[05-图1. List Components (25)



时间限制

200 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




For a given undirected graph with N vertic]]></description><category></category></item><item><title><![CDATA[04-树9. Path in a Heap (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47054519</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47054519</guid><author>ice_camel</author><pubDate>Sat, 25 Jul 2015 10:59:50 +0800</pubDate><description><![CDATA[04-树9. Path in a Heap (25)



时间限制

150 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




Insert a sequence of given numbers into an ]]></description><category></category></item><item><title><![CDATA[04-树8. Complete Binary Search Tree (30)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47053959</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47053959</guid><author>ice_camel</author><pubDate>Sat, 25 Jul 2015 10:21:11 +0800</pubDate><description><![CDATA[04-树8. Complete Binary Search Tree (30)



时间限制

100 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




A Binary Search Tree (BST) is ]]></description><category></category></item><item><title><![CDATA[04-树7. Search in a Binary Search Tree (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47053539</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47053539</guid><author>ice_camel</author><pubDate>Sat, 25 Jul 2015 09:43:26 +0800</pubDate><description><![CDATA[04-树7. Search in a Binary Search Tree (25)



时间限制

100 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




To search a key in a binary]]></description><category></category></item><item><title><![CDATA[04-树6. Huffman Codes (30)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47053193</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47053193</guid><author>ice_camel</author><pubDate>Sat, 25 Jul 2015 09:15:53 +0800</pubDate><description><![CDATA[04-树6. Huffman Codes (30)



时间限制

200 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




In 1953, David A. Huffman published his pape]]></description><category></category></item><item><title><![CDATA[04-树5. File Transfer (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47011127</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47011127</guid><author>ice_camel</author><pubDate>Wed, 22 Jul 2015 22:29:37 +0800</pubDate><description><![CDATA[04-树5. File Transfer (25)



时间限制

150 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




We have a network of computers and a list of]]></description><category></category></item><item><title><![CDATA[04-树4. Root of AVL Tree (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/47009167</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/47009167</guid><author>ice_camel</author><pubDate>Wed, 22 Jul 2015 20:34:51 +0800</pubDate><description><![CDATA[04-树4. Root of AVL Tree (25)



时间限制

100 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




An AVL tree is a self-balancing binary se]]></description><category></category></item><item><title><![CDATA[03-树3. Tree Traversals Again (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46998763</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46998763</guid><author>ice_camel</author><pubDate>Wed, 22 Jul 2015 09:58:11 +0800</pubDate><description><![CDATA[03-树3. Tree Traversals Again (25)



时间限制

200 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




An inorder binary tree traversal can]]></description><category></category></item><item><title><![CDATA[03-树2. List Leaves (25)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46975321</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46975321</guid><author>ice_camel</author><pubDate>Mon, 20 Jul 2015 22:33:27 +0800</pubDate><description><![CDATA[03-树2. List Leaves (25)



时间限制

400 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




Given a tree, you are supposed to list all the]]></description><category></category></item><item><title><![CDATA[03-树1. 二分法求多项式单根(20)]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46974041</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46974041</guid><author>ice_camel</author><pubDate>Mon, 20 Jul 2015 21:09:10 +0800</pubDate><description><![CDATA[03-树1. 二分法求多项式单根(20)



时间限制

400 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

杨起帆（浙江大学城市学院）




二分法求函数根的原理为：如果连续函数f(x)在区间[a, b]的两个端点取值异号，即f(a]]></description><category></category></item><item><title><![CDATA[02-线性结构3. 求前缀表达式的值（25）]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46973217</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46973217</guid><author>ice_camel</author><pubDate>Mon, 20 Jul 2015 20:13:41 +0800</pubDate><description><![CDATA[02-线性结构3. 求前缀表达式的值（25）



时间限制

400 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard




算术表达式有前缀表示法、中缀表示法和后缀表示法等形式。前缀表达式指二元运算符位于两个运算数之前，例如2+3*(7-4)+8/4的前缀表达]]></description><category></category></item><item><title><![CDATA[#29 Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46959549</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46959549</guid><author>ice_camel</author><pubDate>Sun, 19 Jul 2015 22:53:41 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/divide-two-integers/




Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.



int divide(in]]></description><category></category></item><item><title><![CDATA[#28 Implement strStr()]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46957325</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46957325</guid><author>ice_camel</author><pubDate>Sun, 19 Jul 2015 19:31:57 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/implement-strstr/




Implement strStr().

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Update]]></description><category></category></item><item><title><![CDATA[#27 Remove Element]]></title><link>https://blog.youkuaiyun.com/ice_camel/article/details/46956209</link><guid>https://blog.youkuaiyun.com/ice_camel/article/details/46956209</guid><author>ice_camel</author><pubDate>Sun, 19 Jul 2015 17:13:21 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/remove-element/




Given an array and a value, remove all instances of that value in place and return the new length.

The order of elements can be changed. ]]></description><category></category></item></channel></rss>