<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LawFile的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LawFile</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LawFile]]></copyright><item><title><![CDATA[#1477. Find Two Non-overlapping Sub-arrays Each With Target Sum]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/107608742</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/107608742</guid><author>LawFile</author><pubDate>Mon, 27 Jul 2020 11:46:51 +0800</pubDate><description><![CDATA[题目描述：

Given an array of integersarrand an integertarget.

You have to findtwo non-overlapping sub-arraysofarreach with sum equaltarget. There can be multiple answers so you have to find an answer where the sum of the lengths of the two sub-arrays ...]]></description><category></category></item><item><title><![CDATA[#1423. Maximum Points You Can Obtain from Cards]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/107608712</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/107608712</guid><author>LawFile</author><pubDate>Mon, 27 Jul 2020 11:45:36 +0800</pubDate><description><![CDATA[题目描述：

There are several cardsarranged in a row, and each card has an associated number of pointsThe points are given in the integer arraycardPoints.

In one step, you can take one card from the beginning or from the end of the row. You have to take exa...]]></description><category></category></item><item><title><![CDATA[#752. Open the Lock]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/107608673</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/107608673</guid><author>LawFile</author><pubDate>Mon, 27 Jul 2020 11:44:24 +0800</pubDate><description><![CDATA[题目描述：

You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots:'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn'9'to be'0', or'0'to be'9'. Each move consi...]]></description><category></category></item><item><title><![CDATA[#1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/107608641</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/107608641</guid><author>LawFile</author><pubDate>Mon, 27 Jul 2020 11:42:50 +0800</pubDate><description><![CDATA[题目描述：

Given anarray of integersnumsand anintegerlimit, return the size of the longestnon-emptysubarray such that the absolute difference between any two elements of this subarray is less than or equal tolimit.

Example 1:


Input: nums = [8,2,4,7]...]]></description><category></category></item><item><title><![CDATA[#946. Validate Stack Sequences]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/107608604</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/107608604</guid><author>LawFile</author><pubDate>Mon, 27 Jul 2020 11:41:27 +0800</pubDate><description><![CDATA[题目描述：

Given two sequencespushedandpoppedwith distinct values,returntrueif and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.

Example 1:


Input: pushed = [1,2,3,4,5], popped = [4,5,3,2...]]></description><category></category></item><item><title><![CDATA[LeetCode #508. Most Frequent Subtree Sum]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103307717</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103307717</guid><author>LawFile</author><pubDate>Mon, 02 Dec 2019 07:24:59 +0800</pubDate><description><![CDATA[题目描述：

Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (...]]></description><category></category></item><item><title><![CDATA[LeetCode #456. 132 Pattern]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103308668</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103308668</guid><author>LawFile</author><pubDate>Mon, 02 Dec 2019 07:24:54 +0800</pubDate><description><![CDATA[题目描述：

Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, aksuch thati&lt;j&lt;kand ai&lt; ak&lt; aj. Design an algorithm that takes a list of n numbers as...]]></description><category></category></item><item><title><![CDATA[LeetCode #464. Can I Win]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103309401</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103309401</guid><author>LawFile</author><pubDate>Mon, 02 Dec 2019 07:24:43 +0800</pubDate><description><![CDATA[题目描述：

In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach or exceed 100 wins.

What if we change the g...]]></description><category></category></item><item><title><![CDATA[LeetCode #509. Fibonacci Number]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103307558</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103307558</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 11:24:32 +0800</pubDate><description><![CDATA[题目描述：

TheFibonacci numbers, commonly denotedF(n)form a sequence, called theFibonacci sequence, such that each number is the sum of the two preceding ones, starting from0and1. That is,


F(0) =...]]></description><category></category></item><item><title><![CDATA[LeetCode #433. Minimum Genetic Mutation]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103307429</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103307429</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 11:20:04 +0800</pubDate><description><![CDATA[题目描述：

A gene string can be represented by an 8-character long string, with choices from"A","C","G","T".

Suppose we need to investigate about a mutation (mutation from "start" to "end"), where ON...]]></description><category></category></item><item><title><![CDATA[LeetCode #422. Valid Word Square]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103306968</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103306968</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 11:07:00 +0800</pubDate><description><![CDATA[题目描述：

Given a sequence of words, check whether it forms a valid word square.

A sequence of words forms a valid word square if thekthrow and column read the exact same string, where 0 ≤k&lt; max(...]]></description><category></category></item><item><title><![CDATA[LeetCode #408. Valid Word Abbreviation]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103306318</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103306318</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 10:46:29 +0800</pubDate><description><![CDATA[题目描述：

Given anon-emptystringsand an abbreviationabbr, return whether the string matches with the given abbreviation.

A string such as"word"contains only the following valid abbreviations:


[...]]></description><category></category></item><item><title><![CDATA[LeetCode  #382. Linked List Random Node]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103305825</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103305825</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 10:28:33 +0800</pubDate><description><![CDATA[题目描述：

Given a singly linked list, return a random node's value from the linked list. Each node must have thesame probabilityof being chosen.

Follow up:
What if the linked list is extremely large a...]]></description><category></category></item><item><title><![CDATA[LeetCode #379. Design Phone Directory]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103305650</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103305650</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 10:22:02 +0800</pubDate><description><![CDATA[题目描述：

Design a Phone Directory which supports the following operations:

get: Provide a number which is not assigned to anyone.
	check: Check if a number is available or not.
	release: Recycle or rel...]]></description><category></category></item><item><title><![CDATA[LeetCode #294. Flip Game II]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103305219</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103305219</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 10:04:26 +0800</pubDate><description><![CDATA[题目描述：

You are playing the following Flip Game with your friend: Given a string that contains only these two characters:+and-, you and your friend take turns to flip twoconsecutive"++"into"--"....]]></description><category></category></item><item><title><![CDATA[LeetCode #293. Flip Game]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103305038</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103305038</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 09:56:08 +0800</pubDate><description><![CDATA[题目描述：

You are playing the following Flip Game with your friend: Given a string that contains only these two characters:+and-, you and your friend take turns to flip twoconsecutive"++"into"--"....]]></description><category></category></item><item><title><![CDATA[LeetCode #288. Unique Word Abbreviation]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103304907</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103304907</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 09:50:04 +0800</pubDate><description><![CDATA[题目描述：

An abbreviation of a word follows the form &lt;first letter&gt;&lt;number&gt;&lt;last letter&gt;. Below are some examples of word abbreviations:


a) it                      --&gt; it    (no ab...]]></description><category></category></item><item><title><![CDATA[LeetCode #281. Zigzag Iterator]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103304389</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103304389</guid><author>LawFile</author><pubDate>Fri, 29 Nov 2019 09:23:18 +0800</pubDate><description><![CDATA[题目描述：

Given two 1d vectors, implement an iterator to return their elements alternately.

Example:


Input: v1 = [1,2] v2 = [3,4,5,6] 
Output: [1,3,2,4,5,6]
Explanation:
By calling next repeatedly un...]]></description><category></category></item><item><title><![CDATA[LeetCode #276. Paint Fence]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103287824</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103287824</guid><author>LawFile</author><pubDate>Thu, 28 Nov 2019 09:49:52 +0800</pubDate><description><![CDATA[题目描述：

There is a fence with n posts, each post can be painted with one of the k colors.

You have to paint all the posts such that no more than two adjacent fence posts have the same color.

Return t...]]></description><category></category></item><item><title><![CDATA[LeetCode #266. Palindrome Permutation]]></title><link>https://blog.youkuaiyun.com/LawFile/article/details/103287262</link><guid>https://blog.youkuaiyun.com/LawFile/article/details/103287262</guid><author>LawFile</author><pubDate>Thu, 28 Nov 2019 09:16:51 +0800</pubDate><description><![CDATA[题目描述：

Given a string, determine if a permutation of the string could form a palindrome.

Example 1:


Input: "code"

Output: false

Example 2:


Input: "aab"

Output: true

Example 3:


Input: "carer...]]></description><category></category></item></channel></rss>