摘要：
We are given a list of (axis aligned) . Each , where (x1, y1) are the coordinates of the bottom left corner, and (x2, y2) are the coordinates of the t 阅读全文
摘要：
Given an array A of integers, for each integer A[i] we need to choose either x = -K or x = K, and add x to A[i] (only once). After this process, we ha 阅读全文
摘要：
Strings and are similar (for some non negative integer ) if we can swap the positions of two letters in exactly times so that the resulting string equ 阅读全文
摘要：
On an N x N , the numbers from to are written boustrophedonically starting from the bottom left of the board, and alternating direction each row. For 阅读全文
摘要：
There are workers. The th worker has a and a minimum wage expectation . Now we want to hire exactly workers to form a paid group . When hiring a group 阅读全文
摘要：
Given an array of integers, for each integer we may choose any with ` K 这道题说是给了一个非负数的数组，和一个非负数K，说是数组中的每一个数字都可以加上 [ K, K] 范围内的任意一个数字，问新数组的最大值最小值之间的差值最小 阅读全文
摘要：
Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K. If there is no non-empty subarray with sum at least K, ret 阅读全文
摘要：
Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. Since the answer may be large, return 阅读全文
摘要：
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 l 阅读全文
摘要：
Let's say a positive integer is a *superpalindrome* if it is a palindrome, and it is also the square of a palindrome. Now, given two positive integers 阅读全文
摘要：
A car travels from a starting position to a destination which is miles east of the starting position. Along the way, there are gas stations. Each repr 阅读全文
摘要：
Given an array of non negative integers, return an array consisting of all the even elements of , followed by all the odd elements of . You may return 阅读全文
摘要：
We run a preorder depth first search on the rootof a binary tree. At each node in this traversal, we output D dashes (where D is the depth of this nod 阅读全文
摘要：
A positive integer is magical if it is divisible by either A or B. Return the N th magical number. Since the answer may be very large, return it modul 阅读全文
摘要：
In a row of trees, the th tree produces fruit with type . You start at any tree of your choice, then repeatedly perform the following steps: 1. Add on 阅读全文
摘要：
There are G people in a gang, and a list of various crimes they could commit. The th crime generates a and requires gang members to participate. If a 阅读全文
摘要：
We are given , a length string of characters from the set . (These letters stand for "decreasing" and "increasing".) A valid permutation is a permutat 阅读全文
摘要：
Starting with an undirected graph (the "original graph") with nodes from to , subdivisions are made to some of the edges. The graph is given as follow 阅读全文
摘要：
We have a sorted set of digits D, a non-empty subset of {'1','2','3','4','5','6','7','8','9'}. (Note that '0' is not included.) Now, we write numbers 阅读全文
摘要：
You are given eggs, and you have access to a building with floors from to . Each egg is identical in function, and if an egg breaks, you cannot drop i 阅读全文
摘要：
Write a class which collects daily price quotes for some stock, and returns the span of that stock's price for the current day. The span of the stock' 阅读全文
摘要：
Given an array of integers , consider all non empty subsequences of . For any sequence S, let the width of S be the difference between the maximum and 阅读全文
摘要：
Write an iterator that iterates through a run length encoded sequence. The iterator is initialized by , where is a run length encoding of some sequenc 阅读全文
摘要：
A string of lowercase letters is given. Then, we may make any number of moves . In each move, we choose one of the first letters (starting from the le 阅读全文
摘要：
Implement , a class which simulates the operation of a stack like data structure. has two functions: , which pushes an integer onto the stack. , which 阅读全文
摘要：
We have an array A of non-negative integers. For every (contiguous) subarray B = [A[i], A[i+1], ..., A[j]] (with i <= j), we take the bitwise OR of al 阅读全文
摘要：
Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and o 阅读全文
摘要：
An array is monotonic if it is either monotone increasing or monotone decreasing. An array is monotone increasing if for all . Return if and only if t 阅读全文
摘要：
A full binary tree is a binary tree where each node has exactly 0 or 2 children. Return a list of all possible full binary trees with nodes. Each elem 阅读全文
摘要：
You are given an array of strings. Two strings and are special equivalent if after any number of moves , S == T. A move consists of choosing two indic 阅读全文
摘要：
On a grid, we place some cubes. Each value represents a tower of cubes placed on top of grid cell . Return the total surface area of the resulting sha 阅读全文
摘要：
You have a list of and a , and you want to know which words in matches the pattern. A word matches the pattern if there exists a permutation of letter 阅读全文
摘要：
Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals and are distinct positive integers. Example 阅读全文
摘要：
Alice and Bob have candy bars of different sizes: is the size of the th bar of candy that Alice has, and is the size of the th bar of candy that Bob h 阅读全文
摘要：
On a 2 dimensional grid with rows and columns, we start at facing east. Here, the north west corner of the grid is at the first row and column, and th 阅读全文
摘要：
We are given two sentences and . (A sentence is a string of space separated words. Each word consists only of lowercase letters.) A word is uncommon i 阅读全文
摘要：
On a grid, we place some cubes that are axis aligned with the x, y, and z axes. Each value represents a tower of cubes placed on top of grid cell . No 阅读全文
摘要：
The th person has weight , and each boat can carry a maximum weight of . Each boat carries at most 2 people at the same time, provided the sum of the 阅读全文
摘要：
An encoded string 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 阅读全文
摘要：
引言 为什么想到制作这么一个插件呢，是因为博主在更新微信公众号【刷尽天下】的后台数据库时，需要有博客园题目帖子的链接，那么就要从这篇帖子 "LeetCode All in One 题目讲解汇总(持续更新中...)" 中提取各个题目的链接。之前博主都是使用的都是Excel的插件 "Kutools" 来 阅读全文
