原文链接: https://leetcode-cn.com/problems/sequential-digits 英文原文An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers in the range [low, high] inclusive tha…

原文链接: https://leetcode-cn.com/problems/print-zero-even-odd 英文原文You have a function printNumber that can be called with an integer parameter and prints it to the console. For example, calling printNumber(7) prints 7 to the console. You are given an in…

原文链接: https://leetcode-cn.com/problems/relative-sort-array 英文原文Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. Sort the elements of arr1 such that the relative ordering of items in arr1 ar…

原文链接: https://leetcode-cn.com/problems/lowest-common-ancestor-of-deepest-leaves 英文原文Given the root of a binary tree, return the lowest common ancestor of its deepest leaves. Recall that: The node of a binary tree is a leaf if and only if it has no ch…

原文链接: https://leetcode-cn.com/problems/longest-well-performing-interval 英文原文We are given hours, a list of the number of hours worked per day for a given employee. A day is considered to be a tiring day if and only if the number of hours worked is (st…

原文链接: https://leetcode-cn.com/problems/smallest-sufficient-team 英文原文In a project, you have a list of required skills req_skills, and a list of people. The ith person people[i] contains a list of skills that the person has. Consider a sufficient team:…

原文链接: https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array 英文原文Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time, return that integer. Exa…

原文链接: https://leetcode-cn.com/problems/remove-covered-intervals 英文原文Given an array intervals where intervals[i] = [li, ri] represent the interval [li, ri), remove all intervals that are covered by another interval in the list. The interval [a, b) is …

原文链接: https://leetcode-cn.com/problems/graph-connectivity-with-threshold 英文原文We have n cities labeled from 1 to n. Two different cities with labels x and y are directly connected by a bidirectional road if and only if x and y share a common divisor s…

原文链接: https://leetcode-cn.com/problems/minimum-falling-path-sum-ii 英文原文Given an n x n integer matrix grid, return the minimum sum of a falling path with non-zero shifts. A falling path with non-zero shifts is a choice of exactly one element from each…

原文链接: https://leetcode-cn.com/problems/number-of-equivalent-domino-pairs 英文原文Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a == c and b == d), or (a == d and b == c) - that is, one domino …

原文链接: https://leetcode-cn.com/problems/minimum-cost-tree-from-leaf-values 英文原文Given an array arr of positive integers, consider all binary trees such that: Each node has either 0 or 2 children; The values of arr correspond to the values of each leaf …

原文链接: https://leetcode-cn.com/problems/shortest-path-with-alternating-colors 英文原文Consider a directed graph, with nodes labelled 0, 1, ..., n-1. In this graph, each edge is either red or blue, and there could be self-edges or parallel edges. Each [i, …

原文链接: https://leetcode-cn.com/problems/maximum-of-absolute-value-expression 英文原文Given two arrays of integers with equal lengths, return the maximum value of: |arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j| where the maximum is taken over all 0 <=…

原文链接: https://leetcode-cn.com/problems/replace-elements-with-greatest-element-on-right-side 英文原文Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1. A…

原文链接: https://leetcode-cn.com/problems/sum-of-mutated-array-closest-to-target 英文原文Given an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the given array to be equa…

原文链接: https://leetcode-cn.com/problems/number-of-paths-with-max-score 英文原文You are given a square board of characters. You can move on the board starting at the bottom right square marked with the character 'S'. You need to reach the top left square m…

原文链接: https://leetcode-cn.com/problems/n-th-tribonacci-number 英文原文The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn. Example 1: Input: n = 4 Output: 4 Exp…

原文链接: https://leetcode-cn.com/problems/largest-1-bordered-square 英文原文Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn't exist in the grid. Example 1:…

原文链接: https://leetcode-cn.com/problems/stone-game-ii 英文原文Alice and Bob continue their games with piles of stones. There are a number of piles arranged in a row, and each pile has a positive integer number of stones piles[i]. The objective of the game…

原文链接: https://leetcode-cn.com/problems/decompress-run-length-encoded-list 英文原文We are given a list nums of integers representing a list compressed with run-length encoding. Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]]…

原文链接: https://leetcode-cn.com/problems/matrix-block-sum 英文原文Given a m x n matrix mat and an integer k, return a matrix answer where each answer[i][j] is the sum of all elements mat[r][c] for: i - k <= r <= i + k, j - k <= c <= j + k, and (r, c) is a …

原文链接: https://leetcode-cn.com/problems/sum-of-nodes-with-even-valued-grandparent 英文原文Given the root of a binary tree, return the sum of values of nodes with an even-valued grandparent. If there are no nodes with an even-valued grandparent, return 0. …

原文链接: https://leetcode-cn.com/problems/distinct-echo-substrings 英文原文Return the number of distinct non-empty substrings of text that can be written as the concatenation of some string with itself (i.e. it can be written as a + a where a is some string…

原文链接: https://leetcode-cn.com/problems/decrease-elements-to-make-array-zigzag 英文原文Given an array nums of integers, a move consists of choosing any element and decreasing it by 1. An array A is a zigzag array if either: Every even-indexed element is g…

原文链接: https://leetcode-cn.com/problems/binary-tree-coloring-game 英文原文Two players play a turn based game on a binary tree. We are given the root of this binary tree, and the number of nodes n in the tree. n is odd, and each node has a distinct value f…

原文链接: https://leetcode-cn.com/problems/longest-common-subsequence 英文原文Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string gen…

原文链接: https://leetcode-cn.com/problems/longest-chunked-palindrome-decomposition 英文原文You are given a string text. You should split it to k substrings (subtext1, subtext2, ..., subtextk) such that: subtexti is a non-empty string. The concatenation of a…

原文链接: https://leetcode-cn.com/problems/sort-the-matrix-diagonally 英文原文A matrix diagonal is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direction until reaching the matrix…

原文链接: https://leetcode-cn.com/problems/break-a-palindrome 英文原文Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string is not a palindrome and tha…