原文链接: https://leetcode-cn.com/problems/reformat-the-string 英文原文Given alphanumeric string s. (Alphanumeric string is a string consisting of lowercase English letters and digits). You have to find a permutation of the string where no letter is followed…

原文链接: https://leetcode-cn.com/problems/display-table-of-food-orders-in-a-restaurant 英文原文Given the array orders, which represents the orders that customers have done in a restaurant. More specifically orders[i]=[customerNamei,tableNumberi,foodItemi] w…

原文链接: https://leetcode-cn.com/problems/minimum-number-of-frogs-croaking 英文原文You are given the string croakOfFrogs, which represents a combination of the string "croak" from different frogs, that is, multiple frogs can croak at the same time, so multi…

原文链接: https://leetcode-cn.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons 英文原文Given three integers n, m and k. Consider the following algorithm to find the maximum element of an array of positive integers: You should bui…

原文链接: https://leetcode-cn.com/problems/maximum-score-after-splitting-a-string 英文原文Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring). The sco…

原文链接: https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards 英文原文There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints. In one step, you ca…

原文链接: https://leetcode-cn.com/problems/diagonal-traverse-ii 英文原文Given a list of lists of integers, nums, return all elements of nums in diagonal order as shown in the below images. Example 1: Input: nums = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,4,2,7,5…

原文链接: https://leetcode-cn.com/problems/max-difference-you-can-get-from-changing-an-integer 英文原文You are given an integer num. You will apply the following steps exactly two times: Pick a digit x (0 <= x <= 9). Pick another digit y (0 <= y <= 9). The d…

原文链接: https://leetcode-cn.com/problems/consecutive-characters 英文原文The power of the string is the maximum length of a non-empty substring that contains only one unique character. Given a string s, return the power of s. Example 1: Input: s = "leetcode…

原文链接: https://leetcode-cn.com/problems/simplified-fractions 英文原文Given an integer n, return a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator is less-than-or-equal-to n. The fractions can be in any order. Example…

原文链接: https://leetcode-cn.com/problems/count-good-nodes-in-binary-tree 英文原文Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the number of good nodes in t…

原文链接: https://leetcode-cn.com/problems/form-largest-integer-with-digits-that-add-up-to-target 英文原文Given an array of integers cost and an integer target. Return the maximum integer you can paint under the following rules: The cost of painting a digit …

原文链接: https://leetcode-cn.com/problems/destination-city 英文原文You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path…

原文链接: https://leetcode-cn.com/problems/check-if-all-1s-are-at-least-length-k-places-away 英文原文Given an array nums of 0s and 1s and an integer k, return True if all 1's are at least k places away from each other, otherwise return False. Example 1: Inpu…

原文链接: https://leetcode-cn.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit 英文原文Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute diffe…

原文链接: https://leetcode-cn.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows 英文原文You are given an m * n matrix, mat, and an integer k, which has its rows sorted in non-decreasing order. You are allowed to choose exactly 1 element fro…

原文链接: https://leetcode-cn.com/problems/build-an-array-with-stack-operations 英文原文Given an array target and an integer n. In each iteration, you will read a number from list = {1,2,3..., n}. Build the target array using the following operations: Push: …

原文链接: https://leetcode-cn.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor 英文原文Given an array of integers arr. We want to select three indices i, j and k where (0 <= i < j <= k < arr.length). Let's define a and b as follows: a = arr[…

原文链接: https://leetcode-cn.com/problems/minimum-time-to-collect-all-apples-in-a-tree 英文原文Given an undirected tree consisting of n vertices numbered from 0 to n-1, which has some apples in their vertices. You spend 1 second to walk over one edge of the…

原文链接: https://leetcode-cn.com/problems/number-of-ways-of-cutting-a-pizza 英文原文Given a rectangular pizza represented as a rows x cols matrix containing the following characters: 'A' (an apple) and '.' (empty cell) and given the integer k. You have to c…

原文链接: https://leetcode-cn.com/problems/make-two-arrays-equal-by-reversing-sub-arrays 英文原文Given two integer arrays of equal length target and arr. In one step, you can select any non-empty sub-array of arr and reverse it. You are allowed to make any n…

原文链接: https://leetcode-cn.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k 英文原文Given a binary string s and an integer k. Return true if every binary code of length k is a substring of s. Otherwise, return false. Example 1: Input: s …

原文链接: https://leetcode-cn.com/problems/course-schedule-iv 英文原文There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must t…

原文链接: https://leetcode-cn.com/problems/cherry-pickup-ii 英文原文Given a rows x cols matrix grid representing a field of cherries. Each cell in grid represents the number of cherries that you can collect. You have two robots that can collect cherries for …

原文链接: https://leetcode-cn.com/problems/number-of-students-doing-homework-at-a-given-time 英文原文Given two integer arrays startTime and endTime and given an integer queryTime. The ith student started doing their homework at the time startTime[i] and fini…

原文链接: https://leetcode-cn.com/problems/rearrange-words-in-a-sentence 英文原文Given a sentence text (A sentence is a string of space-separated words) in the following format: First letter is in upper case. Each word in text are separated by a single space…

原文链接: https://leetcode-cn.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard 英文原文You have a very large square wall and a circular dartboard placed on the wall. You have been challenged to throw darts into the board blindfolded. Darts…

原文链接: https://leetcode-cn.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence 英文原文Given a sentence that consists of some words separated by a single space, and a searchWord, check if searchWord is a prefix of any word in sentenc…

原文链接: https://leetcode-cn.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length 英文原文Given a string s and an integer k. Return the maximum number of vowel letters in any substring of s with length k. Vowel letters in English are (a, e, …

原文链接: https://leetcode-cn.com/problems/pseudo-palindromic-paths-in-a-binary-tree 英文原文Given a binary tree where node values are digits from 1 to 9. A path in the binary tree is said to be pseudo-palindromic if at least one permutation of the node valu…