<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[欢迎来到饭没了吃的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u014734779</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u014734779]]></copyright><item><title><![CDATA[Max Points on a Line]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488789</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488789</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:20:59 +0800</pubDate><description><![CDATA[Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.]]></description><category></category></item><item><title><![CDATA[Text Justification]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488787</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488787</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:20:35 +0800</pubDate><description><![CDATA[Given an array of words and a length L, format the text such that each line has exactly L characters and 
is fully (left and right) justified. 
You should pack your words in a greedy approach; that is,]]></description><category></category></item><item><title><![CDATA[Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488785</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488785</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:20:03 +0800</pubDate><description><![CDATA[Divide two integers without using multiplication, division and mod operator.]]></description><category></category></item><item><title><![CDATA[ZigZag Conversion]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488781</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488781</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:19:41 +0800</pubDate><description><![CDATA[The string ”PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you 
may want to display this pattern in a fixed font for better legibility) 
P A H N 
A P L S I I G 
Y]]></description><category></category></item><item><title><![CDATA[Spiral Matrix II]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488775</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488775</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:19:14 +0800</pubDate><description><![CDATA[Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. 
For example, Given n = 3, 
You should return the following matrix: 
[ 
[ 1, 2, 3 ], 
[ 8, 9, 4 ], 
[ 7,]]></description><category></category></item><item><title><![CDATA[Spiral Matrix]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488773</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488773</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:18:41 +0800</pubDate><description><![CDATA[Given a matrix of m×n elements (m rows, n columns), return all elements of the matrix in spiral order. 
For example, Given the following matrix: 
[ 
[ 1, 2, 3 ], 
[ 4, 5, 6 ], 
[ 7, 8, 9 ] 
] 
You shou]]></description><category></category></item><item><title><![CDATA[Pascal’s Triangle II]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48488765</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48488765</guid><author>u014734779</author><pubDate>Wed, 16 Sep 2015 08:17:58 +0800</pubDate><description><![CDATA[Given an index k, return the kth row of the Pascal’s triangle. 
For example, given k = 3, 
Return [1,3,3,1]. 
Note: Could you optimize your algorithm to use only O(k) extra space?]]></description><category></category></item><item><title><![CDATA[Pascal’s Triangle]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463179</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463179</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:25:50 +0800</pubDate><description><![CDATA[Given numRows, generate the first numRows of Pascal’s triangle. 
For example, given numRows = 5, 
Return 
[ 
[1], 
[1,1], 
[1,2,1], 
[1,3,3,1], 
[1,4,6,4,1] 
]]]></description><category></category></item><item><title><![CDATA[Substring with Concatenation of All Words]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463173</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463173</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:25:28 +0800</pubDate><description><![CDATA[You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of 
substring(s) in S that is a concatenation of each word in L exactly once and without an]]></description><category></category></item><item><title><![CDATA[Multiply Strings]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463163</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463163</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:25:05 +0800</pubDate><description><![CDATA[Given two numbers represented as strings, return multiplication of the numbers as a string. 
Note: The numbers can be arbitrarily large and are non-negative.]]></description><category></category></item><item><title><![CDATA[Minimum Window Substring]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463151</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463151</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:24:43 +0800</pubDate><description><![CDATA[Given a string S and a string T , find the minimum window in S which will contain all the characters in 
T in complexity O(n). 
For example, S = ”ADOBECODEBANC”, T = ”ABC” 
Minimum window is ”BANC”. 
N]]></description><category></category></item><item><title><![CDATA[Merge Intervals]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463147</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463147</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:24:20 +0800</pubDate><description><![CDATA[Given a collection of intervals, merge all overlapping intervals. 
For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]]]></description><category></category></item><item><title><![CDATA[Insert Interval]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463133</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463133</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:23:56 +0800</pubDate><description><![CDATA[Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). 
You may assume that the intervals were initially sorted according to their start times. 
Exampl]]></description><category></category></item><item><title><![CDATA[Palindrome Number]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463121</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463121</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:23:38 +0800</pubDate><description><![CDATA[Determine whether an integer is a palindrome. Do this without extra space. 
Some hints: 
Could negative integers be palindromes? (ie, -1) 
If you are thinking of converting the integer to string, note]]></description><category></category></item><item><title><![CDATA[Reverse Integer]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463113</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463113</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:23:16 +0800</pubDate><description><![CDATA[Reverse digits of an integer. 
Example1: x = 123, return 321 
Example2: x = -123, return -321 
Have you thought about this? 
Here are some good questions to ask before coding. Bonus points for you if y]]></description><category></category></item><item><title><![CDATA[Clone Graph]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463107</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463107</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:22:54 +0800</pubDate><description><![CDATA[Clone an undirected graph. Each node in the graph contains a label and a list of its neighbours. 
OJ’s undirected graph serialization: Nodes are labeled uniquely. 
We use # as a separator for each node]]></description><category></category></item><item><title><![CDATA[Word Break II]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463093</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463093</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:21:51 +0800</pubDate><description><![CDATA[Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word 
is a valid dictionary word. 
Return all such possible sentences. 
For example, given 
s = “cats]]></description><category></category></item><item><title><![CDATA[Word Break]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463087</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463087</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:21:31 +0800</pubDate><description><![CDATA[Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated 
sequence of one or more dictionary words. 
For example, given 
s = “leetcode”, 
dict = [“leet”,]]></description><category></category></item><item><title><![CDATA[Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463081</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463081</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:21:10 +0800</pubDate><description><![CDATA[Given a string S and a string T , count the number of distinct subsequences of T in S. 
A subsequence of a string is a new string which is formed from the original string by deleting some (can 
be none]]></description><category></category></item><item><title><![CDATA[Decode Ways]]></title><link>https://blog.youkuaiyun.com/u014734779/article/details/48463075</link><guid>https://blog.youkuaiyun.com/u014734779/article/details/48463075</guid><author>u014734779</author><pubDate>Tue, 15 Sep 2015 09:20:37 +0800</pubDate><description><![CDATA[A message containing letters from A-Z is being encoded to numbers using the following mapping: 
‘A’ -> 1 
‘B’ -> 2 
… 
‘Z’ -> 26 
Given an encoded message containing digits, determine the total number]]></description><category></category></item></channel></rss>