<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[往事如风，生如夏花]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/samnancy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; samnancy]]></copyright><item><title><![CDATA[Count and Say@leetcode]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/43197341</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/43197341</guid><author>samnancy</author><pubDate>Tue, 27 Jan 2015 17:30:35 +0800</pubDate><description><![CDATA[leetcode原题的地址链接：https://oj.leetcode.com/problems/count-and-say/


题目内容如下：


The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...

1 is rea]]></description><category></category></item><item><title><![CDATA[Search for a Range @leetcode]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/43019789</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/43019789</guid><author>samnancy</author><pubDate>Thu, 22 Jan 2015 15:03:51 +0800</pubDate><description><![CDATA[leetcode原题的地址链接：https://oj.leetcode.com/problems/search-for-a-range/

题目内容如下：
Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm's runt]]></description><category></category></item><item><title><![CDATA[Search insert position @leetcode]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42962405</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42962405</guid><author>samnancy</author><pubDate>Wed, 21 Jan 2015 06:23:32 +0800</pubDate><description><![CDATA[leetcode原题地址：https://oj.leetcode.com/problems/search-insert-position/

       原题内容如下：
Given a sorted array and a target value, return the index if the target is found. If not, return the index wher]]></description><category></category></item><item><title><![CDATA[Binary Tree Postorder Traversal @leetcode]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42778287</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42778287</guid><author>samnancy</author><pubDate>Fri, 16 Jan 2015 15:54:46 +0800</pubDate><description><![CDATA[leetcode 原题地址：https://oj.leetcode.com/problems/binary-tree-postorder-traversal/


后序遍历思想：访问左孩子--》访问右孩子--》访问根节点
递归思想的完整代码如下：
package tree;

import java.util.ArrayList;

public class Postorder_trav]]></description><category></category></item><item><title><![CDATA[Binary Tree Preorder Traversal @leetcode]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42776819</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42776819</guid><author>samnancy</author><pubDate>Fri, 16 Jan 2015 14:34:10 +0800</pubDate><description><![CDATA[在二叉树方面停留了好长一段时间，各种资料:维基百科的定义、csdn的博客，java的api使用方法视频，最近突然发现我对数据结构的理解似乎开始有点质变的现象啦，开始能自己写出完整正确的代码啦，欣喜中，再接再厉，为自己加油！今天来贴一段二叉树递归实现先序遍历的完整代码。
      leetcode原题地址：https://oj.leetcode.com/problems/binary-tree-]]></description><category></category></item><item><title><![CDATA[Binary Tree Inorder Traversal @ LeetCode]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42677261</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42677261</guid><author>samnancy</author><pubDate>Tue, 13 Jan 2015 15:26:16 +0800</pubDate><description><![CDATA[看了好久的维基百科关于二叉树的解说、csdn相关博文的理解，及stone老师的帮忙下，终于写出能够打印出结果的完整程序啦。本文递归相关代码来自http://blog.youkuaiyun.com/linhuanmars/article/details/20187257 支持原创。其它部分是自己在stone老师的帮忙下理解后完整调试出的。


先贴leetcode的原题链接地址：https://oj.le]]></description><category></category></item><item><title><![CDATA[Java学习笔记之二叉树的节点数、深度]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42261587</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42261587</guid><author>samnancy</author><pubDate>Tue, 30 Dec 2014 09:06:30 +0800</pubDate><description><![CDATA[在上篇博文《Java学习笔记之创建二叉树》后，我们现在来求增加二叉树的节点数、二叉树的深度的函数，以下代码中黄色背景是增加实现的代码，由于注释较多，我用绿色字体将自己解读的注解区分。
老样子还是先注明这句话：【本文的代码请见原创http://blog.youkuaiyun.com/wuwenxiang91322/article/details/12231657】


我是结合他的代码一行行通过注释解读]]></description><category></category></item><item><title><![CDATA[java学习笔记之图的遍历（广度优先搜索BFS）]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42214719</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42214719</guid><author>samnancy</author><pubDate>Sun, 28 Dec 2014 16:11:00 +0800</pubDate><description><![CDATA[不知道有没小伙伴们跟我一样，在刚开始通过网络资源学习编程时，拿到大牛们的代码，总是希望拿到的是可以打印出结果的代码，但不解的是，大神似乎都不喜欢出示完整代码（这或许就是英雄所见略同吧）。我呢，是名编程菜鸟，最近想通过大牛们的经典算法代码重温算法和数据结构。本文代码是来自alibaba的Leo-Yang，网搜了一段时间的BFS\DFS算法理解，个人最喜欢他的图解解读，太赞啦！这是他的原文http:/]]></description><category></category></item><item><title><![CDATA[java学习笔记之创建二叉树]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/42214649</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/42214649</guid><author>samnancy</author><pubDate>Sun, 28 Dec 2014 16:05:38 +0800</pubDate><description><![CDATA[算法和数据结构底子薄弱，最近开始结合经典的算法题重新学习。本文的代码请见原创http://blog.youkuaiyun.com/wuwenxiang91322/article/details/12231657，我是结合他的代码一行行通过注释解读自己的理解，从中温习java的语法结构及数据结构、算法的思想。如有错误，望批评指正~

package tree;


import java.util.S]]></description><category></category></item><item><title><![CDATA[微信网页版如何给公众号发消息]]></title><link>https://blog.youkuaiyun.com/samnancy/article/details/41699377</link><guid>https://blog.youkuaiyun.com/samnancy/article/details/41699377</guid><author>samnancy</author><pubDate>Wed, 03 Dec 2014 17:01:19 +0800</pubDate><description><![CDATA[今天抱着侥幸心理想通过给一位名人的微信公众号发送自己的领英简历 Linkedin，让其在看完我的简历后能帮忙推荐下硅谷的工作机会。手机端微信给公众号发消息，容易，想必大家都知道：扫描公众号二维码后，进入公众号，直接发送消息即可。可是问题来了，手机端怎么将自己的领英简历一大串链接给发送出去呢？想到或许可以用为微信网页版，于是立马下载微信网页版，打开后发现微信网页版找不到公众号呀，怎么办？上网搜索，发]]></description><category></category></item></channel></rss>