<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Peng_maple的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Peng_maple</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Peng_maple]]></copyright><item><title><![CDATA[[leetcode] 152. Maximum Product Subarray]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/100074985</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/100074985</guid><author>Peng_maple</author><pubDate>Mon, 26 Aug 2019 15:44:09 +0800</pubDate><description><![CDATA[Maximum Product Subarray
Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.
Example 1:

Input: [2,3,-2,4]
Output:...]]></description><category></category></item><item><title><![CDATA[[leetcode] 149. Max Points on a Line]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/100057542</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/100057542</guid><author>Peng_maple</author><pubDate>Sat, 24 Aug 2019 21:36:53 +0800</pubDate><description><![CDATA[Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
Example 1:

Input: [[1,1],[2,2],[3,3]]
Output: 3
Explanation:
^
|
|        o
| ...]]></description><category></category></item><item><title><![CDATA[[leetcode] 139. Word Break]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99689906</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99689906</guid><author>Peng_maple</author><pubDate>Sat, 17 Aug 2019 11:25:40 +0800</pubDate><description><![CDATA[Word Break
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
N...]]></description><category></category></item><item><title><![CDATA[[leetcode] 135. Candy]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99685851</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99685851</guid><author>Peng_maple</author><pubDate>Fri, 16 Aug 2019 21:40:49 +0800</pubDate><description><![CDATA[Candy
There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following requirements:
Each child must have at least on...]]></description><category></category></item><item><title><![CDATA[[leetcode] 132.Palindrome Partitioning II]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99681778</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99681778</guid><author>Peng_maple</author><pubDate>Fri, 16 Aug 2019 19:22:14 +0800</pubDate><description><![CDATA[Palindrome Partitioning II
Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s.
Example:

Input:...]]></description><category></category></item><item><title><![CDATA[[leetcode] 131. Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99681261</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99681261</guid><author>Peng_maple</author><pubDate>Fri, 16 Aug 2019 16:48:42 +0800</pubDate><description><![CDATA[Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.
Return all possible palindrome partitioning of s.
Example:

Input: “aab”
Output:
[
[“a...]]></description><category></category></item><item><title><![CDATA[[leetcode] 130. Surrounded Regions]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99678598</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99678598</guid><author>Peng_maple</author><pubDate>Fri, 16 Aug 2019 15:30:42 +0800</pubDate><description><![CDATA[Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.
A region is captured by flipping all 'O’s into 'X’s in that surrounded region.
Example...]]></description><category></category></item><item><title><![CDATA[[leetcode] 127. Word Ladder]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99613436</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99613436</guid><author>Peng_maple</author><pubDate>Wed, 14 Aug 2019 22:19:40 +0800</pubDate><description><![CDATA[Word Ladder
Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:
Only one letter can be chan...]]></description><category></category></item><item><title><![CDATA[[leetcode] 128. Longest Consecutive Sequence]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99344273</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99344273</guid><author>Peng_maple</author><pubDate>Mon, 12 Aug 2019 21:56:05 +0800</pubDate><description><![CDATA[Longest Consecutive Sequence
Given an unsorted array of integers, find the lengt

h of the longest consecutive elements sequence.
Your algorithm should run in O(n) complexity.
Example:

Input: [100, 4...]]></description><category></category></item><item><title><![CDATA[[leetcode] 115. Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/99054810</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/99054810</guid><author>Peng_maple</author><pubDate>Sat, 10 Aug 2019 10:09:09 +0800</pubDate><description><![CDATA[Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of S which equals T.
A subsequence of a string is a new string which is formed from the original string...]]></description><category></category></item><item><title><![CDATA[[leetcode] 97. Interleaving String]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/97955645</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/97955645</guid><author>Peng_maple</author><pubDate>Thu, 01 Aug 2019 20:02:54 +0800</pubDate><description><![CDATA[Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
Example 1:

Input: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac”
Output: true

Example 2:

Input: s1 =...]]></description><category></category></item><item><title><![CDATA[[leetcode] 87. Scramble String]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/97615917</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/97615917</guid><author>Peng_maple</author><pubDate>Wed, 31 Jul 2019 19:03:07 +0800</pubDate><description><![CDATA[Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 = “great”:

Given two str...]]></description><category></category></item><item><title><![CDATA[[leetcode] 221. Maximal Square && 85. Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/97612197</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/97612197</guid><author>Peng_maple</author><pubDate>Sun, 28 Jul 2019 13:18:36 +0800</pubDate><description><![CDATA[Maximal Square
Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.
Example:

Input:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Output: 4

解法...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 78. Subsets && 90. Subsets II]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/97409057</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/97409057</guid><author>Peng_maple</author><pubDate>Fri, 26 Jul 2019 20:17:42 +0800</pubDate><description><![CDATA[Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:

Input: nums = [1,2,3]
Output:
[
[3],
[...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 93. Restore IP Addresses]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/97296180</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/97296180</guid><author>Peng_maple</author><pubDate>Thu, 25 Jul 2019 20:28:53 +0800</pubDate><description><![CDATA[Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.
Example:

Input: “25525511135”
Output: [“255.255.11.135”, “255.255.111.3...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 84. Largest Rectangle in Histogram]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/97002927</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/97002927</guid><author>Peng_maple</author><pubDate>Tue, 23 Jul 2019 16:34:35 +0800</pubDate><description><![CDATA[Largest Rectangle in Histogram
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

Example:

I...]]></description><category></category></item><item><title><![CDATA[[leetcode] 76. Minimum Window Substring]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/96723427</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/96723427</guid><author>Peng_maple</author><pubDate>Sun, 21 Jul 2019 15:09:25 +0800</pubDate><description><![CDATA[Minimum Window Substring
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).
Example:

Input: S = “ADOBECODEBANC”, T = “ABC”
Ou...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/96702068</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/96702068</guid><author>Peng_maple</author><pubDate>Sun, 21 Jul 2019 11:46:51 +0800</pubDate><description><![CDATA[Edit Distance
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
You have the following 3 operations permitted on a word:
Insert a character
Del...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 123. Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/89056793</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/89056793</guid><author>Peng_maple</author><pubDate>Sat, 06 Apr 2019 15:59:46 +0800</pubDate><description><![CDATA[Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 51. N-Queens]]></title><link>https://blog.youkuaiyun.com/Peng_maple/article/details/88974665</link><guid>https://blog.youkuaiyun.com/Peng_maple/article/details/88974665</guid><author>Peng_maple</author><pubDate>Tue, 02 Apr 2019 16:15:46 +0800</pubDate><description><![CDATA[N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solutions to the n-queens puzzle...]]></description><category></category></item></channel></rss>