<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[x]]></title><description><![CDATA[practise, practise and practise]]></description><link>https://blog.youkuaiyun.com/flyupliu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; flyupliu]]></copyright><item><title><![CDATA[k8s kubelet 主流程图解]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/78336438</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/78336438</guid><author>flyupliu</author><pubDate>Wed, 25 Oct 2017 00:29:16 +0800</pubDate><description><![CDATA[k8s 版本：1.3 
下图是以前看代码整理出来的。syncPod 本身也是非常复杂的逻辑，关于syncPod的上下游后续再补上。]]></description><category></category></item><item><title><![CDATA[pod中state与laststate及kubectl get pod中的status的关联]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/77923095</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/77923095</guid><author>flyupliu</author><pubDate>Sun, 10 Sep 2017 17:07:10 +0800</pubDate><description><![CDATA[描述在pod拉起容器失败时，查看pod的json信息中state与lastState关联，以及其与kubectl get pod中STATUS字段的关联。]]></description><category></category></item><item><title><![CDATA[mac osx上配置ctags]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/45542455</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/45542455</guid><author>flyupliu</author><pubDate>Wed, 06 May 2015 22:43:43 +0800</pubDate><description><![CDATA[先说下homebrew安装 ctags
1. http://brew.sh/index_zh-cn.html 中有说如何安装homebrew：


ruby -e "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/master/install)"
2. 

brew install vim
brew in]]></description><category></category></item><item><title><![CDATA[Leetcode_find-minimum-in-rotated-sorted-array-ii（c++ version）]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/40377767</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/40377767</guid><author>flyupliu</author><pubDate>Wed, 22 Oct 2014 16:05:15 +0800</pubDate><description><![CDATA[题目：https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/]]></description><category></category></item><item><title><![CDATA[Leetcode_find-minimum-in-rotated-array(c++ version)]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/40200329</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/40200329</guid><author>flyupliu</author><pubDate>Sat, 18 Oct 2014 00:59:33 +0800</pubDate><description><![CDATA[题目 https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/]]></description><category></category></item><item><title><![CDATA[Leetcode_Maximum Product Subarray(c++ version)]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/39648045</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/39648045</guid><author>flyupliu</author><pubDate>Sun, 28 Sep 2014 22:35:05 +0800</pubDate><description><![CDATA[地址：点击打开链接]]></description><category></category></item><item><title><![CDATA[What is the difference between new and malloc()?]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/39121669</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/39121669</guid><author>flyupliu</author><pubDate>Sun, 07 Sep 2014 19:47:51 +0800</pubDate><description><![CDATA[我记不得我曾多少次在网上搜索new 和 malloc 的区别，qian]]></description><category></category></item><item><title><![CDATA[win7 利用ovftool将.ova转化为.vmx]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/35245509</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/35245509</guid><author>flyupliu</author><pubDate>Fri, 27 Jun 2014 13:36:29 +0800</pubDate><description><![CDATA[1. 首先下载ovftool这个工具，windows版本
2..]]></description><category></category></item><item><title><![CDATA[Cracking the Coding Interview 智力题]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/30104053</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/30104053</guid><author>flyupliu</author><pubDate>Wed, 11 Jun 2014 20:50:41 +0800</pubDate><description><![CDATA[详情 http://kunth.github.io/BrainTeaser/]]></description><category></category></item><item><title><![CDATA[Leetcode 解题报告整理索引(更新至154题)]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26824167</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26824167</guid><author>flyupliu</author><pubDate>Sat, 24 May 2014 13:47:45 +0800</pubDate><description><![CDATA[Leetcode 解题报告整理索引

1.Two
 Sum, http://blog.youkuaiyun.com/flyupliu/article/details/22238237

2.Median of Two Sorted Arrays, http://blog.youkuaiyun.com/flyupliu/article/details/25335561

3.Longest
 Substring Without Repeating]]></description><category></category></item><item><title><![CDATA[Leetcode_scramble-string]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26818803</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26818803</guid><author>flyupliu</author><pubDate>Sat, 24 May 2014 11:48:52 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/scramble-string/]]></description><category></category></item><item><title><![CDATA[Leetcode_regular-expression-matching]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26738257</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26738257</guid><author>flyupliu</author><pubDate>Fri, 23 May 2014 19:34:11 +0800</pubDate><description><![CDATA[http://oj.leetcode.com/problems/regular-expression-matching/


Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the]]></description><category></category></item><item><title><![CDATA[Leetcode_word-ladder-ii]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26684851</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26684851</guid><author>flyupliu</author><pubDate>Fri, 23 May 2014 11:42:05 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/word-ladder-ii/]]></description><category></category></item><item><title><![CDATA[Leetcode_4sum]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26598475</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26598475</guid><author>flyupliu</author><pubDate>Thu, 22 May 2014 16:17:38 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/4sum/]]></description><category></category></item><item><title><![CDATA[Leetcode_integer-to-roman]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26515913</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26515913</guid><author>flyupliu</author><pubDate>Wed, 21 May 2014 23:04:29 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/integer-to-roman/


Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.
思路：]]></description><category></category></item><item><title><![CDATA[Leetcode_roman-to-integer]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26491943</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26491943</guid><author>flyupliu</author><pubDate>Wed, 21 May 2014 21:20:22 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/roman-to-integer/


Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.]]></description><category></category></item><item><title><![CDATA[Leetcode_surrounded-regions]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26470243</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26470243</guid><author>flyupliu</author><pubDate>Wed, 21 May 2014 14:18:24 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/surrounded-regions/]]></description><category></category></item><item><title><![CDATA[Leetcode_palindrome-partitioning-ii]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26465569</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26465569</guid><author>flyupliu</author><pubDate>Wed, 21 May 2014 13:35:56 +0800</pubDate><description><![CDATA[地址：https://oj.leetcode.com/problems/palindrome-partitioning-ii/]]></description><category></category></item><item><title><![CDATA[Leetcode_minimum-window-substring(c++ version)]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26348829</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26348829</guid><author>flyupliu</author><pubDate>Tue, 20 May 2014 11:03:02 +0800</pubDate><description><![CDATA[地址：http://oj.leetcode.com/problems/minimum-window-substring/]]></description><category></category></item><item><title><![CDATA[Leetcode_sort-list(c++ version)]]></title><link>https://blog.youkuaiyun.com/flyupliu/article/details/26235975</link><guid>https://blog.youkuaiyun.com/flyupliu/article/details/26235975</guid><author>flyupliu</author><pubDate>Mon, 19 May 2014 12:57:26 +0800</pubDate><description><![CDATA[地址：http://oj.leetcode.com/problems/sort-list/]]></description><category></category></item></channel></rss>