<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hale1007的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hale1007</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hale1007]]></copyright><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/51655394</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/51655394</guid><author>hale1007</author><pubDate>Mon, 13 Jun 2016 10:02:29 +0800</pubDate><description><![CDATA[欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来，用它写博客，将会带来全新的体验哦：
Markdown和扩展Markdown简洁的语法
代码块高亮
图片链接和图片上传
LaTex数学公式
UML序列图和流程图
离线写博客
导入导出Markdown文件
丰富的快捷键
快捷键
加粗    Ctrl + B 
斜体    Ctrl + I 
引用    Ctrl]]></description><category></category></item><item><title><![CDATA[Xcode 自定义Log]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/48442121</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/48442121</guid><author>hale1007</author><pubDate>Mon, 14 Sep 2015 17:29:17 +0800</pubDate><description><![CDATA[常用写法，功能简单：
#ifdef DEBUG
#define JFLog(...)  NSLog(__VA_ARGS__)

#else
#define JFLog(...)

#endif





更复杂的写法，能打印更多调试信息：
#ifdef DEBUG

#define JFLog(...)  NSLog(@"%s %d\n %@\n", __func__, __LIN]]></description><category></category></item><item><title><![CDATA[Request failed: unacceptable content-type: text/plain]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/46973449</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/46973449</guid><author>hale1007</author><pubDate>Mon, 20 Jul 2015 20:38:05 +0800</pubDate><description><![CDATA[今天利用AFNetworking框架发送一个POST请求，结果始终失败
刚开始找错了方向，以为是参数拼接错误，仔细检查之后，原来是因为
AFN的AFJSONResponseSerializer默认不支持text/plain类型


解决办法：
找到AFN框架下的 AFURLResponseSerialization.m 文件的第223行 添加一个参数即可。

修改为：
self.]]></description><category></category></item><item><title><![CDATA[ARC forbids explicit message send of 'autolease']]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/46878703</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/46878703</guid><author>hale1007</author><pubDate>Tue, 14 Jul 2015 15:36:04 +0800</pubDate><description><![CDATA[原因很明显，是导入了非ARC的第三方库。虽然可以在项目的build setting 里面将项目改为非ARC，暂时解决这个问题。但是蛋疼的是其他用到ARC的地方又有问题了。
所以比较好的办法是告诉编译器，对这个第三方的库要用非ARC方式编译，其他的继续用ARC。


解决办法：
找到项目的Build Phase里面的Complie Sources，找到对应的编译不过的源文件。双击，在右边的]]></description><category></category></item><item><title><![CDATA[libxml/tree.h file not found]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/46878469</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/46878469</guid><author>hale1007</author><pubDate>Tue, 14 Jul 2015 15:19:21 +0800</pubDate><description><![CDATA[虽然导入了libxml2库，但是找不到，原因是路径错误。按下图样式增加一行路径配置即可
$SDKROOT/usr/include/libxml2]]></description><category></category></item><item><title><![CDATA[[LeetCode] Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40878207</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40878207</guid><author>hale1007</author><pubDate>Fri, 07 Nov 2014 01:21:09 +0800</pubDate><description><![CDATA[Given a string S,
 find the longest palindromic substring in S.
 You may assume that the maximum length of S is
 1000, and there exists one unique longest palindromic substring.]]></description><category></category></item><item><title><![CDATA[单链表的逆置]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40738485</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40738485</guid><author>hale1007</author><pubDate>Mon, 03 Nov 2014 11:43:52 +0800</pubDate><description><![CDATA[这种基础题面试时经常碰到，昨天去面试的时候。又碰到了。]]></description><category></category></item><item><title><![CDATA[求二叉树中节点的最大距离]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40738341</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40738341</guid><author>hale1007</author><pubDate>Mon, 03 Nov 2014 11:35:51 +0800</pubDate><description><![CDATA[昨天面试问道这个问题，这个问题在编程之美上见过，但是不记得过程了。没答上来。jin]]></description><category></category></item><item><title><![CDATA[[LeetCode] Word Ladder]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40686899</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40686899</guid><author>hale1007</author><pubDate>Sat, 01 Nov 2014 22:27:14 +0800</pubDate><description><![CDATA[Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:

Only one letter can be changed at a timeEach intermediate word m]]></description><category></category></item><item><title><![CDATA[[LeetCode] Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40683841</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40683841</guid><author>hale1007</author><pubDate>Sat, 01 Nov 2014 19:57:35 +0800</pubDate><description><![CDATA[Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

The matching should cover t]]></description><category></category></item><item><title><![CDATA[[LeetCode] Permutations II]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40682803</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40682803</guid><author>hale1007</author><pubDate>Sat, 01 Nov 2014 18:07:08 +0800</pubDate><description><![CDATA[Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following unique permutations:
[1,1,2], [1,2,1],
 and [2,1,1].]]></description><category></category></item><item><title><![CDATA[[LeetCode] Permutations]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40682793</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40682793</guid><author>hale1007</author><pubDate>Sat, 01 Nov 2014 18:01:57 +0800</pubDate><description><![CDATA[Given a collection of numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],
 and [3,2,1].
class Solution ]]></description><category></category></item><item><title><![CDATA[[LeetCode] Validate Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40594485</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40594485</guid><author>hale1007</author><pubDate>Wed, 29 Oct 2014 22:14:59 +0800</pubDate><description><![CDATA[Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node's key.Th]]></description><category></category></item><item><title><![CDATA[[LeetCode] Recover Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40594249</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40594249</guid><author>hale1007</author><pubDate>Wed, 29 Oct 2014 22:07:12 +0800</pubDate><description><![CDATA[Two elements of a binary search tree (BST) are swapped by mistake.

Recover the tree without changing its structure.
Note:
A solution using O(n)
 space is pretty straight forward. Could you devis]]></description><category></category></item><item><title><![CDATA[[LeetCode] Word Search]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40483381</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40483381</guid><author>hale1007</author><pubDate>Sun, 26 Oct 2014 22:37:55 +0800</pubDate><description><![CDATA[Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically]]></description><category></category></item><item><title><![CDATA[[LeetCode] Jump Game]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40402201</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40402201</guid><author>hale1007</author><pubDate>Thu, 23 Oct 2014 19:09:14 +0800</pubDate><description><![CDATA[Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine i]]></description><category></category></item><item><title><![CDATA[[LeetCode] Jump Game II]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40402225</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40402225</guid><author>hale1007</author><pubDate>Thu, 23 Oct 2014 19:07:26 +0800</pubDate><description><![CDATA[Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal i]]></description><category></category></item><item><title><![CDATA[[LeetCode] Combination Sum II]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40399925</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40399925</guid><author>hale1007</author><pubDate>Thu, 23 Oct 2014 16:38:47 +0800</pubDate><description><![CDATA[Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbers sums to T.

Each number in C may only be used once in the combina]]></description><category></category></item><item><title><![CDATA[[LeetCode] Combination Sum]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40398953</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40398953</guid><author>hale1007</author><pubDate>Thu, 23 Oct 2014 15:51:50 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited numb]]></description><category></category></item><item><title><![CDATA[[LeetCode] First Missing Positive]]></title><link>https://blog.youkuaiyun.com/hale1007/article/details/40398403</link><guid>https://blog.youkuaiyun.com/hale1007/article/details/40398403</guid><author>hale1007</author><pubDate>Thu, 23 Oct 2014 15:30:42 +0800</pubDate><description><![CDATA[Given an unsorted integer array, find the first missing positive integer.

For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.

Your algorithm should run in O(n) time and uses constant]]></description><category></category></item></channel></rss>