<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Clearlemon]]></title><description><![CDATA[爱柠乐~]]></description><link>https://blog.youkuaiyun.com/budlele</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; budlele]]></copyright><item><title><![CDATA[剑指offer 09:斐波那契数列]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44161005</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44161005</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 21:43:46 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#defin]]></description><category></category></item><item><title><![CDATA[剑指offer:08 旋转数组的最小数字]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44160787</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44160787</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 21:33:33 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#defin]]></description><category></category></item><item><title><![CDATA[剑指offer :07 用两个栈实现队列]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44158975</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44158975</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 19:52:22 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#defin]]></description><category></category></item><item><title><![CDATA[剑指offer 06：重建二叉树]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44158511</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44158511</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 19:22:54 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#defin]]></description><category></category></item><item><title><![CDATA[剑指offer 05: 从尾到头打印链表]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44156835</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44156835</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 16:53:49 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#define MP make_]]></description><category></category></item><item><title><![CDATA[剑指offer 04 ：替换空格]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44155633</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44155633</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 15:46:59 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#define MP make_]]></description><category></category></item><item><title><![CDATA[剑指offer  03：二维数组中的查找]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44155093</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44155093</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 15:08:30 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define PB push_back
#define MP make_]]></description><category></category></item><item><title><![CDATA[Linux多线程二]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44152887</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44152887</guid><author>budlele</author><pubDate>Mon, 09 Mar 2015 11:34:38 +0800</pubDate><description><![CDATA[客户端
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include 

#define MAXN 1024
#define client_port 12580

struct sockaddr_in]]></description><category></category></item><item><title><![CDATA[Linux多线程一]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/44089319</link><guid>https://blog.youkuaiyun.com/budlele/article/details/44089319</guid><author>budlele</author><pubDate>Thu, 05 Mar 2015 23:59:46 +0800</pubDate><description><![CDATA[客户端
#include
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#define MAXN 1024

static void *thread_send(void *arg)  
{  
	    char str[MAXN];]]></description><category></category></item><item><title><![CDATA[Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43741593</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43741593</guid><author>budlele</author><pubDate>Wed, 11 Feb 2015 21:48:48 +0800</pubDate><description><![CDATA[Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most two transactions.

Note:

You ma]]></description><category></category></item><item><title><![CDATA[Best Time to Buy and Sell Stock II]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43740449</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43740449</guid><author>budlele</author><pubDate>Wed, 11 Feb 2015 21:17:54 +0800</pubDate><description><![CDATA[Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on]]></description><category></category></item><item><title><![CDATA[Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43740077</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43740077</guid><author>budlele</author><pubDate>Wed, 11 Feb 2015 21:00:45 +0800</pubDate><description><![CDATA[Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),]]></description><category></category></item><item><title><![CDATA[Minimum Path Sum]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43739749</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43739749</guid><author>budlele</author><pubDate>Wed, 11 Feb 2015 20:43:54 +0800</pubDate><description><![CDATA[Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at]]></description><category></category></item><item><title><![CDATA[Unique Paths II]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43739187</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43739187</guid><author>budlele</author><pubDate>Wed, 11 Feb 2015 20:33:52 +0800</pubDate><description><![CDATA[Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively
 in the ]]></description><category></category></item><item><title><![CDATA[Unique Paths]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43738001</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43738001</guid><author>budlele</author><pubDate>Wed, 11 Feb 2015 20:14:56 +0800</pubDate><description><![CDATA[A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the ]]></description><category></category></item><item><title><![CDATA[Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43712829</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43712829</guid><author>budlele</author><pubDate>Tue, 10 Feb 2015 22:56:09 +0800</pubDate><description><![CDATA[Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],

the contiguous subarray [4,−1,2,1] ]]></description><category></category></item><item><title><![CDATA[Triangle]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43712709</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43712709</guid><author>budlele</author><pubDate>Tue, 10 Feb 2015 22:51:22 +0800</pubDate><description><![CDATA[Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle

[
     [2],
    [3,4],
   []]></description><category></category></item><item><title><![CDATA[Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43710339</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43710339</guid><author>budlele</author><pubDate>Tue, 10 Feb 2015 21:55:54 +0800</pubDate><description><![CDATA[Given a linked list, remove the nth node from the end of list and return its head.

For example,
   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the]]></description><category></category></item><item><title><![CDATA[Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43709809</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43709809</guid><author>budlele</author><pubDate>Tue, 10 Feb 2015 21:33:44 +0800</pubDate><description><![CDATA[Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

/**
 * Definition for binary tree
]]></description><category></category></item><item><title><![CDATA[Partition List]]></title><link>https://blog.youkuaiyun.com/budlele/article/details/43709533</link><guid>https://blog.youkuaiyun.com/budlele/article/details/43709533</guid><author>budlele</author><pubDate>Tue, 10 Feb 2015 21:21:13 +0800</pubDate><description><![CDATA[Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of]]></description><category></category></item></channel></rss>