<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>小花园</title><link>https://timkingnf.github.io/blog/</link><description></description><lastBuildDate>Fri, 20 Jul 2018 00:00:00 +0800</lastBuildDate><item><title>有效的字母异位词</title><link>https://timkingnf.github.io/blog/valid-anagram.html</link><description>&lt;p&gt;LeetCode 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Fri, 20 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-20:/blog/valid-anagram.html</guid><category>算法</category><category>字符串</category><category>c++</category></item><item><title>【译】异步计算：Web服务器+ Dask</title><link>https://timkingnf.github.io/blog/Asynchronous%20Computation:%20Web%20Servers%20+%20Dask.html</link><description>&lt;p&gt;翻译，笔记&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Thu, 19 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-19:/blog/Asynchronous Computation: Web Servers + Dask.html</guid><category>dask</category><category>tornado</category><category>async</category><category>翻译</category></item><item><title>约瑟夫斯问题</title><link>https://timkingnf.github.io/blog/josephus-problem.html</link><description>&lt;p&gt;面试中遇到的题目&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Wed, 11 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-11:/blog/josephus-problem.html</guid><category>算法</category></item><item><title>小写字符排列组合</title><link>https://timkingnf.github.io/blog/string-ascii-lowercase-arrange.html</link><description>&lt;p&gt;面试中遇到的题目&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Tue, 10 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-10:/blog/string-ascii-lowercase-arrange.html</guid><category>算法</category></item><item><title>字符串中的第一个唯一字符</title><link>https://timkingnf.github.io/blog/first-unique-character-in-a-string.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Mon, 09 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-09:/blog/first-unique-character-in-a-string.html</guid><category>字符串</category><category>算法</category></item><item><title>反转整数</title><link>https://timkingnf.github.io/blog/reverse-integer.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 08 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-08:/blog/reverse-integer.html</guid><category>字符串</category><category>算法</category></item><item><title>旋转图像</title><link>https://timkingnf.github.io/blog/rotate-image.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 08 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-08:/blog/rotate-image.html</guid><category>数组</category><category>算法</category></item><item><title>罗马数字转整数</title><link>https://timkingnf.github.io/blog/roman-to-integer.html</link><description>&lt;p&gt;LeetCode - 数学 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Wed, 04 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-04:/blog/roman-to-integer.html</guid><category>算法</category></item><item><title>有效的数独</title><link>https://timkingnf.github.io/blog/valid-sudoku.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 01 Jul 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-07-01:/blog/valid-sudoku.html</guid><category>数组</category><category>算法</category></item><item><title>两数之和</title><link>https://timkingnf.github.io/blog/two-sum.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sat, 30 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-30:/blog/two-sum.html</guid><category>数组</category><category>算法</category></item><item><title>移动零</title><link>https://timkingnf.github.io/blog/move-zeroes.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Thu, 28 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-28:/blog/move-zeroes.html</guid><category>数组</category><category>算法</category></item><item><title>加一</title><link>https://timkingnf.github.io/blog/plus-one.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Thu, 28 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-28:/blog/plus-one.html</guid><category>数组</category><category>算法</category></item><item><title>两个数组的交集 II</title><link>https://timkingnf.github.io/blog/intersection-of-two-arrays-ii.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Tue, 26 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-26:/blog/intersection-of-two-arrays-ii.html</guid><category>数组</category><category>算法</category></item><item><title>存在重复元素</title><link>https://timkingnf.github.io/blog/contains-duplicate.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Mon, 25 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-25:/blog/contains-duplicate.html</guid><category>数组</category><category>算法</category></item><item><title>只出现一次的数字</title><link>https://timkingnf.github.io/blog/single-number.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Mon, 25 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-25:/blog/single-number.html</guid><category>数组</category><category>算法</category></item><item><title>旋转数组</title><link>https://timkingnf.github.io/blog/rotate-array.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 24 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-24:/blog/rotate-array.html</guid><category>数组</category><category>算法</category></item><item><title>买卖股票的最佳时机 II</title><link>https://timkingnf.github.io/blog/best-time-to-buy-and-sell-stock-ii.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Fri, 22 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-22:/blog/best-time-to-buy-and-sell-stock-ii.html</guid><category>数组</category><category>算法</category></item><item><title>Mysql Online DDL 和碎片整理</title><link>https://timkingnf.github.io/blog/mysql-online-ddl-and-optimize.html</link><description>&lt;p&gt;记录一下工作上对于大表的 alter 操作和整理数据库碎片的问题。&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Thu, 21 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-21:/blog/mysql-online-ddl-and-optimize.html</guid><category>数据库</category></item><item><title>删除排序数组中的重复项</title><link>https://timkingnf.github.io/blog/remove-duplicates-from-sorted-array.html</link><description>&lt;p&gt;LeetCode - 探索 - 初级算法&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Wed, 20 Jun 2018 00:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-20:/blog/remove-duplicates-from-sorted-array.html</guid><category>数组</category><category>算法</category></item><item><title>高性能python-选择合适的数据结构</title><link>https://timkingnf.github.io/blog/high_performance_python_section2.html</link><description>&lt;p&gt;对 &amp;laquo;Python高性能分析&amp;raquo; 的第三、四章的学习笔记, 介绍了python中的一些数据结构，并简单介绍了这些数据结果在使用中容易造成性能瓶颈的地方，了解其本身的机制，才能更好的实现性能上的优化。&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sat, 16 Jun 2018 12:56:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-16:/blog/high_performance_python_section2.html</guid><category>数据结构</category></item><item><title>高性能python-性能分析</title><link>https://timkingnf.github.io/blog/high_performance_python_section1.html</link><description>&lt;p&gt;对 &amp;laquo;Python高性能分析&amp;raquo; 的第二章的学习笔记, 简要描述了一些python中的性能分析手段。&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 10 Jun 2018 11:55:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-06-10:/blog/high_performance_python_section1.html</guid><category>性能分析</category></item><item><title>Jupyter Notebook Learning</title><link>https://timkingnf.github.io/blog/jupyter_describe.html</link><description>&lt;p&gt;Jupyter简要笔记&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 27 May 2018 16:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-05-27:/blog/jupyter_describe.html</guid><category>ipython</category><category>数据处理</category><category>plotly</category><category>ipywidgets</category></item><item><title>微信聊天记录的数据分析</title><link>https://timkingnf.github.io/blog/wechat_analyze.html</link><description>&lt;p&gt;简单的展示了一个分析微信聊天记录的流程&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">timking</dc:creator><pubDate>Sun, 27 May 2018 16:00:00 +0800</pubDate><guid isPermaLink="false">tag:timkingnf.github.io,2018-05-27:/blog/wechat_analyze.html</guid></item></channel></rss>