03 2021 档案

[LeetCode] 1092. Shortest Common Supersequence 最短公共超序列

摘要：Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If multiple answers exist, you may return any 阅读全文

posted @ 2021-03-30 15:44 Grandyang 阅读(1144) 评论(0) 推荐(0) 编辑

[LeetCode] 1091. Shortest Path in Binary Matrix 二进制矩阵中的最短路径

摘要：Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a 阅读全文

posted @ 2021-03-29 03:52 Grandyang 阅读(2095) 评论(0) 推荐(0) 编辑

[LeetCode] 1090. Largest Values From Labels 标签中的最大价值

摘要：We have a set of items: the i-th item has value values[i] and label labels[i]. Then, we choose a subset S of these items, such that: |S| <= num_wanted 阅读全文

posted @ 2021-03-28 14:59 Grandyang 阅读(781) 评论(0) 推荐(0) 编辑

[LeetCode] 1089. Duplicate Zeros 复写零

摘要：Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements beyond 阅读全文

posted @ 2021-03-28 12:30 Grandyang 阅读(1059) 评论(0) 推荐(0) 编辑

[LeetCode] 1088. Confusing Number II 易混淆数之二

摘要：We can rotate digits by 180 degrees to form new digits. When 0, 1, 6, 8, 9 are rotated 180 degrees, they become 0, 1, 9, 8, 6 respectively. When 2, 3, 阅读全文

posted @ 2021-03-28 12:24 Grandyang 阅读(1145) 评论(0) 推荐(1) 编辑

[LeetCode] 1057. Campus Bikes 校园自行车

摘要：On a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker and bike is a 2D coordinate on this grid. Our goal is 阅读全文

posted @ 2021-03-28 12:20 Grandyang 阅读(1026) 评论(2) 推荐(0) 编辑

[LeetCode] 1056. Confusing Number 混淆的数字

摘要：Given a number N, return true if and only if it is a confusing number, which satisfies the following condition: We can rotate digits by 180 degrees to 阅读全文

posted @ 2021-03-28 12:19 Grandyang 阅读(613) 评论(0) 推荐(0) 编辑

[LeetCode] 1055. Shortest Way to Form String 形成字符串的最短方法

摘要：From any string, we can form a subsequence of that string by deleting some number of characters (possibly no deletions). Given two strings source and 阅读全文

posted @ 2021-03-28 12:18 Grandyang 阅读(1414) 评论(0) 推荐(0) 编辑

[LeetCode] 1081. Smallest Subsequence of Distinct Characters 不同字符的最小子序列

摘要：Return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. Note: This question is the same as 阅读全文

posted @ 2021-03-28 12:07 Grandyang 阅读(675) 评论(0) 推荐(0) 编辑

[LeetCode] 1080. Insufficient Nodes in Root to Leaf Paths 根到叶路径上的不足节点

摘要：Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.) A node is insu 阅读全文

posted @ 2021-03-28 12:05 Grandyang 阅读(400) 评论(0) 推荐(0) 编辑

[LeetCode] 1079. Letter Tile Possibilities 活字印刷

摘要：You have n tiles, where each tile has one letter tiles[i] printed on it. Return the number of possible non-empty sequences of letters you can make usi 阅读全文

posted @ 2021-03-28 12:04 Grandyang 阅读(692) 评论(0) 推荐(0) 编辑

[LeetCode] 1078. Occurrences After Bigram 双元语法分词

摘要：Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, and thir 阅读全文

posted @ 2021-03-28 12:01 Grandyang 阅读(309) 评论(0) 推荐(0) 编辑

[LeetCode] 1074. Number of Submatrices That Sum to Target 元素和为目标值的子矩阵数量

摘要：Given a matrix and a target, return the number of non-empty submatrices that sum to target. A submatrix x1, y1, x2, y2 is the set of all cells matrix[ 阅读全文

posted @ 2021-03-28 11:59 Grandyang 阅读(1333) 评论(0) 推荐(0) 编辑

[LeetCode] 1073. Adding Two Negabinary Numbers 负二进制数相加

摘要：Given two numbers arr1 and arr2 in base -2, return the result of adding them together. Each number is given in array format: as an array of 0s and 1s, 阅读全文

posted @ 2021-03-28 11:57 Grandyang 阅读(521) 评论(0) 推荐(0) 编辑

[LeetCode] 1072. Flip Columns For Maximum Number of Equal Rows 按列翻转得到最大值等行数

摘要：You are given an binary matrix . You can choose any number of columns in the matrix and flip every cell in that column (i.e., Change the value of the 阅读全文

posted @ 2021-03-16 15:52 Grandyang 阅读(599) 评论(3) 推荐(0) 编辑

[LeetCode] 1071. Greatest Common Divisor of Strings 字符串的最大公因子

摘要：For two strings and , we say " divides " if and only if ( concatenated with itself 1 or more times) Given two strings str1 and str2, return the larges 阅读全文

posted @ 2021-03-15 14:08 Grandyang 阅读(1922) 评论(0) 推荐(0) 编辑

[LeetCode] 1054. Distant Barcodes 距离相等的条形码

摘要：In a warehouse, there is a row of barcodes, where the barcode is . Rearrange the barcodes so that no two adjacent barcodes are equal. You may return a 阅读全文

posted @ 2021-03-13 16:24 Grandyang 阅读(443) 评论(0) 推荐(0) 编辑

[LeetCode] 1053. Previous Permutation With One Swap 交换一次的先前全排列

摘要：Given an array of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than , that can be ma 阅读全文

posted @ 2021-03-12 14:13 Grandyang 阅读(574) 评论(0) 推荐(0) 编辑

[LeetCode] 1052. Grumpy Bookstore Owner 暴躁的书店老板

摘要：Today, the bookstore owner has a store open for minutes. Every minute, some number of customers ( ) enter the store, and all those customers leave aft 阅读全文

posted @ 2021-03-09 17:19 Grandyang 阅读(678) 评论(1) 推荐(0) 编辑

[LeetCode] 1044. Longest Duplicate Substring 最长重复子串

摘要：Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times. The occurrences may overlap. Return any 阅读全文

posted @ 2021-03-08 07:13 Grandyang 阅读(2133) 评论(1) 推荐(1) 编辑

[LeetCode] 1051. Height Checker 身高检查器

摘要：Students are asked to stand in non decreasing order of heights for an annual photo. Return the minimum number of students that must move in order for 阅读全文

posted @ 2021-03-05 13:34 Grandyang 阅读(519) 评论(0) 推荐(0) 编辑

[LeetCode] 1049. Last Stone Weight II 最后的石头重量之二

摘要：You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choo 阅读全文

posted @ 2021-03-04 15:15 Grandyang 阅读(1818) 评论(1) 推荐(1) 编辑

[LeetCode] 1048. Longest String Chain 最长字符串链

摘要：Given a list of words, each word consists of English lowercase letters. Let's say is a predecessor of if and only if we can add exactly one letter any 阅读全文

posted @ 2021-03-03 13:49 Grandyang 阅读(2132) 评论(0) 推荐(0) 编辑

[LeetCode] 1047. Remove All Adjacent Duplicates In String 移除字符串中所有相邻的重复字符

摘要：Given a string of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make du 阅读全文

posted @ 2021-03-02 11:52 Grandyang 阅读(1287) 评论(0) 推荐(0) 编辑

[LeetCode] 1046. Last Stone Weight 最后的石头重量

摘要：We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppos 阅读全文

posted @ 2021-03-01 12:31 Grandyang 阅读(1231) 评论(0) 推荐(0) 编辑

[LeetCode] 1043. Partition Array for Maximum Sum 分隔数组以得到最大和

摘要：Given an integer array , you should partition the array into (contiguous) subarrays of length at most . After partitioning, each subarray has their va 阅读全文

posted @ 2021-03-01 08:51 Grandyang 阅读(1152) 评论(1) 推荐(0) 编辑