<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dbvz4901的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dbvz4901</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dbvz4901]]></copyright><item><title><![CDATA[LeetCode699. Falling Squares]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901603</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901603</guid><author>dbvz4901</author><pubDate>Thu, 04 Oct 2018 15:03:00 +0800</pubDate><description><![CDATA[On an infinite number line (x-axis), we drop given squares in the order they are given.
Thei-th square dropped (positions[i] = (left, side_length)) is a square with the left-most point beingpo...]]></description><category></category></item><item><title><![CDATA[LeetCode691. Stickers to Spell Word]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901597</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901597</guid><author>dbvz4901</author><pubDate>Tue, 02 Oct 2018 00:47:00 +0800</pubDate><description><![CDATA[We are given N different types of stickers. Each sticker has a lowercase English word on it.
You would like to spell out the giventargetstring by cutting individual letters from your collectio...]]></description><category></category></item><item><title><![CDATA[LeetCode664. Strange Printer]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901601</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901601</guid><author>dbvz4901</author><pubDate>Sat, 29 Sep 2018 16:54:00 +0800</pubDate><description><![CDATA[There is a strange printer with the following two special requirements:

The printer can only print a sequence of the same character each time.
At each turn, the printer can print new characte...]]></description><category></category></item><item><title><![CDATA[LeetCode517. Super Washing Machines]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901596</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901596</guid><author>dbvz4901</author><pubDate>Sat, 29 Sep 2018 15:45:00 +0800</pubDate><description><![CDATA[You havensuper washing machines on a line. Initially, each washing machine has some dresses or is empty.
For eachmove, you could chooseany m(1 ≤ m ≤ n) washing machines, and passone dress...]]></description><category></category></item><item><title><![CDATA[LeetCode446. Arithmetic Slices II - Subsequence]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901599</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901599</guid><author>dbvz4901</author><pubDate>Fri, 28 Sep 2018 23:35:00 +0800</pubDate><description><![CDATA[A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
For example, these are arithmetic seq...]]></description><category></category></item><item><title><![CDATA[LeetCode403. Frog Jump]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901594</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901594</guid><author>dbvz4901</author><pubDate>Fri, 28 Sep 2018 21:31:00 +0800</pubDate><description><![CDATA[A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.
Given a list...]]></description><category></category></item><item><title><![CDATA[LeetCode282. Expression Add Operators]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901598</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901598</guid><author>dbvz4901</author><pubDate>Fri, 28 Sep 2018 00:04:00 +0800</pubDate><description><![CDATA[Given a string that contains only digits0-9and a target value, return all possibilities to addbinaryoperators (not unary)+,-, or*between the digits so they evaluate to the target value.
E...]]></description><category></category></item><item><title><![CDATA[LeetCode828. Unique Letter String]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901595</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901595</guid><author>dbvz4901</author><pubDate>Wed, 26 Sep 2018 23:41:00 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/unique-letter-string/description/
A character is unique in stringSif it occurs exactly once in it.
For example, in stringS = "LETTER", the only unique character...]]></description><category></category></item><item><title><![CDATA[新单词和语法的学习(英文)]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901592</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901592</guid><author>dbvz4901</author><pubDate>Mon, 24 Sep 2018 12:13:00 +0800</pubDate><description><![CDATA[1. 习惯于
be used to　　　　be accustomed to
eg:I'musedtoloneliness. / 我已习惯孤独
　 Heisaccustomedtohardwork. / 他习惯艰苦工作
　 Sheusedtomakeaspeechinpublic. / 她过去习惯于在大众下发表演讲。  注意这里的 us...]]></description><category></category></item><item><title><![CDATA[算法笔试题整理——升级蓄水池 && 字符串数字表达式计算值 && 求旅游完所有景点需要的最少天数 && 宝箱怪...]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901446</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901446</guid><author>dbvz4901</author><pubDate>Sun, 23 Sep 2018 00:35:00 +0800</pubDate><description><![CDATA[1. 小米笔试题——升级蓄水池
题目描述：
在米兔生活的二维世界中，建造蓄水池非常简单。
一个蓄水池可以用n个坐标轴上的非负整数表示，代表区间为【0-n】范围内宽度为1的墙壁的高度。
如下图1，黑色部分是墙壁，墙壁的高度是[0,1,0,2,1,0,1,3,2,1,2,1] ，蓝色部分是蓄水的面积，可以看出蓄水池最大蓄水容量是6。
现在米兔想通过增加某些墙壁的高度对蓄水池扩容，但...]]></description><category></category></item><item><title><![CDATA[一些相似单词的区别之处]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901593</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901593</guid><author>dbvz4901</author><pubDate>Sat, 22 Sep 2018 17:41:00 +0800</pubDate><description><![CDATA[1. devote 和 contribute
https://zhidao.baidu.com/question/328034454447561365.html
contribute to 和devote to区别1、devote to：专心致力于，把…专用于，另外还有听任的意思。2、contribute to：捐助，帮助，贡献，出力；给…投稿的意思。3、contribute (mo...]]></description><category></category></item><item><title><![CDATA[LeetCode301. Remove Invalid Parentheses]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901590</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901590</guid><author>dbvz4901</author><pubDate>Tue, 18 Sep 2018 12:16:00 +0800</pubDate><description><![CDATA[Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.
Note:The input string may contain letters other than the parentheses(and...]]></description><category></category></item><item><title><![CDATA[算法刷题细节点总结]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901588</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901588</guid><author>dbvz4901</author><pubDate>Tue, 18 Sep 2018 12:16:00 +0800</pubDate><description><![CDATA[1. 关于集合
(1) 关于map
遍历map：https://www.cnblogs.com/imzhj/p/5981665.html
感觉最好记的方法是这个：

Map&lt;String, String&gt; map = new HashMap&lt;String, String&gt;();
for (Entry&lt;String, String&gt; en...]]></description><category></category></item><item><title><![CDATA[LeetCode765. Couples Holding Hands]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901591</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901591</guid><author>dbvz4901</author><pubDate>Tue, 28 Aug 2018 17:11:00 +0800</pubDate><description><![CDATA[N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. Aswapconsists of choosinganytwo p...]]></description><category></category></item><item><title><![CDATA[LeetCode741. Cherry Pickup]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901585</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901585</guid><author>dbvz4901</author><pubDate>Tue, 28 Aug 2018 01:22:00 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/cherry-pickup/description/
In a N x Ngridrepresenting a field of cherries, each cell is one of three possible integers.

0 means the cell is empty, so you can ...]]></description><category></category></item><item><title><![CDATA[LeetCode312. Burst Balloons]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901589</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901589</guid><author>dbvz4901</author><pubDate>Tue, 21 Aug 2018 02:15:00 +0800</pubDate><description><![CDATA[Givennballoons, indexed from0ton-1. Each balloon is painted with a number on it represented by arraynums. You are asked to burst all the balloons. If the you burst ballooniyou will getnu...]]></description><category></category></item><item><title><![CDATA[LeetCode679. 24  Game]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901583</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901583</guid><author>dbvz4901</author><pubDate>Mon, 20 Aug 2018 00:42:00 +0800</pubDate><description><![CDATA[You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through*,/,+,-,(,)to get the value of 24.
Example 1:
Input: [4, 1, 8, 7]
Output: Tru...]]></description><category></category></item><item><title><![CDATA[LeetCode862. Shortest Subarray with Sum at Least K]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901581</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901581</guid><author>dbvz4901</author><pubDate>Sat, 18 Aug 2018 15:30:00 +0800</pubDate><description><![CDATA[Return thelengthof the shortest, non-empty, contiguoussubarray ofAwith sum at leastK.
If there is no non-empty subarray with sum at leastK, return-1.

Example 1:
Input: A = [1], K = 1...]]></description><category></category></item><item><title><![CDATA[LeetCode818. Race Car]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901579</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901579</guid><author>dbvz4901</author><pubDate>Fri, 17 Aug 2018 01:03:00 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/race-car/description/
Your car starts at position 0 and speed +1 on an infinite number line. (Your car can go into negative positions.)
Your car drives automatica...]]></description><category></category></item><item><title><![CDATA[LeetCode解题报告—— Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/dbvz4901/article/details/101901587</link><guid>https://blog.youkuaiyun.com/dbvz4901/article/details/101901587</guid><author>dbvz4901</author><pubDate>Wed, 15 Aug 2018 01:33:00 +0800</pubDate><description><![CDATA[Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete at mostt...]]></description><category></category></item></channel></rss>