<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[leetcode_record的博客]]></title><description><![CDATA[coding]]></description><link>https://blog.youkuaiyun.com/leetcode_record</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; leetcode_record]]></copyright><item><title><![CDATA[[Leetcode 5] Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/leetcode_record/article/details/101291400</link><guid>https://blog.youkuaiyun.com/leetcode_record/article/details/101291400</guid><author>leetcode_record</author><pubDate>Tue, 24 Sep 2019 16:19:50 +0800</pubDate><description><![CDATA[[Leetcode 5] Longest Palindromic Substring
1. Description : Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
2. 题意：找出最长回文子串
思路一:取可能的中...]]></description><category></category></item><item><title><![CDATA[[leetcode 198] House Robber]]></title><link>https://blog.youkuaiyun.com/leetcode_record/article/details/79830256</link><guid>https://blog.youkuaiyun.com/leetcode_record/article/details/79830256</guid><author>leetcode_record</author><pubDate>Fri, 06 Apr 2018 03:00:49 +0800</pubDate><description><![CDATA[You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house...]]></description><category></category></item><item><title><![CDATA[[leetcode 91] Decode Ways]]></title><link>https://blog.youkuaiyun.com/leetcode_record/article/details/79829824</link><guid>https://blog.youkuaiyun.com/leetcode_record/article/details/79829824</guid><author>leetcode_record</author><pubDate>Thu, 05 Apr 2018 22:13:32 +0800</pubDate><description><![CDATA[A message containing letters from A-Z is being encoded to numbers using the following mapping:

'A' -&amp;gt; 1
'B' -&amp;gt; 2
...
'Z' -&amp;gt; 26

Given an encoded message containing digits, determine the tota...]]></description><category></category></item><item><title><![CDATA[[Leetcode 120] Triangle]]></title><link>https://blog.youkuaiyun.com/leetcode_record/article/details/79765141</link><guid>https://blog.youkuaiyun.com/leetcode_record/article/details/79765141</guid><author>leetcode_record</author><pubDate>Sat, 31 Mar 2018 01:37:48 +0800</pubDate><description><![CDATA[[Leetcode 120] Triangle

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle



[
  ...]]></description><category></category></item><item><title><![CDATA[[Leetcode 279] Perfect Squares]]></title><link>https://blog.youkuaiyun.com/leetcode_record/article/details/79765070</link><guid>https://blog.youkuaiyun.com/leetcode_record/article/details/79765070</guid><author>leetcode_record</author><pubDate>Sat, 31 Mar 2018 01:03:21 +0800</pubDate><description><![CDATA[[Leetcode 279] Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.

For example, given n = 12, return 3 because...]]></description><category></category></item></channel></rss>