1622-奇妙序列(Fancy Sequence) 原文链接: https://leetcode-cn.com/problems/fancy-sequence 英文原文Write an API that generates fancy sequences using the append 2021-12-03 数学线段树设计 困难
1608-特殊数组的特征值(Special Array With X Elements Greater Than or Equal X) 原文链接: https://leetcode-cn.com/problems/special-array-with-x-elements-greater-than-or-equal-x 英文原文You are given an arra 2021-12-03 二分查找排序数组 简单
1609-奇偶树(Even Odd Tree) 原文链接: https://leetcode-cn.com/problems/even-odd-tree 英文原文A binary tree is named Even-Odd if it meets the following con 2021-12-03 二叉树广度优先搜索树 中等
1611-使整数变为 0 的最少操作次数(Minimum One Bit Operations to Make Integers Zero) 原文链接: https://leetcode-cn.com/problems/minimum-one-bit-operations-to-make-integers-zero 英文原文Given an integer n, you mu 2021-12-03 位运算动态规划记忆化搜索 困难
1610-可见点的最大数目(Maximum Number of Visible Points) 原文链接: https://leetcode-cn.com/problems/maximum-number-of-visible-points 英文原文You are given an array points, an integer 2021-12-03 几何排序数学数组滑动窗口 困难
1614-括号的最大嵌套深度(Maximum Nesting Depth of the Parentheses) 原文链接: https://leetcode-cn.com/problems/maximum-nesting-depth-of-the-parentheses 英文原文A string is a valid parentheses st 2021-12-03 字符串栈 简单
1616-分割两个字符串得到回文串(Split Two Strings to Make Palindrome) 原文链接: https://leetcode-cn.com/problems/split-two-strings-to-make-palindrome 英文原文You are given two strings a and b of t 2021-12-03 双指针字符串贪心 中等
1617-统计子树中城市之间最大距离(Count Subtrees With Max Distance Between Cities) 原文链接: https://leetcode-cn.com/problems/count-subtrees-with-max-distance-between-cities 英文原文There are n cities numbered 2021-12-03 位运算动态规划枚举树状态压缩 困难
1636-按照频率将数组升序排序(Sort Array by Increasing Frequency) 原文链接: https://leetcode-cn.com/problems/sort-array-by-increasing-frequency 英文原文Given an array of integers nums, sort th 2021-12-03 哈希表排序数组 简单
1638-统计只差一个字符的子串数目(Count Substrings That Differ by One Character) 原文链接: https://leetcode-cn.com/problems/count-substrings-that-differ-by-one-character 英文原文Given two strings s and t, fi 2021-12-03 动态规划哈希表字符串 中等