<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[aaasy的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/aaasy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; aaasy]]></copyright><item><title><![CDATA[leetcode-Pascal's Triangle（I、II）]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51593013</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51593013</guid><author>aaasy</author><pubDate>Mon, 06 Jun 2016 08:10:23 +0800</pubDate><description><![CDATA[Problems： 
（1）Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5Return： 
    [ 
         [1], 
        [1,1], 
       [1,2,1], 
      [1,3,3,1], 
     [1,4,6,]]></description><category></category></item><item><title><![CDATA[leetcode - climb steps]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51475227</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51475227</guid><author>aaasy</author><pubDate>Sun, 22 May 2016 15:16:16 +0800</pubDate><description><![CDATA[Question:You are climbing a stair case. It takes n steps to reach to the top. 
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?]]></description><category></category></item><item><title><![CDATA[leetcode - Majority Element]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51326662</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51326662</guid><author>aaasy</author><pubDate>Thu, 05 May 2016 21:54:12 +0800</pubDate><description><![CDATA[Problem: 
(1)Majority Element  
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty]]></description><category></category></item><item><title><![CDATA[leetcode- Number of 1 bits, power of two, power of three]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51228652</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51228652</guid><author>aaasy</author><pubDate>Sat, 23 Apr 2016 22:13:10 +0800</pubDate><description><![CDATA[leetcode- Number of 1 bits, power of two, power of three]]></description><category></category></item><item><title><![CDATA[leetcode - ugly number, ugly number2, super ugly number]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51212595</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51212595</guid><author>aaasy</author><pubDate>Thu, 21 Apr 2016 20:15:06 +0800</pubDate><description><![CDATA[ugly number的题目]]></description><category></category></item><item><title><![CDATA[leetcode - Contains Duplicate]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51155403</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51155403</guid><author>aaasy</author><pubDate>Thu, 14 Apr 2016 21:50:45 +0800</pubDate><description><![CDATA[Problem: 
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every e]]></description><category></category></item><item><title><![CDATA[leetcode -  roman to integer & integer to roman]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51141073</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51141073</guid><author>aaasy</author><pubDate>Wed, 13 Apr 2016 10:30:06 +0800</pubDate><description><![CDATA[leetcode -  roman to integer & integer to roman]]></description><category></category></item><item><title><![CDATA[leetcode- Delete Node in a Linked List&Remove Linked List Elements]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51106151</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51106151</guid><author>aaasy</author><pubDate>Sat, 09 Apr 2016 17:05:01 +0800</pubDate><description><![CDATA[Problem: 
Delete Note in a LinkedList & Remove LinkedList Elements]]></description><category></category></item><item><title><![CDATA[leetcode - Valid Anagram]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51039871</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51039871</guid><author>aaasy</author><pubDate>Fri, 01 Apr 2016 22:30:07 +0800</pubDate><description><![CDATA[今天心情好，多刷一题，大家不要嫌弃我


Question：


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 = "ca]]></description><category></category></item><item><title><![CDATA[leetcode-Excel Sheet Column Title]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/51039641</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/51039641</guid><author>aaasy</author><pubDate>Fri, 01 Apr 2016 21:35:41 +0800</pubDate><description><![CDATA[说好的每天一刷，果然做不到，拖延症+懒癌晚期。好吧，趁着有时间赶快刷一题。




Problem：

Given a positive integer, return its corresponding column title as appear in an Excel sheet.

For example:


  1 -> A
    2 -> B
    3 -]]></description><category></category></item><item><title><![CDATA[Leetcode-Move Zeroes]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/50992581</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/50992581</guid><author>aaasy</author><pubDate>Sun, 27 Mar 2016 17:03:38 +0800</pubDate><description><![CDATA[每天再忙还是要坚持刷题的，虽然只刷1-2道题，但是坚持下去就会有效果！【我真的不是在用心灵鸡汤在为自己刷的少找借口吗？】




Question：

Given an array nums, write a function to move all 0's
 to the end of it while maintaining the relative order of the ]]></description><category></category></item><item><title><![CDATA[Leetcode-Add Digits]]></title><link>https://blog.youkuaiyun.com/aaasy/article/details/50987179</link><guid>https://blog.youkuaiyun.com/aaasy/article/details/50987179</guid><author>aaasy</author><pubDate>Sat, 26 Mar 2016 15:41:52 +0800</pubDate><description><![CDATA[本人正在努力加入浩浩荡荡的程序员组织，目前定位在数据挖掘与自然语言处理两块。但是无论如何，得先从leetcode做起。所以做过的题目，有空就往博客上丢，希望与大家一
同进步！


Problem:
Given a non-negative integer num, repeatedly add all its digits until the result has only one di]]></description><category></category></item></channel></rss>