原文链接: https://leetcode-cn.com/problems/cherry-pickup 英文原文You are given an n x n grid representing a field of cherries, each cell is one of three possible integers. 0 means the cell is empty, so you can pass through, 1 means the cell contains a cherry…

原文链接: https://leetcode-cn.com/problems/delete-and-earn 英文原文You are given an integer array nums. You want to maximize the number of points you get by performing the following operation any number of times: Pick any nums[i] and delete it to earn nums[i…

原文链接: https://leetcode-cn.com/problems/network-delay-time 英文原文You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the …

原文链接: https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target 英文原文Given a characters array letters that is sorted in non-decreasing order and a character target, return the smallest character in the array that is larger than target.…

原文链接: https://leetcode-cn.com/problems/prefix-and-suffix-search 英文原文Design a special dictionary with some words that searchs the words in it by a prefix and a suffix. Implement the WordFilter class: WordFilter(string[] words) Initializes the object w…

原文链接: https://leetcode-cn.com/problems/largest-number-at-least-twice-of-others 英文原文You are given an integer array nums where the largest integer is unique. Determine whether the largest element in the array is at least twice as much as every other nu…

原文链接: https://leetcode-cn.com/problems/min-cost-climbing-stairs 英文原文You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the …

原文链接: https://leetcode-cn.com/problems/contain-virus 英文原文A virus is spreading rapidly, and your task is to quarantine the infected area by installing walls. The world is modeled as an m x n binary grid isInfected, where isInfected[i][j] == 0 represen…

原文链接: https://leetcode-cn.com/problems/shortest-completing-word 英文原文Given a string licensePlate and an array of strings words, find the shortest completing word in words. A completing word is a word that contains all the letters in licensePlate. Igno…

原文链接: https://leetcode-cn.com/problems/cracking-the-safe 英文原文There is a safe protected by a password. The password is a sequence of n digits where each digit can be in the range [0, k - 1]. The safe has a peculiar way of checking the password. When y…

原文链接: https://leetcode-cn.com/problems/reach-a-number 英文原文You are standing at position 0 on an infinite number line. There is a destination at position target. You can make some number of moves numMoves so that: On each move, you can either go left o…

原文链接: https://leetcode-cn.com/problems/pyramid-transition-matrix 英文原文You are stacking blocks to form a pyramid. Each block has a color, which is represented by a single letter. Each row of blocks contains one less block than the row beneath it and is…

原文链接: https://leetcode-cn.com/problems/set-intersection-size-at-least-two 英文原文An integer interval [a, b] (for integers a < b) is a set of all consecutive integers from a to b, including a and b. Find the minimum size of a set S such that for every in…

原文链接: https://leetcode-cn.com/problems/special-binary-string 英文原文Special binary strings are binary strings with the following two properties: The number of 0's is equal to the number of 1's. Every prefix of the binary string has at least as many 1's …

原文链接: https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation 英文原文Given two integers left and right, return the count of numbers in the inclusive range [left, right] having a prime number of set bits in their binary represe…

原文链接: https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list 英文原文You are given a doubly linked list, which contains nodes that have a next pointer, a previous pointer, and an additional child pointer. This child pointer may or may n…

原文链接: https://leetcode-cn.com/problems/partition-labels 英文原文You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Return a list of integers representing the size of t…

原文链接: https://leetcode-cn.com/problems/largest-plus-sign 英文原文You are given an integer n. You have an n x n binary grid grid with all values initially 1's except for some indices given in the array mines. The ith element of the array mines is defined …

原文链接: https://leetcode-cn.com/problems/couples-holding-hands 英文原文There are n couples sitting in 2n seats arranged in a row and want to hold hands. The people and seats are represented by an integer array row where row[i] is the ID of the person sitti…

原文链接: https://leetcode-cn.com/problems/construct-quad-tree 英文原文Given a n * n matrix grid of 0's and 1's only. We want to represent the grid with a Quad-Tree. Return the root of the Quad-Tree representing the grid. Notice that you can assign the value…

原文链接: https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree 英文原文Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Nary-Tree input seri…

原文链接: https://leetcode-cn.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees 英文原文A Binary Matrix is a matrix in which all the elements are either 0 or 1. Given quadTree1 and quadTree2. quadTree1 represents a n * n binary matrix and…

原文链接: https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal 英文原文Given the root of an n-ary tree, return the postorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal. Each group of…

原文链接: https://leetcode-cn.com/problems/toeplitz-matrix 英文原文Given an m x n matrix, return true if the matrix is Toeplitz. Otherwise, return false. A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same elements. Example 1: I…

原文链接: https://leetcode-cn.com/problems/reorganize-string 英文原文Given a string s, rearrange the characters of s so that any two adjacent characters are not the same. Return any possible rearrangement of s or return "" if not possible. Example 1: Input: …

原文链接: https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii 英文原文You are given an integer array arr. We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equa…

原文链接: https://leetcode-cn.com/problems/max-chunks-to-make-sorted 英文原文You are given an integer array arr of length n that represents a permutation of the integers in the range [0, n - 1]. We split arr into some number of chunks (i.e., partitions), and…

原文链接: https://leetcode-cn.com/problems/basic-calculator-iv 英文原文Given an expression such as expression = "e + 8 - a + 5" and an evaluation map such as {"e": 1} (given in terms of evalvars = ["e"] and evalints = [1]), return a list of tokens representi…

原文链接: https://leetcode-cn.com/problems/search-in-a-binary-search-tree 英文原文You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subtree rooted with that node.…

原文链接: https://leetcode-cn.com/problems/jewels-and-stones 英文原文You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to …