1943-描述绘画结果(Describe the Painting) 原文链接: https://leetcode-cn.com/problems/describe-the-painting 英文原文There is a long and thin painting that can be represe 2021-12-03 前缀和数组 中等
1930-长度为 3 的不同回文子序列(Unique Length-3 Palindromic Subsequences) 原文链接: https://leetcode-cn.com/problems/unique-length-3-palindromic-subsequences 英文原文Given a string s, return the numbe 2021-12-03 前缀和哈希表字符串 中等
1932-合并多棵二叉搜索树(Merge BSTs to Create Single BST) 原文链接: https://leetcode-cn.com/problems/merge-bsts-to-create-single-bst 英文原文You are given n BST (binary search tree) ro 2021-12-03 二分查找二叉树哈希表树深度优先搜索 困难
1931-用三种不同颜色为网格涂色(Painting a Grid With Three Different Colors) 原文链接: https://leetcode-cn.com/problems/painting-a-grid-with-three-different-colors 英文原文You are given two integers m an 2021-12-03 动态规划 困难
1936-新增的最少台阶数(Add Minimum Number of Rungs) 原文链接: https://leetcode-cn.com/problems/add-minimum-number-of-rungs 英文原文You are given a strictly increasing integer arr 2021-12-03 中等
1937-扣分后的最大得分(Maximum Number of Points with Cost) 原文链接: https://leetcode-cn.com/problems/maximum-number-of-points-with-cost 英文原文You are given an m x n integer matrix po 2021-12-03 中等
1938-查询最大基因差(Maximum Genetic Difference Query) 原文链接: https://leetcode-cn.com/problems/maximum-genetic-difference-query 英文原文There is a rooted tree consisting of n nod 2021-12-03 困难
1945-字符串转化后的各位数字之和(Sum of Digits of String After Convert) 原文链接: https://leetcode-cn.com/problems/sum-of-digits-of-string-after-convert 英文原文You are given a string s consisting o 2021-12-03 字符串模拟 简单
1946-子字符串突变后可能得到的最大整数(Largest Number After Mutating Substring) 原文链接: https://leetcode-cn.com/problems/largest-number-after-mutating-substring 英文原文You are given a string num, which r 2021-12-03 字符串数组贪心 中等
1947-最大兼容性评分和(Maximum Compatibility Score Sum) 原文链接: https://leetcode-cn.com/problems/maximum-compatibility-score-sum 英文原文There is a survey that consists of n questi 2021-12-03 位运算动态规划回溯数组状态压缩 中等