<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[AllZone]]></title><description><![CDATA[Work It Harder Make It Better Do It Faster Makes Us Stronger ]]></description><link>https://blog.youkuaiyun.com/allenzyoung</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; allenzyoung]]></copyright><item><title><![CDATA[[LeetCode] Find Minimum in Rotated Sorted Array 题解]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/51124163</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/51124163</guid><author>allenzyoung</author><pubDate>Thu, 28 Apr 2016 20:58:19 +0800</pubDate><description><![CDATA[前言Find Minimum in Rotated Sorted Array这道题存在的价值，大概就是让大家直观感受一下LeetCode上二分的题目真的很多。。。题目https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ 
Suppose a sorted array is rotated at some pivot u]]></description><category></category></item><item><title><![CDATA[Android的基本世界观——系统简介，组件逻辑及其他]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/51020450</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/51020450</guid><author>allenzyoung</author><pubDate>Thu, 31 Mar 2016 22:34:46 +0800</pubDate><description><![CDATA[作为一个有半年余Android Developing折腾经验的Android Developer（为什么不说“开发经验”呢？因为我仔细想了想，我还没有独立地做出一个完善美观且有使用价值的应用。），要系统地学习安卓平台的基本开发技能，那么第一步，了解并熟识Android的基本世界观，应该就是十分必要的了。以前这方面的知识体系不成系统，比较破碎零散，故借此文稍作整理。]]></description><category></category></item><item><title><![CDATA[如何求二进制表示中“1”的个数]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50939705</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50939705</guid><author>allenzyoung</author><pubDate>Mon, 21 Mar 2016 18:46:21 +0800</pubDate><description><![CDATA[刚翻开《编程之美》， 中间就有一道我很眼熟的题，“求二进制中1的个数”。书中的题目描述如下：]]></description><category></category></item><item><title><![CDATA[[LeetCode] Insertion Sort List]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50932524</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50932524</guid><author>allenzyoung</author><pubDate>Sat, 19 Mar 2016 21:30:02 +0800</pubDate><description><![CDATA[前言Insertion Sort List算是Linked List tag下的一道中等难度的题吧，可以用来复习链表的选择排序操作。解法很固定，没什么讨论的余地。题目https://leetcode.com/problems/insertion-sort-list/ 
Sort a linked list using insertion sort. 
排序一个链表，指定必须采用插入排序算法。分析插入]]></description><category></category></item><item><title><![CDATA[[LeetCode] Intersection of Two Linked Lists 题解]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50926964</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50926964</guid><author>allenzyoung</author><pubDate>Sat, 19 Mar 2016 11:00:27 +0800</pubDate><description><![CDATA[Intersection of Two Linked Lists也是LeetCode的Linked List Tag下的一道题，网上流传着多种做法。]]></description><category></category></item><item><title><![CDATA[[LeetCode] Valid Anagram 题解]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50921178</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50921178</guid><author>allenzyoung</author><pubDate>Fri, 18 Mar 2016 10:53:55 +0800</pubDate><description><![CDATA[前言题目https://leetcode.com/problems/valid-anagram/Given two strings s and t, write a function to determine if t is an anagram of s. 
For example, 
s = “anagram”, t = “nagaram”, return true. 
s = “rat”, t]]></description><category></category></item><item><title><![CDATA[[LeetCode] Missing Number]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50901884</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50901884</guid><author>allenzyoung</author><pubDate>Thu, 17 Mar 2016 20:57:53 +0800</pubDate><description><![CDATA[前言Missing Number是一道和Single Number很像的题（无论是从名字还是解法的角度而言），具体思路并不难，做法倒是不少。题目https://leetcode.com/problems/missing-number/ 
Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the on]]></description><category></category></item><item><title><![CDATA[[LeetCode] Single Number & Single Number III]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50881155</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50881155</guid><author>allenzyoung</author><pubDate>Wed, 16 Mar 2016 08:06:46 +0800</pubDate><description><![CDATA[Single Number三步曲是LeetCode诸多系列题中流传最广的一个（也许没有之一？），这里放在一起讨论一下。由于Single Number II稍微难一些，所以这篇文章先讨论I和III。]]></description><category></category></item><item><title><![CDATA[[LeetCode] Validate Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50849951</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50849951</guid><author>allenzyoung</author><pubDate>Thu, 10 Mar 2016 21:43:48 +0800</pubDate><description><![CDATA[前言根据网上的LeetCode题目难度和出现频率表（里面都是最老的那些题目），Validate Binary Search Tree算是很重要的一道题了。 在Tree系列中也是举足轻重的一道题。题目https://leetcode.com/problems/validate-binary-search-tree/ 
Given a binary tree, determine if it is a]]></description><category></category></item><item><title><![CDATA[[LeetCode] Set Matrix Zeroes]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50838381</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50838381</guid><author>allenzyoung</author><pubDate>Wed, 09 Mar 2016 20:47:50 +0800</pubDate><description><![CDATA[前言Set Matrix Zeroes，一道LeetCode中十分经典的数组题，据说在笔试中出现频率不低。不过此题本质不难，要做到不适用额外空间就稍微要多想一下了。题目https://leetcode.com/problems/set-matrix-zeroes/ 
Given a m x n matrix, if an element is 0, set its entire row and co]]></description><category></category></item><item><title><![CDATA[[LeetCode] 3Sum分析与C/C++解法]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50828375</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50828375</guid><author>allenzyoung</author><pubDate>Tue, 08 Mar 2016 21:23:37 +0800</pubDate><description><![CDATA[前言3Sum算是LeetCode最经典的十几道题之一了，据说在面试中出现的频率相当高。所以在这里花点篇幅讨论一下此题。题目https://leetcode.com/problems/3sum/ 
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all uniqu]]></description><category></category></item><item><title><![CDATA[[LeetCode] Plus One 简要分析]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50823315</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50823315</guid><author>allenzyoung</author><pubDate>Tue, 08 Mar 2016 13:09:06 +0800</pubDate><description><![CDATA[前言Plus one是一道数组相关的题，其实就是高精度加法。题目https://leetcode.com/problems/plus-one/ 
Given a non-negative number represented as an array of digits, plus one to the number. 
The digits are stored such that the most]]></description><category></category></item><item><title><![CDATA[[LeetCode] Linked List Cycle 与 Linked List Cycle II]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50816899</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50816899</guid><author>allenzyoung</author><pubDate>Mon, 07 Mar 2016 14:37:13 +0800</pubDate><description><![CDATA[前言Linked List Cycle 与 Linked List Cycle II是LeetCode链表系列很经典的两道题，值得研究一下。题目https://leetcode.com/problems/linked-list-cycle/ 
https://leetcode.com/problems/linked-list-cycle-ii/Linked List CycleGiven a lin]]></description><category></category></item><item><title><![CDATA[[LeetCode] Bulb Switcher]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50812196</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50812196</guid><author>allenzyoung</author><pubDate>Sun, 06 Mar 2016 10:39:04 +0800</pubDate><description><![CDATA[前言Bulb Switcher是LeetCode上的一道”脑筋急转弯”类题目，颇有趣味性。难度并不大，实际上想通数学规律后，此题只需要一行代码。题目https://leetcode.com/problems/bulb-switcher/ 
There are n bulbs that are initially off. You first turn on all the bulbs. Then,]]></description><category></category></item><item><title><![CDATA[[LeetCode] Binary Tree Traversal 系列]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50801077</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50801077</guid><author>allenzyoung</author><pubDate>Fri, 04 Mar 2016 12:28:35 +0800</pubDate><description><![CDATA[前言LeetCode有三道考察二叉树遍历的基础题，即Binary Tree XXXOrder Traversal 系列，分别为Preorder，inorder，以及postorder。 
先序，中序，后序遍历都比较简单，下面讨论递归方法。题目https://leetcode.com/problems/binary-tree-preorder-traversal/ 
https://leetcode.]]></description><category></category></item><item><title><![CDATA[[LeetCode] House Robber 题解]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50788300</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50788300</guid><author>allenzyoung</author><pubDate>Thu, 03 Mar 2016 14:57:06 +0800</pubDate><description><![CDATA[前言House Robber算是LeetCode动态规划tag下的入门题，相当简单。题目题目链接：https://leetcode.com/problems/house-robber/ 
You are a professional robber planning to rob houses along a street. Each house has a certain amount of mon]]></description><category></category></item><item><title><![CDATA[Android Studio的Git与Github配置]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50786118</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50786118</guid><author>allenzyoung</author><pubDate>Thu, 03 Mar 2016 10:11:08 +0800</pubDate><description><![CDATA[前言Android Studio是当前最为流行的安卓开发工具（等到彻底取代Eclipse之后这一点就更毋庸置疑了），而Git是世界上最popular的分布式版本管理系统，至于Github，则是目前最受欢迎的开源社区。三者配合使用将大大提高开发生产力。安装想要在AS中使用Git工具，首先需要保证你的PC端已经安装了Git（想要了解Git使用，这里有一个不错的Git入门“游戏”）。我的Git是下载Git]]></description><category></category></item><item><title><![CDATA[[LeetCode] Unique Paths 题解]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50781738</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50781738</guid><author>allenzyoung</author><pubDate>Wed, 02 Mar 2016 18:03:15 +0800</pubDate><description><![CDATA[前言Unique Paths应该说是LeetCode动态规划系列中很亲民的一道题了（AC率比较高）。实际上，Dynamic Programming的题目一般关键都在于想出递推关系，成功写出准确的循环解法。题目题目链接：https://leetcode.com/problems/unique-paths/ 
A robot is located at the top-left corner of a]]></description><category></category></item><item><title><![CDATA[[LeetCode] Balanced Binary Tree 题解]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50777204</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50777204</guid><author>allenzyoung</author><pubDate>Wed, 02 Mar 2016 08:56:00 +0800</pubDate><description><![CDATA[前言LeetCode blabla Tree系列稍微不太水的一道题，很有使用价值（可以牵扯到AVL树的概念什么的）。递归仍然是不二选择。题目https://leetcode.com/problems/balanced-binary-tree/ 
Given a binary tree, determine if it is height-balanced. 
For this problem, a]]></description><category></category></item><item><title><![CDATA[[LeetCode] Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/allenzyoung/article/details/50775840</link><guid>https://blog.youkuaiyun.com/allenzyoung/article/details/50775840</guid><author>allenzyoung</author><pubDate>Tue, 01 Mar 2016 21:33:35 +0800</pubDate><description><![CDATA[前言LeetCode 的blabla Tree系列又一基础题，可配合 Minimum Depth of Binary Tree 一起练习。题解在此。题目https://leetcode.com/problems/maximum-depth-of-binary-tree/ 
Given a binary tree, find its maximum depth. 
The maximum depth]]></description><category></category></item></channel></rss>