<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[WXM]]></title><description><![CDATA[写代码就像写作文，思路要明确，结构要紧凑，否则写得又臭又长]]></description><link>https://blog.youkuaiyun.com/WX_ming</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; WX_ming]]></copyright><item><title><![CDATA[LeetCode 864. Shortest Path to Get All Keys]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87904851</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87904851</guid><author>WX_ming</author><pubDate>Sun, 24 Feb 2019 16:45:30 +0800</pubDate><description><![CDATA[864. Shortest Path to Get All Keys
We are given a 2-dimensional grid. “.” is an empty cell, “#” is a wall, “@” is the starting point, (“a”, “b”, …) are keys, and (“A”, “B”, …) are locks.
We start at t...]]></description><category></category></item><item><title><![CDATA[LeetCode 502.IPO]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87894975</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87894975</guid><author>WX_ming</author><pubDate>Sat, 23 Feb 2019 17:36:55 +0800</pubDate><description><![CDATA[502.IPO
Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO. S...]]></description><category></category></item><item><title><![CDATA[网易笔试题-堆棋子]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87866494</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87866494</guid><author>WX_ming</author><pubDate>Thu, 21 Feb 2019 18:44:24 +0800</pubDate><description><![CDATA[题目描述
小易将n个棋子摆放在一张无限大的棋盘上。第i个棋子放在第x[i]行y[i]列。同一个格子允许放置多个棋子。每一次操作小易可以把一个棋子拿起并将其移动到原格子的上、下、左、右的任意一个格子中。小易想知道要让棋盘上出现有一个格子中至少有i(1 ≤ i ≤ n)个棋子所需要的最少操作次数.
输入描述:
输入包括三行,第一行一个整数n(1 ≤ n ≤ 50),表示棋子的个数
第二行为n个棋子的横...]]></description><category></category></item><item><title><![CDATA[LeetCode 76. Minimum Window Substring]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87551277</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87551277</guid><author>WX_ming</author><pubDate>Sun, 17 Feb 2019 19:29:18 +0800</pubDate><description><![CDATA[76. 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”...]]></description><category></category></item><item><title><![CDATA[LeetCode 72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87539962</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87539962</guid><author>WX_ming</author><pubDate>Sun, 17 Feb 2019 16:27:22 +0800</pubDate><description><![CDATA[72. 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...]]></description><category></category></item><item><title><![CDATA[LeetCode 68. Text Justification]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87536607</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87536607</guid><author>WX_ming</author><pubDate>Sun, 17 Feb 2019 15:35:41 +0800</pubDate><description><![CDATA[68. Text Justification
Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.
You should pack your w...]]></description><category></category></item><item><title><![CDATA[LeetCode 899. Orderly Queue]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87457065</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87457065</guid><author>WX_ming</author><pubDate>Sat, 16 Feb 2019 16:45:09 +0800</pubDate><description><![CDATA[899. Orderly Queue
A string S of lowercase letters is given.  Then, we may make any number of moves.
In each move, we choose one of the first K letters (starting from the left), remove it, and place i...]]></description><category></category></item><item><title><![CDATA[LeetCode 44. Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87451645</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87451645</guid><author>WX_ming</author><pubDate>Sat, 16 Feb 2019 15:17:11 +0800</pubDate><description><![CDATA[44. Wildcard Matching
Given an input string (s) and a pattern §, implement wildcard pattern matching with support for ‘?’ and ‘*’.
'?' Matches any single character.
'*' Matches any sequence of charact...]]></description><category></category></item><item><title><![CDATA[LeetCode 30. Substring with Concatenation of All Words]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87293145</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87293145</guid><author>WX_ming</author><pubDate>Thu, 14 Feb 2019 19:34:56 +0800</pubDate><description><![CDATA[30. Substring with Concatenation of All Words
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatena...]]></description><category></category></item><item><title><![CDATA[LeetCode 10. Regular Expression Matching]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87275728</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87275728</guid><author>WX_ming</author><pubDate>Thu, 14 Feb 2019 15:21:57 +0800</pubDate><description><![CDATA[10. Regular Expression Matching
Given an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*’.
‘.’ Matches any single character.
‘*’ Matches zero or mor...]]></description><category></category></item><item><title><![CDATA[Leetcode 4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87203844</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87203844</guid><author>WX_ming</author><pubDate>Wed, 13 Feb 2019 20:07:17 +0800</pubDate><description><![CDATA[4. Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)...]]></description><category></category></item><item><title><![CDATA[LeetCode 218. The Skyline Problem]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87192476</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87192476</guid><author>WX_ming</author><pubDate>Wed, 13 Feb 2019 17:19:01 +0800</pubDate><description><![CDATA[A city’s skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height of all the buildings as...]]></description><category></category></item><item><title><![CDATA[LeetCode 316. Remove Duplicate Letters]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87007179</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87007179</guid><author>WX_ming</author><pubDate>Mon, 11 Feb 2019 17:08:00 +0800</pubDate><description><![CDATA[（自己开发的博客，欢迎访问）https://www.weiboke.online
316. Remove Duplicate Letters
Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. Yo...]]></description><category></category></item><item><title><![CDATA[leetcode 895. Maximum Frequency Stack]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/87002767</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/87002767</guid><author>WX_ming</author><pubDate>Mon, 11 Feb 2019 16:00:01 +0800</pubDate><description><![CDATA[895. Maximum Frequency Stack
Implement FreqStack, a class which simulates the operation of a stack-like data structure.
FreqStack has two functions:
push(int x), which pushes an integer x onto the sta...]]></description><category></category></item><item><title><![CDATA[leetcode 85. Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/86761483</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/86761483</guid><author>WX_ming</author><pubDate>Sun, 03 Feb 2019 22:10:26 +0800</pubDate><description><![CDATA[Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.
Example:
Input:
[
[“1”,“0”,“1”,“0”,“0”],
[“1”,“0”,“1”,“1”,“1”],
[“1”,“1”,“1”,“1”,“...]]></description><category></category></item><item><title><![CDATA[LeetCode 42. Trapping Rain Water]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/86760873</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/86760873</guid><author>WX_ming</author><pubDate>Sun, 03 Feb 2019 20:04:41 +0800</pubDate><description><![CDATA[42. Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

The above elevation map ...]]></description><category></category></item><item><title><![CDATA[leetcode 880. Decoded String at Index]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/86760140</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/86760140</guid><author>WX_ming</author><pubDate>Sun, 03 Feb 2019 17:03:18 +0800</pubDate><description><![CDATA[880. Decoded String at Index
An encoded string S is given.  To find and write the decoded string to a tape, the encoded string is read one character at a time and the following steps are taken:
If the...]]></description><category></category></item><item><title><![CDATA[907. Sum of Subarray Minimums]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/86759833</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/86759833</guid><author>WX_ming</author><pubDate>Sun, 03 Feb 2019 16:14:24 +0800</pubDate><description><![CDATA[欢迎访问我的博客网站 https://www.weiboke.online/posts/page
907. Sum of Subarray Minimums
Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A.
Since the ans...]]></description><category></category></item><item><title><![CDATA[leetcode 385. Mini Parser]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/86749304</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/86749304</guid><author>WX_ming</author><pubDate>Sat, 02 Feb 2019 14:11:18 +0800</pubDate><description><![CDATA[385. Mini Parser
Given a nested list of integers represented as a string, implement a parser to deserialize it.
Each element is either an integer, or a list – whose elements may also be integers or ot...]]></description><category></category></item><item><title><![CDATA[Leetcode 173. Binary Search Tree Iterator]]></title><link>https://blog.youkuaiyun.com/WX_ming/article/details/86747569</link><guid>https://blog.youkuaiyun.com/WX_ming/article/details/86747569</guid><author>WX_ming</author><pubDate>Sat, 02 Feb 2019 09:54:23 +0800</pubDate><description><![CDATA[173. Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will return the next smallest numb...]]></description><category></category></item></channel></rss>