From a3bcde808721dfcc73b3d177378411fa644b1dc7 Mon Sep 17 00:00:00 2001
From: "huangge1199@hotmail.com" <huangge1199>
Date: Fri, 30 Apr 2021 00:23:00 +0800
Subject: [PATCH] =?UTF-8?q?137:=E5=8F=AA=E5=87=BA=E7=8E=B0=E4=B8=80?=
 =?UTF-8?q?=E6=AC=A1=E7=9A=84=E6=95=B0=E5=AD=97=20II?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leetcode/editor/cn/SingleNumberIi.java    | 66 +++++++++++++++++++
 .../java/leetcode/editor/cn/SingleNumberIi.md | 32 +++++++++
 src/main/java/leetcode/editor/cn/all.json     |  2 +-
 3 files changed, 99 insertions(+), 1 deletion(-)
 create mode 100644 src/main/java/leetcode/editor/cn/SingleNumberIi.java
 create mode 100644 src/main/java/leetcode/editor/cn/SingleNumberIi.md

diff --git a/src/main/java/leetcode/editor/cn/SingleNumberIi.java b/src/main/java/leetcode/editor/cn/SingleNumberIi.java
new file mode 100644
index 0000000..b27a88d
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/SingleNumberIi.java
@@ -0,0 +1,66 @@
+//给你一个整数数组 nums ，除某个元素仅出现 一次 外，其余每个元素都恰出现 三次 。请你找出并返回那个只出现了一次的元素。 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：nums = [2,2,3,2]
+//输出：3
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：nums = [0,1,0,1,0,1,99]
+//输出：99
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= nums.length <= 3 * 104 
+// -231 <= nums[i] <= 231 - 1 
+// nums 中，除某个元素仅出现 一次 外，其余每个元素都恰出现 三次 
+// 
+//
+// 
+//
+// 进阶：你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？ 
+// Related Topics 位运算 
+// 👍 565 👎 0
+
+package leetcode.editor.cn;
+
+import lombok.val;
+
+import java.util.HashMap;
+import java.util.Map;
+
+//137:只出现一次的数字 II
+public class SingleNumberIi{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new SingleNumberIi().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public int singleNumber(int[] nums) {
+        Map<Integer,Integer> map = new HashMap<>();
+        for (int num :nums){
+            map.put(num,map.getOrDefault(num,0)+1);
+        }
+        for (int num:map.keySet()){
+            if(map.get(num)==1){
+                return num;
+            }
+        }
+        return 0;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/SingleNumberIi.md b/src/main/java/leetcode/editor/cn/SingleNumberIi.md
new file mode 100644
index 0000000..be799ba
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/SingleNumberIi.md
@@ -0,0 +1,32 @@
+<p>给你一个整数数组 <code>nums</code> ，除某个元素仅出现 <strong>一次</strong> 外，其余每个元素都恰出现 <strong>三次 。</strong>请你找出并返回那个只出现了一次的元素。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [2,2,3,2]
+<strong>输出：</strong>3
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [0,1,0,1,0,1,99]
+<strong>输出：</strong>99
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= nums.length <= 3 * 10<sup>4</sup></code></li>
+	<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
+	<li><code>nums</code> 中，除某个元素仅出现 <strong>一次</strong> 外，其余每个元素都恰出现 <strong>三次</strong></li>
+</ul>
+
+<p> </p>
+
+<p><strong>进阶：</strong>你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？</p>
+<div><div>Related Topics</div><div><li>位运算</li></div></div>\n<div><li>👍 565</li><li>👎 0</li></div>
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/all.json b/src/main/java/leetcode/editor/cn/all.json
index 144fef2..3833fdb 100644
--- a/src/main/java/leetcode/editor/cn/all.json
+++ b/src/main/java/leetcode/editor/cn/all.json
@@ -1 +1 @@
-[{"articleLive":2,"formTitle":"[403]青蛙过河","frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","title":"青蛙过河","titleSlug":"frog-jump"},{"articleLive":2,"formTitle":"[1]两数之和","frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","title":"两数之和","titleSlug":"two-sum"},{"articleLive":2,"formTitle":"[2]两数相加","frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","title":"两数相加","titleSlug":"add-two-numbers"},{"articleLive":2,"formTitle":"[3]无重复字符的最长子串","frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"articleLive":2,"formTitle":"[4]寻找两个正序数组的中位数","frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"articleLive":2,"formTitle":"[5]最长回文子串","frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"","title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"articleLive":2,"formTitle":"[6]Z 字形变换","frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"articleLive":2,"formTitle":"[7]整数反转","frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"","title":"整数反转","titleSlug":"reverse-integer"},{"articleLive":2,"formTitle":"[8]字符串转换整数 (atoi)","frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"articleLive":2,"formTitle":"[9]回文数","frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","title":"回文数","titleSlug":"palindrome-number"},{"articleLive":2,"formTitle":"[10]正则表达式匹配","frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"articleLive":2,"formTitle":"[11]盛最多水的容器","frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"","title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"articleLive":2,"formTitle":"[12]整数转罗马数字","frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"articleLive":2,"formTitle":"[13]罗马数字转整数","frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"articleLive":2,"formTitle":"[14]最长公共前缀","frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"articleLive":2,"formTitle":"[15]三数之和","frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","title":"三数之和","titleSlug":"3sum"},{"articleLive":2,"formTitle":"[16]最接近的三数之和","frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","title":"最接近的三数之和","titleSlug":"3sum-closest"},{"articleLive":2,"formTitle":"[17]电话号码的字母组合","frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"articleLive":2,"formTitle":"[18]四数之和","frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","title":"四数之和","titleSlug":"4sum"},{"articleLive":2,"formTitle":"[19]删除链表的倒数第 N 个结点","frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"articleLive":2,"formTitle":"[20]有效的括号","frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","title":"有效的括号","titleSlug":"valid-parentheses"},{"articleLive":2,"formTitle":"[21]合并两个有序链表","frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"articleLive":2,"formTitle":"[22]括号生成","frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","title":"括号生成","titleSlug":"generate-parentheses"},{"articleLive":2,"formTitle":"[23]合并K个升序链表","frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"articleLive":2,"formTitle":"[24]两两交换链表中的节点","frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"articleLive":2,"formTitle":"[25]K 个一组翻转链表","frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"articleLive":2,"formTitle":"[26]删除有序数组中的重复项","frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"articleLive":2,"formTitle":"[27]移除元素","frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","title":"移除元素","titleSlug":"remove-element"},{"articleLive":2,"formTitle":"[28]实现 strStr()","frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","title":"实现 strStr()","titleSlug":"implement-strstr"},{"articleLive":2,"formTitle":"[29]两数相除","frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","title":"两数相除","titleSlug":"divide-two-integers"},{"articleLive":2,"formTitle":"[30]串联所有单词的子串","frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"articleLive":2,"formTitle":"[31]下一个排列","frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","title":"下一个排列","titleSlug":"next-permutation"},{"articleLive":2,"formTitle":"[32]最长有效括号","frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"articleLive":2,"formTitle":"[33]搜索旋转排序数组","frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"articleLive":2,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"articleLive":2,"formTitle":"[35]搜索插入位置","frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","title":"搜索插入位置","titleSlug":"search-insert-position"},{"articleLive":2,"formTitle":"[36]有效的数独","frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","title":"有效的数独","titleSlug":"valid-sudoku"},{"articleLive":2,"formTitle":"[37]解数独","frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","title":"解数独","titleSlug":"sudoku-solver"},{"articleLive":2,"formTitle":"[38]外观数列","frontendQuestionId":"38","leaf":true,"level":1,"nodeType":"def","questionId":"38","status":"","title":"外观数列","titleSlug":"count-and-say"},{"articleLive":2,"formTitle":"[39]组合总和","frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","title":"组合总和","titleSlug":"combination-sum"},{"articleLive":2,"formTitle":"[40]组合总和 II","frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","title":"组合总和 II","titleSlug":"combination-sum-ii"},{"articleLive":2,"formTitle":"[41]缺失的第一个正数","frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"articleLive":2,"formTitle":"[42]接雨水","frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","title":"接雨水","titleSlug":"trapping-rain-water"},{"articleLive":2,"formTitle":"[43]字符串相乘","frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","title":"字符串相乘","titleSlug":"multiply-strings"},{"articleLive":2,"formTitle":"[44]通配符匹配","frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","title":"通配符匹配","titleSlug":"wildcard-matching"},{"articleLive":2,"formTitle":"[45]跳跃游戏 II","frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"","title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"articleLive":2,"formTitle":"[46]全排列","frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","title":"全排列","titleSlug":"permutations"},{"articleLive":2,"formTitle":"[47]全排列 II","frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","title":"全排列 II","titleSlug":"permutations-ii"},{"articleLive":2,"formTitle":"[48]旋转图像","frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","title":"旋转图像","titleSlug":"rotate-image"},{"articleLive":2,"formTitle":"[49]字母异位词分组","frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","title":"字母异位词分组","titleSlug":"group-anagrams"},{"articleLive":2,"formTitle":"[50]Pow(x, n)","frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","title":"Pow(x, n)","titleSlug":"powx-n"},{"articleLive":2,"formTitle":"[51]N 皇后","frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","title":"N 皇后","titleSlug":"n-queens"},{"articleLive":2,"formTitle":"[52]N皇后 II","frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","title":"N皇后 II","titleSlug":"n-queens-ii"},{"articleLive":2,"formTitle":"[53]最大子序和","frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","title":"最大子序和","titleSlug":"maximum-subarray"},{"articleLive":2,"formTitle":"[54]螺旋矩阵","frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"articleLive":2,"formTitle":"[55]跳跃游戏","frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","title":"跳跃游戏","titleSlug":"jump-game"},{"articleLive":2,"formTitle":"[56]合并区间","frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","title":"合并区间","titleSlug":"merge-intervals"},{"articleLive":2,"formTitle":"[57]插入区间","frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","title":"插入区间","titleSlug":"insert-interval"},{"articleLive":2,"formTitle":"[58]最后一个单词的长度","frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"articleLive":2,"formTitle":"[59]螺旋矩阵 II","frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"articleLive":2,"formTitle":"[60]排列序列","frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","title":"排列序列","titleSlug":"permutation-sequence"},{"articleLive":2,"formTitle":"[61]旋转链表","frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","title":"旋转链表","titleSlug":"rotate-list"},{"articleLive":2,"formTitle":"[62]不同路径","frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","title":"不同路径","titleSlug":"unique-paths"},{"articleLive":2,"formTitle":"[63]不同路径 II","frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","title":"不同路径 II","titleSlug":"unique-paths-ii"},{"articleLive":2,"formTitle":"[64]最小路径和","frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","title":"最小路径和","titleSlug":"minimum-path-sum"},{"articleLive":2,"formTitle":"[65]有效数字","frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","title":"有效数字","titleSlug":"valid-number"},{"articleLive":2,"formTitle":"[66]加一","frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","title":"加一","titleSlug":"plus-one"},{"articleLive":2,"formTitle":"[67]二进制求和","frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","title":"二进制求和","titleSlug":"add-binary"},{"articleLive":2,"formTitle":"[68]文本左右对齐","frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","title":"文本左右对齐","titleSlug":"text-justification"},{"articleLive":2,"formTitle":"[69]x 的平方根","frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","title":"x 的平方根","titleSlug":"sqrtx"},{"articleLive":2,"formTitle":"[70]爬楼梯","frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","title":"爬楼梯","titleSlug":"climbing-stairs"},{"articleLive":2,"formTitle":"[71]简化路径","frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","title":"简化路径","titleSlug":"simplify-path"},{"articleLive":2,"formTitle":"[72]编辑距离","frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","title":"编辑距离","titleSlug":"edit-distance"},{"articleLive":2,"formTitle":"[73]矩阵置零","frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"articleLive":2,"formTitle":"[74]搜索二维矩阵","frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"articleLive":2,"formTitle":"[75]颜色分类","frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","title":"颜色分类","titleSlug":"sort-colors"},{"articleLive":2,"formTitle":"[76]最小覆盖子串","frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"articleLive":2,"formTitle":"[77]组合","frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","title":"组合","titleSlug":"combinations"},{"articleLive":2,"formTitle":"[78]子集","frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","title":"子集","titleSlug":"subsets"},{"articleLive":2,"formTitle":"[79]单词搜索","frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","title":"单词搜索","titleSlug":"word-search"},{"articleLive":2,"formTitle":"[80]删除有序数组中的重复项 II","frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"articleLive":2,"formTitle":"[81]搜索旋转排序数组 II","frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"articleLive":2,"formTitle":"[82]删除排序链表中的重复元素 II","frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"articleLive":2,"formTitle":"[83]删除排序链表中的重复元素","frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"articleLive":2,"formTitle":"[84]柱状图中最大的矩形","frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"articleLive":2,"formTitle":"[85]最大矩形","frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","title":"最大矩形","titleSlug":"maximal-rectangle"},{"articleLive":2,"formTitle":"[86]分隔链表","frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","title":"分隔链表","titleSlug":"partition-list"},{"articleLive":2,"formTitle":"[87]扰乱字符串","frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","title":"扰乱字符串","titleSlug":"scramble-string"},{"articleLive":2,"formTitle":"[88]合并两个有序数组","frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"notac","title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"articleLive":2,"formTitle":"[89]格雷编码","frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","title":"格雷编码","titleSlug":"gray-code"},{"articleLive":2,"formTitle":"[90]子集 II","frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","title":"子集 II","titleSlug":"subsets-ii"},{"articleLive":2,"formTitle":"[91]解码方法","frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","title":"解码方法","titleSlug":"decode-ways"},{"articleLive":2,"formTitle":"[92]反转链表 II","frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"articleLive":2,"formTitle":"[93]复原 IP 地址","frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"articleLive":2,"formTitle":"[94]二叉树的中序遍历","frontendQuestionId":"94","leaf":true,"level":2,"nodeType":"def","questionId":"94","status":"ac","title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"articleLive":2,"formTitle":"[95]不同的二叉搜索树 II","frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"articleLive":2,"formTitle":"[96]不同的二叉搜索树","frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"articleLive":2,"formTitle":"[97]交错字符串","frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","title":"交错字符串","titleSlug":"interleaving-string"},{"articleLive":2,"formTitle":"[98]验证二叉搜索树","frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"articleLive":2,"formTitle":"[99]恢复二叉搜索树","frontendQuestionId":"99","leaf":true,"level":3,"nodeType":"def","questionId":"99","status":"","title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"articleLive":2,"formTitle":"[100]相同的树","frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","title":"相同的树","titleSlug":"same-tree"},{"articleLive":2,"formTitle":"[101]对称二叉树","frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","title":"对称二叉树","titleSlug":"symmetric-tree"},{"articleLive":2,"formTitle":"[102]二叉树的层序遍历","frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"articleLive":2,"formTitle":"[103]二叉树的锯齿形层序遍历","frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"articleLive":2,"formTitle":"[104]二叉树的最大深度","frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"articleLive":2,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"articleLive":2,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"articleLive":2,"formTitle":"[107]二叉树的层序遍历 II","frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"articleLive":2,"formTitle":"[108]将有序数组转换为二叉搜索树","frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"articleLive":2,"formTitle":"[109]有序链表转换二叉搜索树","frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"articleLive":2,"formTitle":"[110]平衡二叉树","frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"articleLive":2,"formTitle":"[111]二叉树的最小深度","frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"articleLive":2,"formTitle":"[112]路径总和","frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","title":"路径总和","titleSlug":"path-sum"},{"articleLive":2,"formTitle":"[113]路径总和 II","frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","title":"路径总和 II","titleSlug":"path-sum-ii"},{"articleLive":2,"formTitle":"[114]二叉树展开为链表","frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"articleLive":2,"formTitle":"[115]不同的子序列","frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","title":"不同的子序列","titleSlug":"distinct-subsequences"},{"articleLive":2,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"articleLive":2,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"","title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"articleLive":2,"formTitle":"[118]杨辉三角","frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","title":"杨辉三角","titleSlug":"pascals-triangle"},{"articleLive":2,"formTitle":"[119]杨辉三角 II","frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"articleLive":2,"formTitle":"[120]三角形最小路径和","frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","title":"三角形最小路径和","titleSlug":"triangle"},{"articleLive":2,"formTitle":"[121]买卖股票的最佳时机","frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"articleLive":2,"formTitle":"[122]买卖股票的最佳时机 II","frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"articleLive":2,"formTitle":"[123]买卖股票的最佳时机 III","frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"articleLive":2,"formTitle":"[124]二叉树中的最大路径和","frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"articleLive":2,"formTitle":"[125]验证回文串","frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","title":"验证回文串","titleSlug":"valid-palindrome"},{"articleLive":2,"formTitle":"[126]单词接龙 II","frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"articleLive":2,"formTitle":"[127]单词接龙","frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","title":"单词接龙","titleSlug":"word-ladder"},{"articleLive":2,"formTitle":"[128]最长连续序列","frontendQuestionId":"128","leaf":true,"level":3,"nodeType":"def","questionId":"128","status":"","title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"articleLive":2,"formTitle":"[129]求根节点到叶节点数字之和","frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"articleLive":2,"formTitle":"[130]被围绕的区域","frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","title":"被围绕的区域","titleSlug":"surrounded-regions"},{"articleLive":2,"formTitle":"[131]分割回文串","frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","title":"分割回文串","titleSlug":"palindrome-partitioning"},{"articleLive":2,"formTitle":"[132]分割回文串 II","frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"articleLive":2,"formTitle":"[133]克隆图","frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","title":"克隆图","titleSlug":"clone-graph"},{"articleLive":2,"formTitle":"[134]加油站","frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","title":"加油站","titleSlug":"gas-station"},{"articleLive":2,"formTitle":"[135]分发糖果","frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","title":"分发糖果","titleSlug":"candy"},{"articleLive":2,"formTitle":"[136]只出现一次的数字","frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","title":"只出现一次的数字","titleSlug":"single-number"},{"articleLive":2,"formTitle":"[137]只出现一次的数字 II","frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"articleLive":2,"formTitle":"[138]复制带随机指针的链表","frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"articleLive":2,"formTitle":"[139]单词拆分","frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","title":"单词拆分","titleSlug":"word-break"},{"articleLive":2,"formTitle":"[140]单词拆分 II","frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","title":"单词拆分 II","titleSlug":"word-break-ii"},{"articleLive":2,"formTitle":"[141]环形链表","frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","title":"环形链表","titleSlug":"linked-list-cycle"},{"articleLive":2,"formTitle":"[142]环形链表 II","frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"articleLive":2,"formTitle":"[143]重排链表","frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","title":"重排链表","titleSlug":"reorder-list"},{"articleLive":2,"formTitle":"[144]二叉树的前序遍历","frontendQuestionId":"144","leaf":true,"level":2,"nodeType":"def","questionId":"144","status":"ac","title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"articleLive":2,"formTitle":"[145]二叉树的后序遍历","frontendQuestionId":"145","leaf":true,"level":2,"nodeType":"def","questionId":"145","status":"ac","title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"articleLive":2,"formTitle":"[146]LRU 缓存机制","frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","title":"LRU 缓存机制","titleSlug":"lru-cache"},{"articleLive":2,"formTitle":"[147]对链表进行插入排序","frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"articleLive":2,"formTitle":"[148]排序链表","frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","title":"排序链表","titleSlug":"sort-list"},{"articleLive":2,"formTitle":"[149]直线上最多的点数","frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"articleLive":2,"formTitle":"[150]逆波兰表达式求值","frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"articleLive":2,"formTitle":"[151]翻转字符串里的单词","frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"articleLive":2,"formTitle":"[152]乘积最大子数组","frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"articleLive":2,"formTitle":"[153]寻找旋转排序数组中的最小值","frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"articleLive":2,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"articleLive":2,"formTitle":"[155]最小栈","frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","title":"最小栈","titleSlug":"min-stack"},{"articleLive":2,"formTitle":"[156]上下翻转二叉树","frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"articleLive":2,"formTitle":"[157]用 Read4 读取 N 个字符","frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"articleLive":2,"formTitle":"[158]用 Read4 读取 N 个字符 II","frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"articleLive":2,"formTitle":"[159]至多包含两个不同字符的最长子串","frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"articleLive":2,"formTitle":"[160]相交链表","frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"articleLive":2,"formTitle":"[161]相隔为 1 的编辑距离","frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"articleLive":2,"formTitle":"[162]寻找峰值","frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","title":"寻找峰值","titleSlug":"find-peak-element"},{"articleLive":2,"formTitle":"[163]缺失的区间","frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","title":"缺失的区间","titleSlug":"missing-ranges"},{"articleLive":2,"formTitle":"[164]最大间距","frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","title":"最大间距","titleSlug":"maximum-gap"},{"articleLive":2,"formTitle":"[165]比较版本号","frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","title":"比较版本号","titleSlug":"compare-version-numbers"},{"articleLive":2,"formTitle":"[166]分数到小数","frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"articleLive":2,"formTitle":"[167]两数之和 II - 输入有序数组","frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"","title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"articleLive":2,"formTitle":"[168]Excel表列名称","frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"articleLive":2,"formTitle":"[169]多数元素","frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","title":"多数元素","titleSlug":"majority-element"},{"articleLive":2,"formTitle":"[170]两数之和 III - 数据结构设计","frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"articleLive":2,"formTitle":"[171]Excel表列序号","frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","title":"Excel表列序号","titleSlug":"excel-sheet-column-number"},{"articleLive":2,"formTitle":"[172]阶乘后的零","frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"articleLive":2,"formTitle":"[173]二叉搜索树迭代器","frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"articleLive":2,"formTitle":"[174]地下城游戏","frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","title":"地下城游戏","titleSlug":"dungeon-game"},{"articleLive":2,"formTitle":"[175]组合两个表","frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","title":"组合两个表","titleSlug":"combine-two-tables"},{"articleLive":2,"formTitle":"[176]第二高的薪水","frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","title":"第二高的薪水","titleSlug":"second-highest-salary"},{"articleLive":2,"formTitle":"[177]第N高的薪水","frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"articleLive":2,"formTitle":"[178]分数排名","frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","title":"分数排名","titleSlug":"rank-scores"},{"articleLive":2,"formTitle":"[179]最大数","frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","title":"最大数","titleSlug":"largest-number"},{"articleLive":2,"formTitle":"[180]连续出现的数字","frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"articleLive":2,"formTitle":"[181]超过经理收入的员工","frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"articleLive":2,"formTitle":"[182]查找重复的电子邮箱","frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"articleLive":2,"formTitle":"[183]从不订购的客户","frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"articleLive":2,"formTitle":"[184]部门工资最高的员工","frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"articleLive":2,"formTitle":"[185]部门工资前三高的所有员工","frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"articleLive":2,"formTitle":"[186]翻转字符串里的单词 II","frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"articleLive":2,"formTitle":"[187]重复的DNA序列","frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"articleLive":2,"formTitle":"[188]买卖股票的最佳时机 IV","frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"articleLive":2,"formTitle":"[189]旋转数组","frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","title":"旋转数组","titleSlug":"rotate-array"},{"articleLive":2,"formTitle":"[190]颠倒二进制位","frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","title":"颠倒二进制位","titleSlug":"reverse-bits"},{"articleLive":2,"formTitle":"[191]位1的个数","frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","title":"位1的个数","titleSlug":"number-of-1-bits"},{"articleLive":2,"formTitle":"[192]统计词频","frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","title":"统计词频","titleSlug":"word-frequency"},{"articleLive":2,"formTitle":"[193]有效电话号码","frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"articleLive":2,"formTitle":"[194]转置文件","frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","title":"转置文件","titleSlug":"transpose-file"},{"articleLive":2,"formTitle":"[195]第十行","frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","title":"第十行","titleSlug":"tenth-line"},{"articleLive":2,"formTitle":"[196]删除重复的电子邮箱","frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"articleLive":2,"formTitle":"[197]上升的温度","frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","title":"上升的温度","titleSlug":"rising-temperature"},{"articleLive":2,"formTitle":"[198]打家劫舍","frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","title":"打家劫舍","titleSlug":"house-robber"},{"articleLive":2,"formTitle":"[199]二叉树的右视图","frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"articleLive":2,"formTitle":"[200]岛屿数量","frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","title":"岛屿数量","titleSlug":"number-of-islands"},{"articleLive":2,"formTitle":"[201]数字范围按位与","frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"articleLive":2,"formTitle":"[202]快乐数","frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","title":"快乐数","titleSlug":"happy-number"},{"articleLive":2,"formTitle":"[203]移除链表元素","frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"articleLive":2,"formTitle":"[204]计数质数","frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","title":"计数质数","titleSlug":"count-primes"},{"articleLive":2,"formTitle":"[205]同构字符串","frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","title":"同构字符串","titleSlug":"isomorphic-strings"},{"articleLive":2,"formTitle":"[206]反转链表","frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","title":"反转链表","titleSlug":"reverse-linked-list"},{"articleLive":2,"formTitle":"[207]课程表","frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","title":"课程表","titleSlug":"course-schedule"},{"articleLive":2,"formTitle":"[208]实现 Trie (前缀树)","frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"articleLive":2,"formTitle":"[209]长度最小的子数组","frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"","title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"articleLive":2,"formTitle":"[210]课程表 II","frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","title":"课程表 II","titleSlug":"course-schedule-ii"},{"articleLive":2,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"articleLive":2,"formTitle":"[212]单词搜索 II","frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","title":"单词搜索 II","titleSlug":"word-search-ii"},{"articleLive":2,"formTitle":"[213]打家劫舍 II","frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"articleLive":2,"formTitle":"[214]最短回文串","frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","title":"最短回文串","titleSlug":"shortest-palindrome"},{"articleLive":2,"formTitle":"[215]数组中的第K个最大元素","frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"articleLive":2,"formTitle":"[216]组合总和 III","frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","title":"组合总和 III","titleSlug":"combination-sum-iii"},{"articleLive":2,"formTitle":"[217]存在重复元素","frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","title":"存在重复元素","titleSlug":"contains-duplicate"},{"articleLive":2,"formTitle":"[218]天际线问题","frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","title":"天际线问题","titleSlug":"the-skyline-problem"},{"articleLive":2,"formTitle":"[219]存在重复元素 II","frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"articleLive":2,"formTitle":"[220]存在重复元素 III","frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"articleLive":2,"formTitle":"[221]最大正方形","frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","title":"最大正方形","titleSlug":"maximal-square"},{"articleLive":2,"formTitle":"[222]完全二叉树的节点个数","frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"articleLive":2,"formTitle":"[223]矩形面积","frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","title":"矩形面积","titleSlug":"rectangle-area"},{"articleLive":2,"formTitle":"[224]基本计算器","frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","title":"基本计算器","titleSlug":"basic-calculator"},{"articleLive":2,"formTitle":"[225]用队列实现栈","frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"articleLive":2,"formTitle":"[226]翻转二叉树","frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"articleLive":2,"formTitle":"[227]基本计算器 II","frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"articleLive":2,"formTitle":"[228]汇总区间","frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","title":"汇总区间","titleSlug":"summary-ranges"},{"articleLive":2,"formTitle":"[229]求众数 II","frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","title":"求众数 II","titleSlug":"majority-element-ii"},{"articleLive":2,"formTitle":"[230]二叉搜索树中第K小的元素","frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"articleLive":2,"formTitle":"[231]2的幂","frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","title":"2的幂","titleSlug":"power-of-two"},{"articleLive":2,"formTitle":"[232]用栈实现队列","frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"articleLive":2,"formTitle":"[233]数字 1 的个数","frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"articleLive":2,"formTitle":"[234]回文链表","frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","title":"回文链表","titleSlug":"palindrome-linked-list"},{"articleLive":2,"formTitle":"[235]二叉搜索树的最近公共祖先","frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"articleLive":2,"formTitle":"[236]二叉树的最近公共祖先","frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"articleLive":2,"formTitle":"[237]删除链表中的节点","frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"articleLive":2,"formTitle":"[238]除自身以外数组的乘积","frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"articleLive":2,"formTitle":"[239]滑动窗口最大值","frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"articleLive":2,"formTitle":"[240]搜索二维矩阵 II","frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"articleLive":2,"formTitle":"[241]为运算表达式设计优先级","frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"articleLive":2,"formTitle":"[242]有效的字母异位词","frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","title":"有效的字母异位词","titleSlug":"valid-anagram"},{"articleLive":2,"formTitle":"[243]最短单词距离","frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","title":"最短单词距离","titleSlug":"shortest-word-distance"},{"articleLive":2,"formTitle":"[244]最短单词距离 II","frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"articleLive":2,"formTitle":"[245]最短单词距离 III","frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"articleLive":2,"formTitle":"[246]中心对称数","frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","title":"中心对称数","titleSlug":"strobogrammatic-number"},{"articleLive":2,"formTitle":"[247]中心对称数 II","frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"articleLive":2,"formTitle":"[248]中心对称数 III","frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"articleLive":2,"formTitle":"[249]移位字符串分组","frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"articleLive":2,"formTitle":"[250]统计同值子树","frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"articleLive":2,"formTitle":"[251]展开二维向量","frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"articleLive":2,"formTitle":"[252]会议室","frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","title":"会议室","titleSlug":"meeting-rooms"},{"articleLive":2,"formTitle":"[253]会议室 II","frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"articleLive":2,"formTitle":"[254]因子的组合","frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","title":"因子的组合","titleSlug":"factor-combinations"},{"articleLive":2,"formTitle":"[255]验证前序遍历序列二叉搜索树","frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"articleLive":2,"formTitle":"[256]粉刷房子","frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","title":"粉刷房子","titleSlug":"paint-house"},{"articleLive":2,"formTitle":"[257]二叉树的所有路径","frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"articleLive":2,"formTitle":"[258]各位相加","frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","title":"各位相加","titleSlug":"add-digits"},{"articleLive":2,"formTitle":"[259]较小的三数之和","frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","title":"较小的三数之和","titleSlug":"3sum-smaller"},{"articleLive":2,"formTitle":"[260]只出现一次的数字 III","frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"articleLive":2,"formTitle":"[261]以图判树","frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","title":"以图判树","titleSlug":"graph-valid-tree"},{"articleLive":2,"formTitle":"[262]行程和用户","frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","title":"行程和用户","titleSlug":"trips-and-users"},{"articleLive":2,"formTitle":"[263]丑数","frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","title":"丑数","titleSlug":"ugly-number"},{"articleLive":2,"formTitle":"[264]丑数 II","frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","title":"丑数 II","titleSlug":"ugly-number-ii"},{"articleLive":2,"formTitle":"[265]粉刷房子 II","frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"articleLive":2,"formTitle":"[266]回文排列","frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","title":"回文排列","titleSlug":"palindrome-permutation"},{"articleLive":2,"formTitle":"[267]回文排列 II","frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"articleLive":2,"formTitle":"[268]丢失的数字","frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","title":"丢失的数字","titleSlug":"missing-number"},{"articleLive":2,"formTitle":"[269]火星词典","frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","title":"火星词典","titleSlug":"alien-dictionary"},{"articleLive":2,"formTitle":"[270]最接近的二叉搜索树值","frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"articleLive":2,"formTitle":"[271]字符串的编码与解码","frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"articleLive":2,"formTitle":"[272]最接近的二叉搜索树值 II","frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"articleLive":2,"formTitle":"[273]整数转换英文表示","frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"articleLive":2,"formTitle":"[274]H 指数","frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","title":"H 指数","titleSlug":"h-index"},{"articleLive":2,"formTitle":"[275]H 指数 II","frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","title":"H 指数 II","titleSlug":"h-index-ii"},{"articleLive":2,"formTitle":"[276]栅栏涂色","frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","title":"栅栏涂色","titleSlug":"paint-fence"},{"articleLive":2,"formTitle":"[277]搜寻名人","frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","title":"搜寻名人","titleSlug":"find-the-celebrity"},{"articleLive":2,"formTitle":"[278]第一个错误的版本","frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","title":"第一个错误的版本","titleSlug":"first-bad-version"},{"articleLive":2,"formTitle":"[279]完全平方数","frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","title":"完全平方数","titleSlug":"perfect-squares"},{"articleLive":2,"formTitle":"[280]摆动排序","frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","title":"摆动排序","titleSlug":"wiggle-sort"},{"articleLive":2,"formTitle":"[281]锯齿迭代器","frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"articleLive":2,"formTitle":"[282]给表达式添加运算符","frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"articleLive":2,"formTitle":"[283]移动零","frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","title":"移动零","titleSlug":"move-zeroes"},{"articleLive":2,"formTitle":"[284]顶端迭代器","frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","title":"顶端迭代器","titleSlug":"peeking-iterator"},{"articleLive":2,"formTitle":"[285]二叉搜索树中的中序后继","frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"articleLive":2,"formTitle":"[286]墙与门","frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","title":"墙与门","titleSlug":"walls-and-gates"},{"articleLive":2,"formTitle":"[287]寻找重复数","frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"articleLive":2,"formTitle":"[288]单词的唯一缩写","frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"articleLive":2,"formTitle":"[289]生命游戏","frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","title":"生命游戏","titleSlug":"game-of-life"},{"articleLive":2,"formTitle":"[290]单词规律","frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","title":"单词规律","titleSlug":"word-pattern"},{"articleLive":2,"formTitle":"[291]单词规律 II","frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","title":"单词规律 II","titleSlug":"word-pattern-ii"},{"articleLive":2,"formTitle":"[292]Nim 游戏","frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","title":"Nim 游戏","titleSlug":"nim-game"},{"articleLive":2,"formTitle":"[293]翻转游戏","frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","title":"翻转游戏","titleSlug":"flip-game"},{"articleLive":2,"formTitle":"[294]翻转游戏 II","frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"articleLive":2,"formTitle":"[295]数据流的中位数","frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"articleLive":2,"formTitle":"[296]最佳的碰头地点","frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"articleLive":2,"formTitle":"[297]二叉树的序列化与反序列化","frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"articleLive":2,"formTitle":"[298]二叉树最长连续序列","frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"articleLive":2,"formTitle":"[299]猜数字游戏","frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"articleLive":2,"formTitle":"[300]最长递增子序列","frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"articleLive":2,"formTitle":"[301]删除无效的括号","frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"articleLive":2,"formTitle":"[302]包含全部黑色像素的最小矩形","frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"articleLive":2,"formTitle":"[303]区域和检索 - 数组不可变","frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"articleLive":2,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"articleLive":2,"formTitle":"[305]岛屿数量 II","frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"articleLive":2,"formTitle":"[306]累加数","frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","title":"累加数","titleSlug":"additive-number"},{"articleLive":2,"formTitle":"[307]区域和检索 - 数组可修改","frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"articleLive":2,"formTitle":"[308]二维区域和检索 - 可变","frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"articleLive":2,"formTitle":"[309]最佳买卖股票时机含冷冻期","frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"articleLive":2,"formTitle":"[310]最小高度树","frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","title":"最小高度树","titleSlug":"minimum-height-trees"},{"articleLive":2,"formTitle":"[311]稀疏矩阵的乘法","frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"articleLive":2,"formTitle":"[312]戳气球","frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","title":"戳气球","titleSlug":"burst-balloons"},{"articleLive":2,"formTitle":"[313]超级丑数","frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","title":"超级丑数","titleSlug":"super-ugly-number"},{"articleLive":2,"formTitle":"[314]二叉树的垂直遍历","frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"articleLive":2,"formTitle":"[315]计算右侧小于当前元素的个数","frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"articleLive":2,"formTitle":"[316]去除重复字母","frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"articleLive":2,"formTitle":"[317]离建筑物最近的距离","frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"articleLive":2,"formTitle":"[318]最大单词长度乘积","frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"articleLive":2,"formTitle":"[319]灯泡开关","frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","title":"灯泡开关","titleSlug":"bulb-switcher"},{"articleLive":2,"formTitle":"[320]列举单词的全部缩写","frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"articleLive":2,"formTitle":"[321]拼接最大数","frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","title":"拼接最大数","titleSlug":"create-maximum-number"},{"articleLive":2,"formTitle":"[322]零钱兑换","frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","title":"零钱兑换","titleSlug":"coin-change"},{"articleLive":2,"formTitle":"[323]无向图中连通分量的数目","frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"articleLive":2,"formTitle":"[324]摆动排序 II","frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"articleLive":2,"formTitle":"[325]和等于 k 的最长子数组长度","frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"articleLive":2,"formTitle":"[326]3的幂","frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","title":"3的幂","titleSlug":"power-of-three"},{"articleLive":2,"formTitle":"[327]区间和的个数","frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","title":"区间和的个数","titleSlug":"count-of-range-sum"},{"articleLive":2,"formTitle":"[328]奇偶链表","frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"articleLive":2,"formTitle":"[329]矩阵中的最长递增路径","frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"articleLive":2,"formTitle":"[330]按要求补齐数组","frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","title":"按要求补齐数组","titleSlug":"patching-array"},{"articleLive":2,"formTitle":"[331]验证二叉树的前序序列化","frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"articleLive":2,"formTitle":"[332]重新安排行程","frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"articleLive":2,"formTitle":"[333]最大 BST 子树","frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"articleLive":2,"formTitle":"[334]递增的三元子序列","frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"articleLive":2,"formTitle":"[335]路径交叉","frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","title":"路径交叉","titleSlug":"self-crossing"},{"articleLive":2,"formTitle":"[336]回文对","frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","title":"回文对","titleSlug":"palindrome-pairs"},{"articleLive":2,"formTitle":"[337]打家劫舍 III","frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"articleLive":2,"formTitle":"[338]比特位计数","frontendQuestionId":"338","leaf":true,"level":2,"nodeType":"def","questionId":"338","status":"","title":"比特位计数","titleSlug":"counting-bits"},{"articleLive":2,"formTitle":"[339]嵌套列表权重和","frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"articleLive":2,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"articleLive":2,"formTitle":"[341]扁平化嵌套列表迭代器","frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"articleLive":2,"formTitle":"[342]4的幂","frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","title":"4的幂","titleSlug":"power-of-four"},{"articleLive":2,"formTitle":"[343]整数拆分","frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","title":"整数拆分","titleSlug":"integer-break"},{"articleLive":2,"formTitle":"[344]反转字符串","frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","title":"反转字符串","titleSlug":"reverse-string"},{"articleLive":2,"formTitle":"[345]反转字符串中的元音字母","frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"","title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"articleLive":2,"formTitle":"[346]数据流中的移动平均值","frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"articleLive":2,"formTitle":"[347]前 K 个高频元素","frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"articleLive":2,"formTitle":"[348]设计井字棋","frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"articleLive":2,"formTitle":"[349]两个数组的交集","frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"","title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"articleLive":2,"formTitle":"[350]两个数组的交集 II","frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"","title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"articleLive":2,"formTitle":"[351]安卓系统手势解锁","frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"articleLive":2,"formTitle":"[352]将数据流变为多个不相交区间","frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"articleLive":2,"formTitle":"[353]贪吃蛇","frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","title":"贪吃蛇","titleSlug":"design-snake-game"},{"articleLive":2,"formTitle":"[354]俄罗斯套娃信封问题","frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"articleLive":2,"formTitle":"[355]设计推特","frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","title":"设计推特","titleSlug":"design-twitter"},{"articleLive":2,"formTitle":"[356]直线镜像","frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","title":"直线镜像","titleSlug":"line-reflection"},{"articleLive":2,"formTitle":"[357]计算各个位数不同的数字个数","frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"articleLive":2,"formTitle":"[358]K 距离间隔重排字符串","frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"articleLive":2,"formTitle":"[359]日志速率限制器","frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"articleLive":2,"formTitle":"[360]有序转化数组","frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","title":"有序转化数组","titleSlug":"sort-transformed-array"},{"articleLive":2,"formTitle":"[361]轰炸敌人","frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","title":"轰炸敌人","titleSlug":"bomb-enemy"},{"articleLive":2,"formTitle":"[362]敲击计数器","frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","title":"敲击计数器","titleSlug":"design-hit-counter"},{"articleLive":2,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"articleLive":2,"formTitle":"[364]加权嵌套序列和 II","frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"articleLive":2,"formTitle":"[365]水壶问题","frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","title":"水壶问题","titleSlug":"water-and-jug-problem"},{"articleLive":2,"formTitle":"[366]寻找二叉树的叶子节点","frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"articleLive":2,"formTitle":"[367]有效的完全平方数","frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"articleLive":2,"formTitle":"[368]最大整除子集","frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"articleLive":2,"formTitle":"[369]给单链表加一","frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"articleLive":2,"formTitle":"[370]区间加法","frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","title":"区间加法","titleSlug":"range-addition"},{"articleLive":2,"formTitle":"[371]两整数之和","frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"","title":"两整数之和","titleSlug":"sum-of-two-integers"},{"articleLive":2,"formTitle":"[372]超级次方","frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","title":"超级次方","titleSlug":"super-pow"},{"articleLive":2,"formTitle":"[373]查找和最小的K对数字","frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"articleLive":2,"formTitle":"[374]猜数字大小","frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"articleLive":2,"formTitle":"[375]猜数字大小 II","frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"articleLive":2,"formTitle":"[376]摆动序列","frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","title":"摆动序列","titleSlug":"wiggle-subsequence"},{"articleLive":2,"formTitle":"[377]组合总和 Ⅳ","frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"articleLive":2,"formTitle":"[378]有序矩阵中第 K 小的元素","frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"articleLive":2,"formTitle":"[379]电话目录管理系统","frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"articleLive":2,"formTitle":"[380]常数时间插入、删除和获取随机元素","frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","title":"常数时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"articleLive":2,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"articleLive":2,"formTitle":"[382]链表随机节点","frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","title":"链表随机节点","titleSlug":"linked-list-random-node"},{"articleLive":2,"formTitle":"[383]赎金信","frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","title":"赎金信","titleSlug":"ransom-note"},{"articleLive":2,"formTitle":"[384]打乱数组","frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","title":"打乱数组","titleSlug":"shuffle-an-array"},{"articleLive":2,"formTitle":"[385]迷你语法分析器","frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","title":"迷你语法分析器","titleSlug":"mini-parser"},{"articleLive":2,"formTitle":"[386]字典序排数","frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","title":"字典序排数","titleSlug":"lexicographical-numbers"},{"articleLive":2,"formTitle":"[387]字符串中的第一个唯一字符","frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"articleLive":2,"formTitle":"[388]文件的最长绝对路径","frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"articleLive":2,"formTitle":"[389]找不同","frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","title":"找不同","titleSlug":"find-the-difference"},{"articleLive":2,"formTitle":"[390]消除游戏","frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","title":"消除游戏","titleSlug":"elimination-game"},{"articleLive":2,"formTitle":"[391]完美矩形","frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","title":"完美矩形","titleSlug":"perfect-rectangle"},{"articleLive":2,"formTitle":"[392]判断子序列","frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","title":"判断子序列","titleSlug":"is-subsequence"},{"articleLive":2,"formTitle":"[393]UTF-8 编码验证","frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"articleLive":2,"formTitle":"[394]字符串解码","frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","title":"字符串解码","titleSlug":"decode-string"},{"articleLive":2,"formTitle":"[395]至少有 K 个重复字符的最长子串","frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"articleLive":2,"formTitle":"[396]旋转函数","frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","title":"旋转函数","titleSlug":"rotate-function"},{"articleLive":2,"formTitle":"[397]整数替换","frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","title":"整数替换","titleSlug":"integer-replacement"},{"articleLive":2,"formTitle":"[398]随机数索引","frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","title":"随机数索引","titleSlug":"random-pick-index"},{"articleLive":2,"formTitle":"[399]除法求值","frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","title":"除法求值","titleSlug":"evaluate-division"},{"articleLive":2,"formTitle":"[400]第 N 位数字","frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","title":"第 N 位数字","titleSlug":"nth-digit"},{"articleLive":2,"formTitle":"[401]二进制手表","frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","title":"二进制手表","titleSlug":"binary-watch"},{"articleLive":2,"formTitle":"[402]移掉K位数字","frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","title":"移掉K位数字","titleSlug":"remove-k-digits"},{"articleLive":2,"formTitle":"[404]左叶子之和","frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"articleLive":2,"formTitle":"[405]数字转换为十六进制数","frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"articleLive":2,"formTitle":"[406]根据身高重建队列","frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"articleLive":2,"formTitle":"[407]接雨水 II","frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"articleLive":2,"formTitle":"[408]有效单词缩写","frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"articleLive":2,"formTitle":"[409]最长回文串","frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","title":"最长回文串","titleSlug":"longest-palindrome"},{"articleLive":2,"formTitle":"[410]分割数组的最大值","frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"articleLive":2,"formTitle":"[411]最短独占单词缩写","frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"articleLive":2,"formTitle":"[412]Fizz Buzz","frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"articleLive":2,"formTitle":"[413]等差数列划分","frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","title":"等差数列划分","titleSlug":"arithmetic-slices"},{"articleLive":2,"formTitle":"[414]第三大的数","frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","title":"第三大的数","titleSlug":"third-maximum-number"},{"articleLive":2,"formTitle":"[415]字符串相加","frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","title":"字符串相加","titleSlug":"add-strings"},{"articleLive":2,"formTitle":"[416]分割等和子集","frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"articleLive":2,"formTitle":"[417]太平洋大西洋水流问题","frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"articleLive":2,"formTitle":"[418]屏幕可显示句子的数量","frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"articleLive":2,"formTitle":"[419]甲板上的战舰","frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"articleLive":2,"formTitle":"[420]强密码检验器","frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","title":"强密码检验器","titleSlug":"strong-password-checker"},{"articleLive":2,"formTitle":"[421]数组中两个数的最大异或值","frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"","title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"articleLive":2,"formTitle":"[422]有效的单词方块","frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","title":"有效的单词方块","titleSlug":"valid-word-square"},{"articleLive":2,"formTitle":"[423]从英文中重建数字","frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"articleLive":2,"formTitle":"[424]替换后的最长重复字符","frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"articleLive":2,"formTitle":"[425]单词方块","frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","title":"单词方块","titleSlug":"word-squares"},{"articleLive":2,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"articleLive":2,"formTitle":"[427]建立四叉树","frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","title":"建立四叉树","titleSlug":"construct-quad-tree"},{"articleLive":2,"formTitle":"[428]序列化和反序列化 N 叉树","frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"articleLive":2,"formTitle":"[429]N 叉树的层序遍历","frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"","title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"articleLive":2,"formTitle":"[430]扁平化多级双向链表","frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"articleLive":2,"formTitle":"[431]将 N 叉树编码为二叉树","frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"articleLive":2,"formTitle":"[432]全 O(1) 的数据结构","frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"articleLive":2,"formTitle":"[433]最小基因变化","frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"articleLive":2,"formTitle":"[434]字符串中的单词数","frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"articleLive":2,"formTitle":"[435]无重叠区间","frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"articleLive":2,"formTitle":"[436]寻找右区间","frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","title":"寻找右区间","titleSlug":"find-right-interval"},{"articleLive":2,"formTitle":"[437]路径总和 III","frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","title":"路径总和 III","titleSlug":"path-sum-iii"},{"articleLive":2,"formTitle":"[438]找到字符串中所有字母异位词","frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"","title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"articleLive":2,"formTitle":"[439]三元表达式解析器","frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"articleLive":2,"formTitle":"[440]字典序的第K小数字","frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"articleLive":2,"formTitle":"[441]排列硬币","frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","title":"排列硬币","titleSlug":"arranging-coins"},{"articleLive":2,"formTitle":"[442]数组中重复的数据","frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"articleLive":2,"formTitle":"[443]压缩字符串","frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","title":"压缩字符串","titleSlug":"string-compression"},{"articleLive":2,"formTitle":"[444]序列重建","frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","title":"序列重建","titleSlug":"sequence-reconstruction"},{"articleLive":2,"formTitle":"[445]两数相加 II","frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"articleLive":2,"formTitle":"[446]等差数列划分 II - 子序列","frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"articleLive":2,"formTitle":"[447]回旋镖的数量","frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"articleLive":2,"formTitle":"[448]找到所有数组中消失的数字","frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"articleLive":2,"formTitle":"[449]序列化和反序列化二叉搜索树","frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"articleLive":2,"formTitle":"[450]删除二叉搜索树中的节点","frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"articleLive":2,"formTitle":"[451]根据字符出现频率排序","frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"","title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"articleLive":2,"formTitle":"[452]用最少数量的箭引爆气球","frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"articleLive":2,"formTitle":"[453]最小操作次数使数组元素相等","frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"articleLive":2,"formTitle":"[454]四数相加 II","frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","title":"四数相加 II","titleSlug":"4sum-ii"},{"articleLive":2,"formTitle":"[455]分发饼干","frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","title":"分发饼干","titleSlug":"assign-cookies"},{"articleLive":2,"formTitle":"[456]132 模式","frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","title":"132 模式","titleSlug":"132-pattern"},{"articleLive":2,"formTitle":"[457]环形数组是否存在循环","frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"articleLive":2,"formTitle":"[458]可怜的小猪","frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","title":"可怜的小猪","titleSlug":"poor-pigs"},{"articleLive":2,"formTitle":"[459]重复的子字符串","frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"articleLive":2,"formTitle":"[460]LFU 缓存","frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","title":"LFU 缓存","titleSlug":"lfu-cache"},{"articleLive":2,"formTitle":"[461]汉明距离","frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","title":"汉明距离","titleSlug":"hamming-distance"},{"articleLive":2,"formTitle":"[462]最少移动次数使数组元素相等 II","frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"articleLive":2,"formTitle":"[463]岛屿的周长","frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","title":"岛屿的周长","titleSlug":"island-perimeter"},{"articleLive":2,"formTitle":"[464]我能赢吗","frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","title":"我能赢吗","titleSlug":"can-i-win"},{"articleLive":2,"formTitle":"[465]最优账单平衡","frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"articleLive":2,"formTitle":"[466]统计重复个数","frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","title":"统计重复个数","titleSlug":"count-the-repetitions"},{"articleLive":2,"formTitle":"[467]环绕字符串中唯一的子字符串","frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"articleLive":2,"formTitle":"[468]验证IP地址","frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","title":"验证IP地址","titleSlug":"validate-ip-address"},{"articleLive":2,"formTitle":"[469]凸多边形","frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","title":"凸多边形","titleSlug":"convex-polygon"},{"articleLive":2,"formTitle":"[470]用 Rand7() 实现 Rand10()","frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"articleLive":2,"formTitle":"[471]编码最短长度的字符串","frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"articleLive":2,"formTitle":"[472]连接词","frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","title":"连接词","titleSlug":"concatenated-words"},{"articleLive":2,"formTitle":"[473]火柴拼正方形","frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"articleLive":2,"formTitle":"[474]一和零","frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","title":"一和零","titleSlug":"ones-and-zeroes"},{"articleLive":2,"formTitle":"[475]供暖器","frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","title":"供暖器","titleSlug":"heaters"},{"articleLive":2,"formTitle":"[476]数字的补数","frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","title":"数字的补数","titleSlug":"number-complement"},{"articleLive":2,"formTitle":"[477]汉明距离总和","frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"articleLive":2,"formTitle":"[478]在圆内随机生成点","frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"articleLive":2,"formTitle":"[479]最大回文数乘积","frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"articleLive":2,"formTitle":"[480]滑动窗口中位数","frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"articleLive":2,"formTitle":"[481]神奇字符串","frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","title":"神奇字符串","titleSlug":"magical-string"},{"articleLive":2,"formTitle":"[482]密钥格式化","frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","title":"密钥格式化","titleSlug":"license-key-formatting"},{"articleLive":2,"formTitle":"[483]最小好进制","frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","title":"最小好进制","titleSlug":"smallest-good-base"},{"articleLive":2,"formTitle":"[484]寻找排列","frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","title":"寻找排列","titleSlug":"find-permutation"},{"articleLive":2,"formTitle":"[485]最大连续 1 的个数","frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"articleLive":2,"formTitle":"[486]预测赢家","frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","title":"预测赢家","titleSlug":"predict-the-winner"},{"articleLive":2,"formTitle":"[487]最大连续1的个数 II","frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"articleLive":2,"formTitle":"[488]祖玛游戏","frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","title":"祖玛游戏","titleSlug":"zuma-game"},{"articleLive":2,"formTitle":"[489]扫地机器人","frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"articleLive":2,"formTitle":"[490]迷宫","frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","title":"迷宫","titleSlug":"the-maze"},{"articleLive":2,"formTitle":"[491]递增子序列","frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","title":"递增子序列","titleSlug":"increasing-subsequences"},{"articleLive":2,"formTitle":"[492]构造矩形","frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","title":"构造矩形","titleSlug":"construct-the-rectangle"},{"articleLive":2,"formTitle":"[493]翻转对","frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","title":"翻转对","titleSlug":"reverse-pairs"},{"articleLive":2,"formTitle":"[494]目标和","frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","title":"目标和","titleSlug":"target-sum"},{"articleLive":2,"formTitle":"[495]提莫攻击","frontendQuestionId":"495","leaf":true,"level":2,"nodeType":"def","questionId":"495","status":"","title":"提莫攻击","titleSlug":"teemo-attacking"},{"articleLive":2,"formTitle":"[496]下一个更大元素 I","frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"articleLive":2,"formTitle":"[497]非重叠矩形中的随机点","frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"articleLive":2,"formTitle":"[498]对角线遍历","frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","title":"对角线遍历","titleSlug":"diagonal-traverse"},{"articleLive":2,"formTitle":"[499]迷宫 III","frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","title":"迷宫 III","titleSlug":"the-maze-iii"},{"articleLive":2,"formTitle":"[500]键盘行","frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","title":"键盘行","titleSlug":"keyboard-row"},{"articleLive":2,"formTitle":"[501]二叉搜索树中的众数","frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"articleLive":2,"formTitle":"[502]IPO","frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","title":"IPO","titleSlug":"ipo"},{"articleLive":2,"formTitle":"[503]下一个更大元素 II","frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"articleLive":2,"formTitle":"[504]七进制数","frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","title":"七进制数","titleSlug":"base-7"},{"articleLive":2,"formTitle":"[505]迷宫 II","frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","title":"迷宫 II","titleSlug":"the-maze-ii"},{"articleLive":2,"formTitle":"[506]相对名次","frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","title":"相对名次","titleSlug":"relative-ranks"},{"articleLive":2,"formTitle":"[507]完美数","frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","title":"完美数","titleSlug":"perfect-number"},{"articleLive":2,"formTitle":"[508]出现次数最多的子树元素和","frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"articleLive":2,"formTitle":"[509]斐波那契数","frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","title":"斐波那契数","titleSlug":"fibonacci-number"},{"articleLive":2,"formTitle":"[510]二叉搜索树中的中序后继 II","frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"articleLive":2,"formTitle":"[511]游戏玩法分析 I","frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"articleLive":2,"formTitle":"[512]游戏玩法分析 II","frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"articleLive":2,"formTitle":"[513]找树左下角的值","frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"articleLive":2,"formTitle":"[514]自由之路","frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","title":"自由之路","titleSlug":"freedom-trail"},{"articleLive":2,"formTitle":"[515]在每个树行中找最大值","frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"articleLive":2,"formTitle":"[516]最长回文子序列","frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"articleLive":2,"formTitle":"[517]超级洗衣机","frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","title":"超级洗衣机","titleSlug":"super-washing-machines"},{"articleLive":2,"formTitle":"[518]零钱兑换 II","frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","title":"零钱兑换 II","titleSlug":"coin-change-2"},{"articleLive":2,"formTitle":"[519]随机翻转矩阵","frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"articleLive":2,"formTitle":"[520]检测大写字母","frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","title":"检测大写字母","titleSlug":"detect-capital"},{"articleLive":2,"formTitle":"[521]最长特殊序列 Ⅰ","frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"articleLive":2,"formTitle":"[522]最长特殊序列 II","frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"articleLive":2,"formTitle":"[523]连续的子数组和","frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"articleLive":2,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"articleLive":2,"formTitle":"[525]连续数组","frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","title":"连续数组","titleSlug":"contiguous-array"},{"articleLive":2,"formTitle":"[526]优美的排列","frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","title":"优美的排列","titleSlug":"beautiful-arrangement"},{"articleLive":2,"formTitle":"[527]单词缩写","frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","title":"单词缩写","titleSlug":"word-abbreviation"},{"articleLive":2,"formTitle":"[528]按权重随机选择","frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"articleLive":2,"formTitle":"[529]扫雷游戏","frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","title":"扫雷游戏","titleSlug":"minesweeper"},{"articleLive":2,"formTitle":"[530]二叉搜索树的最小绝对差","frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"articleLive":2,"formTitle":"[531]孤独像素 I","frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"articleLive":2,"formTitle":"[532]数组中的 k-diff 数对","frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"articleLive":2,"formTitle":"[533]孤独像素 II","frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"articleLive":2,"formTitle":"[534]游戏玩法分析 III","frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"articleLive":2,"formTitle":"[535]TinyURL 的加密与解密","frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"articleLive":2,"formTitle":"[536]从字符串生成二叉树","frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"articleLive":2,"formTitle":"[537]复数乘法","frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","title":"复数乘法","titleSlug":"complex-number-multiplication"},{"articleLive":2,"formTitle":"[538]把二叉搜索树转换为累加树","frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"articleLive":2,"formTitle":"[539]最小时间差","frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","title":"最小时间差","titleSlug":"minimum-time-difference"},{"articleLive":2,"formTitle":"[540]有序数组中的单一元素","frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"articleLive":2,"formTitle":"[541]反转字符串 II","frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"articleLive":2,"formTitle":"[542]01 矩阵","frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","title":"01 矩阵","titleSlug":"01-matrix"},{"articleLive":2,"formTitle":"[543]二叉树的直径","frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"articleLive":2,"formTitle":"[544]输出比赛匹配对","frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"articleLive":2,"formTitle":"[545]二叉树的边界","frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"articleLive":2,"formTitle":"[546]移除盒子","frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","title":"移除盒子","titleSlug":"remove-boxes"},{"articleLive":2,"formTitle":"[547]省份数量","frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","title":"省份数量","titleSlug":"number-of-provinces"},{"articleLive":2,"formTitle":"[548]将数组分割成和相等的子数组","frontendQuestionId":"548","leaf":true,"level":2,"nodeType":"def","questionId":"548","status":"lock","title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"articleLive":2,"formTitle":"[549]二叉树中最长的连续序列","frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"articleLive":2,"formTitle":"[550]游戏玩法分析 IV","frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"articleLive":2,"formTitle":"[551]学生出勤记录 I","frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"articleLive":2,"formTitle":"[552]学生出勤记录 II","frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"articleLive":2,"formTitle":"[553]最优除法","frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","title":"最优除法","titleSlug":"optimal-division"},{"articleLive":2,"formTitle":"[554]砖墙","frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","title":"砖墙","titleSlug":"brick-wall"},{"articleLive":2,"formTitle":"[555]分割连接字符串","frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"articleLive":2,"formTitle":"[556]下一个更大元素 III","frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"articleLive":2,"formTitle":"[557]反转字符串中的单词 III","frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"articleLive":2,"formTitle":"[558]四叉树交集","frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"articleLive":2,"formTitle":"[559]N 叉树的最大深度","frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"articleLive":2,"formTitle":"[560]和为K的子数组","frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"articleLive":2,"formTitle":"[561]数组拆分 I","frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","title":"数组拆分 I","titleSlug":"array-partition-i"},{"articleLive":2,"formTitle":"[562]矩阵中最长的连续1线段","frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"articleLive":2,"formTitle":"[563]二叉树的坡度","frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"articleLive":2,"formTitle":"[564]寻找最近的回文数","frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"articleLive":2,"formTitle":"[565]数组嵌套","frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","title":"数组嵌套","titleSlug":"array-nesting"},{"articleLive":2,"formTitle":"[566]重塑矩阵","frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"articleLive":2,"formTitle":"[567]字符串的排列","frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","title":"字符串的排列","titleSlug":"permutation-in-string"},{"articleLive":2,"formTitle":"[568]最大休假天数","frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"articleLive":2,"formTitle":"[569]员工薪水中位数","frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"articleLive":2,"formTitle":"[570]至少有5名直接下属的经理","frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"articleLive":2,"formTitle":"[571]给定数字的频率查询中位数","frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"articleLive":2,"formTitle":"[572]另一个树的子树","frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","title":"另一个树的子树","titleSlug":"subtree-of-another-tree"},{"articleLive":2,"formTitle":"[573]松鼠模拟","frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"articleLive":2,"formTitle":"[574]当选者","frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","title":"当选者","titleSlug":"winning-candidate"},{"articleLive":2,"formTitle":"[575]分糖果","frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","title":"分糖果","titleSlug":"distribute-candies"},{"articleLive":2,"formTitle":"[576]出界的路径数","frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"articleLive":2,"formTitle":"[577]员工奖金","frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","title":"员工奖金","titleSlug":"employee-bonus"},{"articleLive":2,"formTitle":"[578]查询回答率最高的问题","frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"articleLive":2,"formTitle":"[579]查询员工的累计薪水","frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"articleLive":2,"formTitle":"[580]统计各专业学生人数","frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"articleLive":2,"formTitle":"[581]最短无序连续子数组","frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"","title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"articleLive":2,"formTitle":"[582]杀掉进程","frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","title":"杀掉进程","titleSlug":"kill-process"},{"articleLive":2,"formTitle":"[583]两个字符串的删除操作","frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"articleLive":2,"formTitle":"[584]寻找用户推荐人","frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"articleLive":2,"formTitle":"[585]2016年的投资","frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","title":"2016年的投资","titleSlug":"investments-in-2016"},{"articleLive":2,"formTitle":"[586]订单最多的客户","frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"articleLive":2,"formTitle":"[587]安装栅栏","frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","title":"安装栅栏","titleSlug":"erect-the-fence"},{"articleLive":2,"formTitle":"[588]设计内存文件系统","frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"articleLive":2,"formTitle":"[589]N 叉树的前序遍历","frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"articleLive":2,"formTitle":"[590]N 叉树的后序遍历","frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"articleLive":2,"formTitle":"[591]标签验证器","frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","title":"标签验证器","titleSlug":"tag-validator"},{"articleLive":2,"formTitle":"[592]分数加减运算","frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"articleLive":2,"formTitle":"[593]有效的正方形","frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","title":"有效的正方形","titleSlug":"valid-square"},{"articleLive":2,"formTitle":"[594]最长和谐子序列","frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"articleLive":2,"formTitle":"[595]大的国家","frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","title":"大的国家","titleSlug":"big-countries"},{"articleLive":2,"formTitle":"[596]超过5名学生的课","frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"articleLive":2,"formTitle":"[597]好友申请 I：总体通过率","frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"articleLive":2,"formTitle":"[598]范围求和 II","frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","title":"范围求和 II","titleSlug":"range-addition-ii"},{"articleLive":2,"formTitle":"[599]两个列表的最小索引总和","frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"articleLive":2,"formTitle":"[600]不含连续1的非负整数","frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"articleLive":2,"formTitle":"[601]体育馆的人流量","frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"articleLive":2,"formTitle":"[602]好友申请 II ：谁有最多的好友","frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"articleLive":2,"formTitle":"[603]连续空余座位","frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"articleLive":2,"formTitle":"[604]迭代压缩字符串","frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"articleLive":2,"formTitle":"[605]种花问题","frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","title":"种花问题","titleSlug":"can-place-flowers"},{"articleLive":2,"formTitle":"[606]根据二叉树创建字符串","frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"articleLive":2,"formTitle":"[607]销售员","frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","title":"销售员","titleSlug":"sales-person"},{"articleLive":2,"formTitle":"[608]树节点","frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","title":"树节点","titleSlug":"tree-node"},{"articleLive":2,"formTitle":"[609]在系统中查找重复文件","frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"articleLive":2,"formTitle":"[610]判断三角形","frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","title":"判断三角形","titleSlug":"triangle-judgement"},{"articleLive":2,"formTitle":"[611]有效三角形的个数","frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"articleLive":2,"formTitle":"[612]平面上的最近距离","frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"articleLive":2,"formTitle":"[613]直线上的最近距离","frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"articleLive":2,"formTitle":"[614]二级关注者","frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","title":"二级关注者","titleSlug":"second-degree-follower"},{"articleLive":2,"formTitle":"[615]平均工资：部门与公司比较","frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"articleLive":2,"formTitle":"[616]给字符串添加加粗标签","frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"articleLive":2,"formTitle":"[617]合并二叉树","frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"articleLive":2,"formTitle":"[618]学生地理信息报告","frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"articleLive":2,"formTitle":"[619]只出现一次的最大数字","frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"articleLive":2,"formTitle":"[620]有趣的电影","frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","title":"有趣的电影","titleSlug":"not-boring-movies"},{"articleLive":2,"formTitle":"[621]任务调度器","frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","title":"任务调度器","titleSlug":"task-scheduler"},{"articleLive":2,"formTitle":"[622]设计循环队列","frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","title":"设计循环队列","titleSlug":"design-circular-queue"},{"articleLive":2,"formTitle":"[623]在二叉树中增加一行","frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"articleLive":2,"formTitle":"[624]数组列表中的最大距离","frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"articleLive":2,"formTitle":"[625]最小因式分解","frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","title":"最小因式分解","titleSlug":"minimum-factorization"},{"articleLive":2,"formTitle":"[626]换座位","frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","title":"换座位","titleSlug":"exchange-seats"},{"articleLive":2,"formTitle":"[627]变更性别","frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","title":"变更性别","titleSlug":"swap-salary"},{"articleLive":2,"formTitle":"[628]三个数的最大乘积","frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"articleLive":2,"formTitle":"[629]K个逆序对数组","frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"articleLive":2,"formTitle":"[630]课程表 III","frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","title":"课程表 III","titleSlug":"course-schedule-iii"},{"articleLive":2,"formTitle":"[631]设计 Excel 求和公式","frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"articleLive":2,"formTitle":"[632]最小区间","frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"articleLive":2,"formTitle":"[633]平方数之和","frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"articleLive":2,"formTitle":"[634]寻找数组的错位排列","frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"articleLive":2,"formTitle":"[635]设计日志存储系统","frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"articleLive":2,"formTitle":"[636]函数的独占时间","frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"articleLive":2,"formTitle":"[637]二叉树的层平均值","frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"articleLive":2,"formTitle":"[638]大礼包","frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","title":"大礼包","titleSlug":"shopping-offers"},{"articleLive":2,"formTitle":"[639]解码方法 II","frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","title":"解码方法 II","titleSlug":"decode-ways-ii"},{"articleLive":2,"formTitle":"[640]求解方程","frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","title":"求解方程","titleSlug":"solve-the-equation"},{"articleLive":2,"formTitle":"[641]设计循环双端队列","frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"articleLive":2,"formTitle":"[642]设计搜索自动补全系统","frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"articleLive":2,"formTitle":"[643]子数组最大平均数 I","frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"articleLive":2,"formTitle":"[644]子数组最大平均数 II","frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"articleLive":2,"formTitle":"[645]错误的集合","frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","title":"错误的集合","titleSlug":"set-mismatch"},{"articleLive":2,"formTitle":"[646]最长数对链","frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"articleLive":2,"formTitle":"[647]回文子串","frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","title":"回文子串","titleSlug":"palindromic-substrings"},{"articleLive":2,"formTitle":"[648]单词替换","frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","title":"单词替换","titleSlug":"replace-words"},{"articleLive":2,"formTitle":"[649]Dota2 参议院","frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","title":"Dota2 参议院","titleSlug":"dota2-senate"},{"articleLive":2,"formTitle":"[650]只有两个键的键盘","frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"articleLive":2,"formTitle":"[651]4键键盘","frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","title":"4键键盘","titleSlug":"4-keys-keyboard"},{"articleLive":2,"formTitle":"[652]寻找重复的子树","frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"articleLive":2,"formTitle":"[653]两数之和 IV - 输入 BST","frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"articleLive":2,"formTitle":"[654]最大二叉树","frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"articleLive":2,"formTitle":"[655]输出二叉树","frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","title":"输出二叉树","titleSlug":"print-binary-tree"},{"articleLive":2,"formTitle":"[656]金币路径","frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","title":"金币路径","titleSlug":"coin-path"},{"articleLive":2,"formTitle":"[657]机器人能否返回原点","frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"articleLive":2,"formTitle":"[658]找到 K 个最接近的元素","frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"articleLive":2,"formTitle":"[659]分割数组为连续子序列","frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"articleLive":2,"formTitle":"[660]移除 9","frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","title":"移除 9","titleSlug":"remove-9"},{"articleLive":2,"formTitle":"[661]图片平滑器","frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","title":"图片平滑器","titleSlug":"image-smoother"},{"articleLive":2,"formTitle":"[662]二叉树最大宽度","frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"articleLive":2,"formTitle":"[663]均匀树划分","frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","title":"均匀树划分","titleSlug":"equal-tree-partition"},{"articleLive":2,"formTitle":"[664]奇怪的打印机","frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","title":"奇怪的打印机","titleSlug":"strange-printer"},{"articleLive":2,"formTitle":"[665]非递减数列","frontendQuestionId":"665","leaf":true,"level":1,"nodeType":"def","questionId":"665","status":"","title":"非递减数列","titleSlug":"non-decreasing-array"},{"articleLive":2,"formTitle":"[666]路径总和 IV","frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","title":"路径总和 IV","titleSlug":"path-sum-iv"},{"articleLive":2,"formTitle":"[667]优美的排列 II","frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"articleLive":2,"formTitle":"[668]乘法表中第k小的数","frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"articleLive":2,"formTitle":"[669]修剪二叉搜索树","frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"articleLive":2,"formTitle":"[670]最大交换","frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","title":"最大交换","titleSlug":"maximum-swap"},{"articleLive":2,"formTitle":"[671]二叉树中第二小的节点","frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"notac","title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"articleLive":2,"formTitle":"[672]灯泡开关 Ⅱ","frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"articleLive":2,"formTitle":"[673]最长递增子序列的个数","frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"articleLive":2,"formTitle":"[674]最长连续递增序列","frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"articleLive":2,"formTitle":"[675]为高尔夫比赛砍树","frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"articleLive":2,"formTitle":"[676]实现一个魔法字典","frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"articleLive":2,"formTitle":"[677]键值映射","frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","title":"键值映射","titleSlug":"map-sum-pairs"},{"articleLive":2,"formTitle":"[678]有效的括号字符串","frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"articleLive":2,"formTitle":"[679]24 点游戏","frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","title":"24 点游戏","titleSlug":"24-game"},{"articleLive":2,"formTitle":"[680]验证回文字符串 Ⅱ","frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"articleLive":2,"formTitle":"[681]最近时刻","frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","title":"最近时刻","titleSlug":"next-closest-time"},{"articleLive":2,"formTitle":"[682]棒球比赛","frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","title":"棒球比赛","titleSlug":"baseball-game"},{"articleLive":2,"formTitle":"[683]K 个关闭的灯泡","frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"articleLive":2,"formTitle":"[684]冗余连接","frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","title":"冗余连接","titleSlug":"redundant-connection"},{"articleLive":2,"formTitle":"[685]冗余连接 II","frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"articleLive":2,"formTitle":"[686]重复叠加字符串匹配","frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"articleLive":2,"formTitle":"[687]最长同值路径","frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","title":"最长同值路径","titleSlug":"longest-univalue-path"},{"articleLive":2,"formTitle":"[688]“马”在棋盘上的概率","frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"articleLive":2,"formTitle":"[689]三个无重叠子数组的最大和","frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"articleLive":2,"formTitle":"[690]员工的重要性","frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"","title":"员工的重要性","titleSlug":"employee-importance"},{"articleLive":2,"formTitle":"[691]贴纸拼词","frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"articleLive":2,"formTitle":"[692]前K个高频单词","frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"articleLive":2,"formTitle":"[693]交替位二进制数","frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"articleLive":2,"formTitle":"[694]不同岛屿的数量","frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"articleLive":2,"formTitle":"[695]岛屿的最大面积","frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"articleLive":2,"formTitle":"[696]计数二进制子串","frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"articleLive":2,"formTitle":"[697]数组的度","frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","title":"数组的度","titleSlug":"degree-of-an-array"},{"articleLive":2,"formTitle":"[698]划分为k个相等的子集","frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"articleLive":2,"formTitle":"[699]掉落的方块","frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","title":"掉落的方块","titleSlug":"falling-squares"},{"articleLive":2,"formTitle":"[700]二叉搜索树中的搜索","frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"articleLive":2,"formTitle":"[701]二叉搜索树中的插入操作","frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"articleLive":2,"formTitle":"[702]搜索长度未知的有序数组","frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"articleLive":2,"formTitle":"[703]数据流中的第 K 大元素","frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"articleLive":2,"formTitle":"[704]二分查找","frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","title":"二分查找","titleSlug":"binary-search"},{"articleLive":2,"formTitle":"[705]设计哈希集合","frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","title":"设计哈希集合","titleSlug":"design-hashset"},{"articleLive":2,"formTitle":"[706]设计哈希映射","frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","title":"设计哈希映射","titleSlug":"design-hashmap"},{"articleLive":2,"formTitle":"[707]设计链表","frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","title":"设计链表","titleSlug":"design-linked-list"},{"articleLive":2,"formTitle":"[708]循环有序列表的插入","frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"articleLive":2,"formTitle":"[709]转换成小写字母","frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","title":"转换成小写字母","titleSlug":"to-lower-case"},{"articleLive":2,"formTitle":"[710]黑名单中的随机数","frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"articleLive":2,"formTitle":"[711]不同岛屿的数量 II","frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"articleLive":2,"formTitle":"[712]两个字符串的最小ASCII删除和","frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"articleLive":2,"formTitle":"[713]乘积小于K的子数组","frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"articleLive":2,"formTitle":"[714]买卖股票的最佳时机含手续费","frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"articleLive":2,"formTitle":"[715]Range 模块","frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","title":"Range 模块","titleSlug":"range-module"},{"articleLive":2,"formTitle":"[716]最大栈","frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","title":"最大栈","titleSlug":"max-stack"},{"articleLive":2,"formTitle":"[717]1比特与2比特字符","frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"articleLive":2,"formTitle":"[718]最长重复子数组","frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"articleLive":2,"formTitle":"[719]找出第 k 小的距离对","frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"articleLive":2,"formTitle":"[720]词典中最长的单词","frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"articleLive":2,"formTitle":"[721]账户合并","frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","title":"账户合并","titleSlug":"accounts-merge"},{"articleLive":2,"formTitle":"[722]删除注释","frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","title":"删除注释","titleSlug":"remove-comments"},{"articleLive":2,"formTitle":"[723]粉碎糖果","frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","title":"粉碎糖果","titleSlug":"candy-crush"},{"articleLive":2,"formTitle":"[724]寻找数组的中心下标","frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"articleLive":2,"formTitle":"[725]分隔链表","frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"articleLive":2,"formTitle":"[726]原子的数量","frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","title":"原子的数量","titleSlug":"number-of-atoms"},{"articleLive":2,"formTitle":"[727]最小窗口子序列","frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"articleLive":2,"formTitle":"[728]自除数","frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","title":"自除数","titleSlug":"self-dividing-numbers"},{"articleLive":2,"formTitle":"[729]我的日程安排表 I","frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"articleLive":2,"formTitle":"[730]统计不同回文子序列","frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"articleLive":2,"formTitle":"[731]我的日程安排表 II","frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"articleLive":2,"formTitle":"[732]我的日程安排表 III","frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"articleLive":2,"formTitle":"[733]图像渲染","frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","title":"图像渲染","titleSlug":"flood-fill"},{"articleLive":2,"formTitle":"[734]句子相似性","frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","title":"句子相似性","titleSlug":"sentence-similarity"},{"articleLive":2,"formTitle":"[735]行星碰撞","frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","title":"行星碰撞","titleSlug":"asteroid-collision"},{"articleLive":2,"formTitle":"[736]Lisp 语法解析","frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"articleLive":2,"formTitle":"[737]句子相似性 II","frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"articleLive":2,"formTitle":"[738]单调递增的数字","frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"articleLive":2,"formTitle":"[739]每日温度","frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","title":"每日温度","titleSlug":"daily-temperatures"},{"articleLive":2,"formTitle":"[740]删除并获得点数","frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","title":"删除并获得点数","titleSlug":"delete-and-earn"},{"articleLive":2,"formTitle":"[741]摘樱桃","frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","title":"摘樱桃","titleSlug":"cherry-pickup"},{"articleLive":2,"formTitle":"[742]二叉树最近的叶节点","frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"articleLive":2,"formTitle":"[743]网络延迟时间","frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","title":"网络延迟时间","titleSlug":"network-delay-time"},{"articleLive":2,"formTitle":"[744]寻找比目标字母大的最小字母","frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"articleLive":2,"formTitle":"[745]前缀和后缀搜索","frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"articleLive":2,"formTitle":"[746]使用最小花费爬楼梯","frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"articleLive":2,"formTitle":"[747]至少是其他数字两倍的最大数","frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"articleLive":2,"formTitle":"[748]最短补全词","frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","title":"最短补全词","titleSlug":"shortest-completing-word"},{"articleLive":2,"formTitle":"[749]隔离病毒","frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","title":"隔离病毒","titleSlug":"contain-virus"},{"articleLive":2,"formTitle":"[750]角矩形的数量","frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"articleLive":2,"formTitle":"[751]IP 到 CIDR","frontendQuestionId":"751","leaf":true,"level":1,"nodeType":"def","questionId":"752","status":"lock","title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"articleLive":2,"formTitle":"[752]打开转盘锁","frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","title":"打开转盘锁","titleSlug":"open-the-lock"},{"articleLive":2,"formTitle":"[753]破解保险箱","frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","title":"破解保险箱","titleSlug":"cracking-the-safe"},{"articleLive":2,"formTitle":"[754]到达终点数字","frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","title":"到达终点数字","titleSlug":"reach-a-number"},{"articleLive":2,"formTitle":"[755]倒水","frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","title":"倒水","titleSlug":"pour-water"},{"articleLive":2,"formTitle":"[756]金字塔转换矩阵","frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"articleLive":2,"formTitle":"[757]设置交集大小至少为2","frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"articleLive":2,"formTitle":"[758]字符串中的加粗单词","frontendQuestionId":"758","leaf":true,"level":1,"nodeType":"def","questionId":"760","status":"lock","title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"articleLive":2,"formTitle":"[759]员工空闲时间","frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","title":"员工空闲时间","titleSlug":"employee-free-time"},{"articleLive":2,"formTitle":"[760]找出变位映射","frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"articleLive":2,"formTitle":"[761]特殊的二进制序列","frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"articleLive":2,"formTitle":"[762]二进制表示中质数个计算置位","frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"articleLive":2,"formTitle":"[763]划分字母区间","frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","title":"划分字母区间","titleSlug":"partition-labels"},{"articleLive":2,"formTitle":"[764]最大加号标志","frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","title":"最大加号标志","titleSlug":"largest-plus-sign"},{"articleLive":2,"formTitle":"[765]情侣牵手","frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","title":"情侣牵手","titleSlug":"couples-holding-hands"},{"articleLive":2,"formTitle":"[766]托普利茨矩阵","frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"articleLive":2,"formTitle":"[767]重构字符串","frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","title":"重构字符串","titleSlug":"reorganize-string"},{"articleLive":2,"formTitle":"[768]最多能完成排序的块 II","frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"articleLive":2,"formTitle":"[769]最多能完成排序的块","frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"articleLive":2,"formTitle":"[770]基本计算器 IV","frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"articleLive":2,"formTitle":"[771]宝石与石头","frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","title":"宝石与石头","titleSlug":"jewels-and-stones"},{"articleLive":2,"formTitle":"[772]基本计算器 III","frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"articleLive":2,"formTitle":"[773]滑动谜题","frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","title":"滑动谜题","titleSlug":"sliding-puzzle"},{"articleLive":2,"formTitle":"[774]最小化去加油站的最大距离","frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"articleLive":2,"formTitle":"[775]全局倒置与局部倒置","frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"articleLive":2,"formTitle":"[776]拆分二叉搜索树","frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","title":"拆分二叉搜索树","titleSlug":"split-bst"},{"articleLive":2,"formTitle":"[777]在LR字符串中交换相邻字符","frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"articleLive":2,"formTitle":"[778]水位上升的泳池中游泳","frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"articleLive":2,"formTitle":"[779]第K个语法符号","frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"articleLive":2,"formTitle":"[780]到达终点","frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","title":"到达终点","titleSlug":"reaching-points"},{"articleLive":2,"formTitle":"[781]森林中的兔子","frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"articleLive":2,"formTitle":"[782]变为棋盘","frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"articleLive":2,"formTitle":"[783]二叉搜索树节点最小距离","frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"articleLive":2,"formTitle":"[784]字母大小写全排列","frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"articleLive":2,"formTitle":"[785]判断二分图","frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","title":"判断二分图","titleSlug":"is-graph-bipartite"},{"articleLive":2,"formTitle":"[786]第 K 个最小的素数分数","frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"articleLive":2,"formTitle":"[787]K 站中转内最便宜的航班","frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"articleLive":2,"formTitle":"[788]旋转数字","frontendQuestionId":"788","leaf":true,"level":1,"nodeType":"def","questionId":"804","status":"","title":"旋转数字","titleSlug":"rotated-digits"},{"articleLive":2,"formTitle":"[789]逃脱阻碍者","frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"articleLive":2,"formTitle":"[790]多米诺和托米诺平铺","frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"articleLive":2,"formTitle":"[791]自定义字符串排序","frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"articleLive":2,"formTitle":"[792]匹配子序列的单词数","frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"articleLive":2,"formTitle":"[793]阶乘函数后 K 个零","frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"articleLive":2,"formTitle":"[794]有效的井字游戏","frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"articleLive":2,"formTitle":"[795]区间子数组个数","frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"articleLive":2,"formTitle":"[796]旋转字符串","frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","title":"旋转字符串","titleSlug":"rotate-string"},{"articleLive":2,"formTitle":"[797]所有可能的路径","frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"articleLive":2,"formTitle":"[798]得分最高的最小轮调","frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"articleLive":2,"formTitle":"[799]香槟塔","frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","title":"香槟塔","titleSlug":"champagne-tower"},{"articleLive":2,"formTitle":"[800]相似 RGB 颜色","frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"articleLive":2,"formTitle":"[801]使序列递增的最小交换次数","frontendQuestionId":"801","leaf":true,"level":2,"nodeType":"def","questionId":"819","status":"","title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"articleLive":2,"formTitle":"[802]找到最终的安全状态","frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"articleLive":2,"formTitle":"[803]打砖块","frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"articleLive":2,"formTitle":"[804]唯一摩尔斯密码词","frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"articleLive":2,"formTitle":"[805]数组的均值分割","frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"articleLive":2,"formTitle":"[806]写字符串需要的行数","frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"articleLive":2,"formTitle":"[807]保持城市天际线","frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"articleLive":2,"formTitle":"[808]分汤","frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","title":"分汤","titleSlug":"soup-servings"},{"articleLive":2,"formTitle":"[809]情感丰富的文字","frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","title":"情感丰富的文字","titleSlug":"expressive-words"},{"articleLive":2,"formTitle":"[810]黑板异或游戏","frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"articleLive":2,"formTitle":"[811]子域名访问计数","frontendQuestionId":"811","leaf":true,"level":1,"nodeType":"def","questionId":"829","status":"","title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"articleLive":2,"formTitle":"[812]最大三角形面积","frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"articleLive":2,"formTitle":"[813]最大平均值和的分组","frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"articleLive":2,"formTitle":"[814]二叉树剪枝","frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"articleLive":2,"formTitle":"[815]公交路线","frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","title":"公交路线","titleSlug":"bus-routes"},{"articleLive":2,"formTitle":"[816]模糊坐标","frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"articleLive":2,"formTitle":"[817]链表组件","frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","title":"链表组件","titleSlug":"linked-list-components"},{"articleLive":2,"formTitle":"[818]赛车","frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","title":"赛车","titleSlug":"race-car"},{"articleLive":2,"formTitle":"[819]最常见的单词","frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","title":"最常见的单词","titleSlug":"most-common-word"},{"articleLive":2,"formTitle":"[820]单词的压缩编码","frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"articleLive":2,"formTitle":"[821]字符的最短距离","frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"articleLive":2,"formTitle":"[822]翻转卡片游戏","frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"articleLive":2,"formTitle":"[823]带因子的二叉树","frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"articleLive":2,"formTitle":"[824]山羊拉丁文","frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","title":"山羊拉丁文","titleSlug":"goat-latin"},{"articleLive":2,"formTitle":"[825]适龄的朋友","frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"articleLive":2,"formTitle":"[826]安排工作以达到最大收益","frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"articleLive":2,"formTitle":"[827]最大人工岛","frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","title":"最大人工岛","titleSlug":"making-a-large-island"},{"articleLive":2,"formTitle":"[828]统计子串中的唯一字符","frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"articleLive":2,"formTitle":"[829]连续整数求和","frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"articleLive":2,"formTitle":"[830]较大分组的位置","frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"articleLive":2,"formTitle":"[831]隐藏个人信息","frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"articleLive":2,"formTitle":"[832]翻转图像","frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","title":"翻转图像","titleSlug":"flipping-an-image"},{"articleLive":2,"formTitle":"[833]字符串中的查找与替换","frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"articleLive":2,"formTitle":"[834]树中距离之和","frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"articleLive":2,"formTitle":"[835]图像重叠","frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","title":"图像重叠","titleSlug":"image-overlap"},{"articleLive":2,"formTitle":"[836]矩形重叠","frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","title":"矩形重叠","titleSlug":"rectangle-overlap"},{"articleLive":2,"formTitle":"[837]新21点","frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","title":"新21点","titleSlug":"new-21-game"},{"articleLive":2,"formTitle":"[838]推多米诺","frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","title":"推多米诺","titleSlug":"push-dominoes"},{"articleLive":2,"formTitle":"[839]相似字符串组","frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","title":"相似字符串组","titleSlug":"similar-string-groups"},{"articleLive":2,"formTitle":"[840]矩阵中的幻方","frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"articleLive":2,"formTitle":"[841]钥匙和房间","frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"articleLive":2,"formTitle":"[842]将数组拆分成斐波那契序列","frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"articleLive":2,"formTitle":"[843]猜猜这个单词","frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","title":"猜猜这个单词","titleSlug":"guess-the-word"},{"articleLive":2,"formTitle":"[844]比较含退格的字符串","frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"articleLive":2,"formTitle":"[845]数组中的最长山脉","frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"articleLive":2,"formTitle":"[846]一手顺子","frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","title":"一手顺子","titleSlug":"hand-of-straights"},{"articleLive":2,"formTitle":"[847]访问所有节点的最短路径","frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"articleLive":2,"formTitle":"[848]字母移位","frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","title":"字母移位","titleSlug":"shifting-letters"},{"articleLive":2,"formTitle":"[849]到最近的人的最大距离","frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"articleLive":2,"formTitle":"[850]矩形面积 II","frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"articleLive":2,"formTitle":"[851]喧闹和富有","frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","title":"喧闹和富有","titleSlug":"loud-and-rich"},{"articleLive":2,"formTitle":"[852]山脉数组的峰顶索引","frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"articleLive":2,"formTitle":"[853]车队","frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","title":"车队","titleSlug":"car-fleet"},{"articleLive":2,"formTitle":"[854]相似度为 K 的字符串","frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"articleLive":2,"formTitle":"[855]考场就座","frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","title":"考场就座","titleSlug":"exam-room"},{"articleLive":2,"formTitle":"[856]括号的分数","frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","title":"括号的分数","titleSlug":"score-of-parentheses"},{"articleLive":2,"formTitle":"[857]雇佣 K 名工人的最低成本","frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"articleLive":2,"formTitle":"[858]镜面反射","frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","title":"镜面反射","titleSlug":"mirror-reflection"},{"articleLive":2,"formTitle":"[859]亲密字符串","frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","title":"亲密字符串","titleSlug":"buddy-strings"},{"articleLive":2,"formTitle":"[860]柠檬水找零","frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","title":"柠檬水找零","titleSlug":"lemonade-change"},{"articleLive":2,"formTitle":"[861]翻转矩阵后的得分","frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"articleLive":2,"formTitle":"[862]和至少为 K 的最短子数组","frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"articleLive":2,"formTitle":"[863]二叉树中所有距离为 K 的结点","frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"articleLive":2,"formTitle":"[864]获取所有钥匙的最短路径","frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"articleLive":2,"formTitle":"[865]具有所有最深节点的最小子树","frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"articleLive":2,"formTitle":"[866]回文素数","frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","title":"回文素数","titleSlug":"prime-palindrome"},{"articleLive":2,"formTitle":"[867]转置矩阵","frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","title":"转置矩阵","titleSlug":"transpose-matrix"},{"articleLive":2,"formTitle":"[868]二进制间距","frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","title":"二进制间距","titleSlug":"binary-gap"},{"articleLive":2,"formTitle":"[869]重新排序得到 2 的幂","frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"articleLive":2,"formTitle":"[870]优势洗牌","frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","title":"优势洗牌","titleSlug":"advantage-shuffle"},{"articleLive":2,"formTitle":"[871]最低加油次数","frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"articleLive":2,"formTitle":"[872]叶子相似的树","frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"articleLive":2,"formTitle":"[873]最长的斐波那契子序列的长度","frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"articleLive":2,"formTitle":"[874]模拟行走机器人","frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"articleLive":2,"formTitle":"[875]爱吃香蕉的珂珂","frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"articleLive":2,"formTitle":"[876]链表的中间结点","frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"articleLive":2,"formTitle":"[877]石子游戏","frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","title":"石子游戏","titleSlug":"stone-game"},{"articleLive":2,"formTitle":"[878]第 N 个神奇数字","frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"articleLive":2,"formTitle":"[879]盈利计划","frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","title":"盈利计划","titleSlug":"profitable-schemes"},{"articleLive":2,"formTitle":"[880]索引处的解码字符串","frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"articleLive":2,"formTitle":"[881]救生艇","frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","title":"救生艇","titleSlug":"boats-to-save-people"},{"articleLive":2,"formTitle":"[882]细分图中的可到达结点","frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"articleLive":2,"formTitle":"[883]三维形体投影面积","frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"articleLive":2,"formTitle":"[884]两句话中的不常见单词","frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"articleLive":2,"formTitle":"[885]螺旋矩阵 III","frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"articleLive":2,"formTitle":"[886]可能的二分法","frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","title":"可能的二分法","titleSlug":"possible-bipartition"},{"articleLive":2,"formTitle":"[887]鸡蛋掉落","frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"articleLive":2,"formTitle":"[888]公平的糖果棒交换","frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"articleLive":2,"formTitle":"[889]根据前序和后序遍历构造二叉树","frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"articleLive":2,"formTitle":"[890]查找和替换模式","frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"articleLive":2,"formTitle":"[891]子序列宽度之和","frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"articleLive":2,"formTitle":"[892]三维形体的表面积","frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"articleLive":2,"formTitle":"[893]特殊等价字符串组","frontendQuestionId":"893","leaf":true,"level":1,"nodeType":"def","questionId":"929","status":"","title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"articleLive":2,"formTitle":"[894]所有可能的满二叉树","frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"articleLive":2,"formTitle":"[895]最大频率栈","frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"articleLive":2,"formTitle":"[896]单调数列","frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","title":"单调数列","titleSlug":"monotonic-array"},{"articleLive":2,"formTitle":"[897]递增顺序搜索树","frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"articleLive":2,"formTitle":"[898]子数组按位或操作","frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"articleLive":2,"formTitle":"[899]有序队列","frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","title":"有序队列","titleSlug":"orderly-queue"},{"articleLive":2,"formTitle":"[900]RLE 迭代器","frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","title":"RLE 迭代器","titleSlug":"rle-iterator"},{"articleLive":2,"formTitle":"[901]股票价格跨度","frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","title":"股票价格跨度","titleSlug":"online-stock-span"},{"articleLive":2,"formTitle":"[902]最大为 N 的数字组合","frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"articleLive":2,"formTitle":"[903]DI 序列的有效排列","frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"articleLive":2,"formTitle":"[904]水果成篮","frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","title":"水果成篮","titleSlug":"fruit-into-baskets"},{"articleLive":2,"formTitle":"[905]按奇偶排序数组","frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"articleLive":2,"formTitle":"[906]超级回文数","frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","title":"超级回文数","titleSlug":"super-palindromes"},{"articleLive":2,"formTitle":"[907]子数组的最小值之和","frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"articleLive":2,"formTitle":"[908]最小差值 I","frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","title":"最小差值 I","titleSlug":"smallest-range-i"},{"articleLive":2,"formTitle":"[909]蛇梯棋","frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"articleLive":2,"formTitle":"[910]最小差值 II","frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","title":"最小差值 II","titleSlug":"smallest-range-ii"},{"articleLive":2,"formTitle":"[911]在线选举","frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","title":"在线选举","titleSlug":"online-election"},{"articleLive":2,"formTitle":"[912]排序数组","frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","title":"排序数组","titleSlug":"sort-an-array"},{"articleLive":2,"formTitle":"[913]猫和老鼠","frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"articleLive":2,"formTitle":"[914]卡牌分组","frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"","title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"articleLive":2,"formTitle":"[915]分割数组","frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"articleLive":2,"formTitle":"[916]单词子集","frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","title":"单词子集","titleSlug":"word-subsets"},{"articleLive":2,"formTitle":"[917]仅仅反转字母","frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"articleLive":2,"formTitle":"[918]环形子数组的最大和","frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"articleLive":2,"formTitle":"[919]完全二叉树插入器","frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"articleLive":2,"formTitle":"[920]播放列表的数量","frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"articleLive":2,"formTitle":"[921]使括号有效的最少添加","frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"articleLive":2,"formTitle":"[922]按奇偶排序数组 II","frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"articleLive":2,"formTitle":"[923]三数之和的多种可能","frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"articleLive":2,"formTitle":"[924]尽量减少恶意软件的传播","frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"articleLive":2,"formTitle":"[925]长按键入","frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","title":"长按键入","titleSlug":"long-pressed-name"},{"articleLive":2,"formTitle":"[926]将字符串翻转到单调递增","frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"articleLive":2,"formTitle":"[927]三等分","frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","title":"三等分","titleSlug":"three-equal-parts"},{"articleLive":2,"formTitle":"[928]尽量减少恶意软件的传播 II","frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"articleLive":2,"formTitle":"[929]独特的电子邮件地址","frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"articleLive":2,"formTitle":"[930]和相同的二元子数组","frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"articleLive":2,"formTitle":"[931]下降路径最小和","frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"articleLive":2,"formTitle":"[932]漂亮数组","frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","title":"漂亮数组","titleSlug":"beautiful-array"},{"articleLive":2,"formTitle":"[933]最近的请求次数","frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"articleLive":2,"formTitle":"[934]最短的桥","frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","title":"最短的桥","titleSlug":"shortest-bridge"},{"articleLive":2,"formTitle":"[935]骑士拨号器","frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","title":"骑士拨号器","titleSlug":"knight-dialer"},{"articleLive":2,"formTitle":"[936]戳印序列","frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","title":"戳印序列","titleSlug":"stamping-the-sequence"},{"articleLive":2,"formTitle":"[937]重新排列日志文件","frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"articleLive":2,"formTitle":"[938]二叉搜索树的范围和","frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"articleLive":2,"formTitle":"[939]最小面积矩形","frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"articleLive":2,"formTitle":"[940]不同的子序列 II","frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"articleLive":2,"formTitle":"[941]有效的山脉数组","frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"articleLive":2,"formTitle":"[942]增减字符串匹配","frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","title":"增减字符串匹配","titleSlug":"di-string-match"},{"articleLive":2,"formTitle":"[943]最短超级串","frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"articleLive":2,"formTitle":"[944]删列造序","frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"articleLive":2,"formTitle":"[945]使数组唯一的最小增量","frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"articleLive":2,"formTitle":"[946]验证栈序列","frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"articleLive":2,"formTitle":"[947]移除最多的同行或同列石头","frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"articleLive":2,"formTitle":"[948]令牌放置","frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","title":"令牌放置","titleSlug":"bag-of-tokens"},{"articleLive":2,"formTitle":"[949]给定数字能组成的最大时间","frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"articleLive":2,"formTitle":"[950]按递增顺序显示卡牌","frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"articleLive":2,"formTitle":"[951]翻转等价二叉树","frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"articleLive":2,"formTitle":"[952]按公因数计算最大组件大小","frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"articleLive":2,"formTitle":"[953]验证外星语词典","frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"articleLive":2,"formTitle":"[954]二倍数对数组","frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"articleLive":2,"formTitle":"[955]删列造序 II","frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"articleLive":2,"formTitle":"[956]最高的广告牌","frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","title":"最高的广告牌","titleSlug":"tallest-billboard"},{"articleLive":2,"formTitle":"[957]N 天后的牢房","frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"articleLive":2,"formTitle":"[958]二叉树的完全性检验","frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"articleLive":2,"formTitle":"[959]由斜杠划分区域","frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"articleLive":2,"formTitle":"[960]删列造序 III","frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"articleLive":2,"formTitle":"[961]重复 N 次的元素","frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"articleLive":2,"formTitle":"[962]最大宽度坡","frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"articleLive":2,"formTitle":"[963]最小面积矩形 II","frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"articleLive":2,"formTitle":"[964]表示数字的最少运算符","frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"articleLive":2,"formTitle":"[965]单值二叉树","frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"articleLive":2,"formTitle":"[966]元音拼写检查器","frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"articleLive":2,"formTitle":"[967]连续差相同的数字","frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"articleLive":2,"formTitle":"[968]监控二叉树","frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"articleLive":2,"formTitle":"[969]煎饼排序","frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","title":"煎饼排序","titleSlug":"pancake-sorting"},{"articleLive":2,"formTitle":"[970]强整数","frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","title":"强整数","titleSlug":"powerful-integers"},{"articleLive":2,"formTitle":"[971]翻转二叉树以匹配先序遍历","frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"articleLive":2,"formTitle":"[972]相等的有理数","frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"articleLive":2,"formTitle":"[973]最接近原点的 K 个点","frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"articleLive":2,"formTitle":"[974]和可被 K 整除的子数组","frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"articleLive":2,"formTitle":"[975]奇偶跳","frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","title":"奇偶跳","titleSlug":"odd-even-jump"},{"articleLive":2,"formTitle":"[976]三角形的最大周长","frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"articleLive":2,"formTitle":"[977]有序数组的平方","frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"articleLive":2,"formTitle":"[978]最长湍流子数组","frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"articleLive":2,"formTitle":"[979]在二叉树中分配硬币","frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"articleLive":2,"formTitle":"[980]不同路径 III","frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","title":"不同路径 III","titleSlug":"unique-paths-iii"},{"articleLive":2,"formTitle":"[981]基于时间的键值存储","frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"articleLive":2,"formTitle":"[982]按位与为零的三元组","frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"articleLive":2,"formTitle":"[983]最低票价","frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"articleLive":2,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"articleLive":2,"formTitle":"[985]查询后的偶数和","frontendQuestionId":"985","leaf":true,"level":1,"nodeType":"def","questionId":"1027","status":"","title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"articleLive":2,"formTitle":"[986]区间列表的交集","frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"articleLive":2,"formTitle":"[987]二叉树的垂序遍历","frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"","title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"articleLive":2,"formTitle":"[988]从叶结点开始的最小字符串","frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"articleLive":2,"formTitle":"[989]数组形式的整数加法","frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"articleLive":2,"formTitle":"[990]等式方程的可满足性","frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"articleLive":2,"formTitle":"[991]坏了的计算器","frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","title":"坏了的计算器","titleSlug":"broken-calculator"},{"articleLive":2,"formTitle":"[992]K 个不同整数的子数组","frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"articleLive":2,"formTitle":"[993]二叉树的堂兄弟节点","frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"articleLive":2,"formTitle":"[994]腐烂的橘子","frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"articleLive":2,"formTitle":"[995]K 连续位的最小翻转次数","frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"articleLive":2,"formTitle":"[996]正方形数组的数目","frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"articleLive":2,"formTitle":"[997]找到小镇的法官","frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"articleLive":2,"formTitle":"[998]最大二叉树 II","frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"articleLive":2,"formTitle":"[999]可以被一步捕获的棋子数","frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"articleLive":2,"formTitle":"[1000]合并石头的最低成本","frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"articleLive":2,"formTitle":"[1001]网格照明","frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","title":"网格照明","titleSlug":"grid-illumination"},{"articleLive":2,"formTitle":"[1002]查找常用字符","frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","title":"查找常用字符","titleSlug":"find-common-characters"},{"articleLive":2,"formTitle":"[1003]检查替换后的词是否有效","frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"articleLive":2,"formTitle":"[1004]最大连续1的个数 III","frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"articleLive":2,"formTitle":"[1005]K 次取反后最大化的数组和","frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"articleLive":2,"formTitle":"[1006]笨阶乘","frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","title":"笨阶乘","titleSlug":"clumsy-factorial"},{"articleLive":2,"formTitle":"[1007]行相等的最少多米诺旋转","frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"articleLive":2,"formTitle":"[1008]前序遍历构造二叉搜索树","frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"articleLive":2,"formTitle":"[1009]十进制整数的反码","frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"articleLive":2,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"articleLive":2,"formTitle":"[1011]在 D 天内送达包裹的能力","frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"articleLive":2,"formTitle":"[1012]至少有 1 位重复的数字","frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"articleLive":2,"formTitle":"[1013]将数组分成和相等的三个部分","frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"articleLive":2,"formTitle":"[1014]最佳观光组合","frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"articleLive":2,"formTitle":"[1015]可被 K 整除的最小整数","frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"articleLive":2,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"articleLive":2,"formTitle":"[1017]负二进制转换","frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","title":"负二进制转换","titleSlug":"convert-to-base-2"},{"articleLive":2,"formTitle":"[1018]可被 5 整除的二进制前缀","frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"articleLive":2,"formTitle":"[1019]链表中的下一个更大节点","frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"articleLive":2,"formTitle":"[1020]飞地的数量","frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","title":"飞地的数量","titleSlug":"number-of-enclaves"},{"articleLive":2,"formTitle":"[1021]删除最外层的括号","frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"articleLive":2,"formTitle":"[1022]从根到叶的二进制数之和","frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"articleLive":2,"formTitle":"[1023]驼峰式匹配","frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"articleLive":2,"formTitle":"[1024]视频拼接","frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","title":"视频拼接","titleSlug":"video-stitching"},{"articleLive":2,"formTitle":"[1025]除数博弈","frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","title":"除数博弈","titleSlug":"divisor-game"},{"articleLive":2,"formTitle":"[1026]节点与其祖先之间的最大差值","frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"articleLive":2,"formTitle":"[1027]最长等差数列","frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"articleLive":2,"formTitle":"[1028]从先序遍历还原二叉树","frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"articleLive":2,"formTitle":"[1029]两地调度","frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","title":"两地调度","titleSlug":"two-city-scheduling"},{"articleLive":2,"formTitle":"[1030]距离顺序排列矩阵单元格","frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"articleLive":2,"formTitle":"[1031]两个非重叠子数组的最大和","frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"articleLive":2,"formTitle":"[1032]字符流","frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","title":"字符流","titleSlug":"stream-of-characters"},{"articleLive":2,"formTitle":"[1033]移动石子直到连续","frontendQuestionId":"1033","leaf":true,"level":1,"nodeType":"def","questionId":"1103","status":"","title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"articleLive":2,"formTitle":"[1034]边框着色","frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","title":"边框着色","titleSlug":"coloring-a-border"},{"articleLive":2,"formTitle":"[1035]不相交的线","frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","title":"不相交的线","titleSlug":"uncrossed-lines"},{"articleLive":2,"formTitle":"[1036]逃离大迷宫","frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"articleLive":2,"formTitle":"[1037]有效的回旋镖","frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"articleLive":2,"formTitle":"[1038]把二叉搜索树转换为累加树","frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"articleLive":2,"formTitle":"[1039]多边形三角剖分的最低得分","frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"articleLive":2,"formTitle":"[1040]移动石子直到连续 II","frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"articleLive":2,"formTitle":"[1041]困于环中的机器人","frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"articleLive":2,"formTitle":"[1042]不邻接植花","frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"articleLive":2,"formTitle":"[1043]分隔数组以得到最大和","frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"articleLive":2,"formTitle":"[1044]最长重复子串","frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"articleLive":2,"formTitle":"[1045]买下所有产品的客户","frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"articleLive":2,"formTitle":"[1046]最后一块石头的重量","frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"articleLive":2,"formTitle":"[1047]删除字符串中的所有相邻重复项","frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"articleLive":2,"formTitle":"[1048]最长字符串链","frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","title":"最长字符串链","titleSlug":"longest-string-chain"},{"articleLive":2,"formTitle":"[1049]最后一块石头的重量 II","frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"articleLive":2,"formTitle":"[1050]合作过至少三次的演员和导演","frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"articleLive":2,"formTitle":"[1051]高度检查器","frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","title":"高度检查器","titleSlug":"height-checker"},{"articleLive":2,"formTitle":"[1052]爱生气的书店老板","frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"articleLive":2,"formTitle":"[1053]交换一次的先前排列","frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"articleLive":2,"formTitle":"[1054]距离相等的条形码","frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"articleLive":2,"formTitle":"[1055]形成字符串的最短路径","frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"articleLive":2,"formTitle":"[1056]易混淆数","frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","title":"易混淆数","titleSlug":"confusing-number"},{"articleLive":2,"formTitle":"[1057]校园自行车分配","frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","title":"校园自行车分配","titleSlug":"campus-bikes"},{"articleLive":2,"formTitle":"[1058]最小化舍入误差以满足目标","frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"articleLive":2,"formTitle":"[1059]从始点到终点的所有路径","frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"articleLive":2,"formTitle":"[1060]有序数组中的缺失元素","frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"articleLive":2,"formTitle":"[1061]按字典序排列最小的等效字符串","frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"articleLive":2,"formTitle":"[1062]最长重复子串","frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"articleLive":2,"formTitle":"[1063]有效子数组的数目","frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"articleLive":2,"formTitle":"[1064]不动点","frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","title":"不动点","titleSlug":"fixed-point"},{"articleLive":2,"formTitle":"[1065]字符串的索引对","frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"articleLive":2,"formTitle":"[1066]校园自行车分配 II","frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"articleLive":2,"formTitle":"[1067]范围内的数字计数","frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"articleLive":2,"formTitle":"[1068]产品销售分析 I","frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"articleLive":2,"formTitle":"[1069]产品销售分析 II","frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"articleLive":2,"formTitle":"[1070]产品销售分析 III","frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"articleLive":2,"formTitle":"[1071]字符串的最大公因子","frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"articleLive":2,"formTitle":"[1072]按列翻转得到最大值等行数","frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"articleLive":2,"formTitle":"[1073]负二进制数相加","frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"articleLive":2,"formTitle":"[1074]元素和为目标值的子矩阵数量","frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"articleLive":2,"formTitle":"[1075]项目员工 I","frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","title":"项目员工 I","titleSlug":"project-employees-i"},{"articleLive":2,"formTitle":"[1076]项目员工II","frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","title":"项目员工II","titleSlug":"project-employees-ii"},{"articleLive":2,"formTitle":"[1077]项目员工 III","frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","title":"项目员工 III","titleSlug":"project-employees-iii"},{"articleLive":2,"formTitle":"[1078]Bigram 分词","frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"articleLive":2,"formTitle":"[1079]活字印刷","frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"articleLive":2,"formTitle":"[1080]根到叶路径上的不足节点","frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"articleLive":2,"formTitle":"[1081]不同字符的最小子序列","frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"articleLive":2,"formTitle":"[1082]销售分析 I ","frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"articleLive":2,"formTitle":"[1083]销售分析 II","frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"articleLive":2,"formTitle":"[1084]销售分析III","frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","title":"销售分析III","titleSlug":"sales-analysis-iii"},{"articleLive":2,"formTitle":"[1085]最小元素各数位之和","frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"articleLive":2,"formTitle":"[1086]前五科的均分","frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","title":"前五科的均分","titleSlug":"high-five"},{"articleLive":2,"formTitle":"[1087]花括号展开","frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","title":"花括号展开","titleSlug":"brace-expansion"},{"articleLive":2,"formTitle":"[1088]易混淆数 II","frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"articleLive":2,"formTitle":"[1089]复写零","frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","title":"复写零","titleSlug":"duplicate-zeros"},{"articleLive":2,"formTitle":"[1090]受标签影响的最大值","frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"articleLive":2,"formTitle":"[1091]二进制矩阵中的最短路径","frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"articleLive":2,"formTitle":"[1092]最短公共超序列","frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"articleLive":2,"formTitle":"[1093]大样本统计","frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"articleLive":2,"formTitle":"[1094]拼车","frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","title":"拼车","titleSlug":"car-pooling"},{"articleLive":2,"formTitle":"[1095]山脉数组中查找目标值","frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"articleLive":2,"formTitle":"[1096]花括号展开 II","frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"articleLive":2,"formTitle":"[1097]游戏玩法分析 V","frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"articleLive":2,"formTitle":"[1098]小众书籍","frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","title":"小众书籍","titleSlug":"unpopular-books"},{"articleLive":2,"formTitle":"[1099]小于 K 的两数之和","frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"articleLive":2,"formTitle":"[1100]长度为 K 的无重复字符子串","frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"articleLive":2,"formTitle":"[1101]彼此熟识的最早时间","frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"articleLive":2,"formTitle":"[1102]得分最高的路径","frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"articleLive":2,"formTitle":"[1103]分糖果 II","frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"articleLive":2,"formTitle":"[1104]二叉树寻路","frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"articleLive":2,"formTitle":"[1105]填充书架","frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"articleLive":2,"formTitle":"[1106]解析布尔表达式","frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"articleLive":2,"formTitle":"[1107]每日新用户统计","frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"articleLive":2,"formTitle":"[1108]IP 地址无效化","frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"articleLive":2,"formTitle":"[1109]航班预订统计","frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"articleLive":2,"formTitle":"[1110]删点成林","frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"articleLive":2,"formTitle":"[1111]有效括号的嵌套深度","frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"articleLive":2,"formTitle":"[1112]每位学生的最高成绩","frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"articleLive":2,"formTitle":"[1113]报告的记录","frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","title":"报告的记录","titleSlug":"reported-posts"},{"articleLive":2,"formTitle":"[1114]按序打印","frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","title":"按序打印","titleSlug":"print-in-order"},{"articleLive":2,"formTitle":"[1115]交替打印FooBar","frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"articleLive":2,"formTitle":"[1116]打印零与奇偶数","frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"articleLive":2,"formTitle":"[1117]H2O 生成","frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","title":"H2O 生成","titleSlug":"building-h2o"},{"articleLive":2,"formTitle":"[1118]一月有多少天","frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"articleLive":2,"formTitle":"[1119]删去字符串中的元音","frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"articleLive":2,"formTitle":"[1120]子树的最大平均值","frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"articleLive":2,"formTitle":"[1121]将数组分成几个递增序列","frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"articleLive":2,"formTitle":"[1122]数组的相对排序","frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","title":"数组的相对排序","titleSlug":"relative-sort-array"},{"articleLive":2,"formTitle":"[1123]最深叶节点的最近公共祖先","frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"articleLive":2,"formTitle":"[1124]表现良好的最长时间段","frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"articleLive":2,"formTitle":"[1125]最小的必要团队","frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"articleLive":2,"formTitle":"[1126]查询活跃业务","frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","title":"查询活跃业务","titleSlug":"active-businesses"},{"articleLive":2,"formTitle":"[1127]用户购买平台","frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","title":"用户购买平台","titleSlug":"user-purchase-platform"},{"articleLive":2,"formTitle":"[1128]等价多米诺骨牌对的数量","frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"articleLive":2,"formTitle":"[1129]颜色交替的最短路径","frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"articleLive":2,"formTitle":"[1130]叶值的最小代价生成树","frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"articleLive":2,"formTitle":"[1131]绝对值表达式的最大值","frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"articleLive":2,"formTitle":"[1132]报告的记录 II","frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"articleLive":2,"formTitle":"[1133]最大唯一数","frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","title":"最大唯一数","titleSlug":"largest-unique-number"},{"articleLive":2,"formTitle":"[1134]阿姆斯特朗数","frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"articleLive":2,"formTitle":"[1135]最低成本联通所有城市","frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"articleLive":2,"formTitle":"[1136]平行课程","frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","title":"平行课程","titleSlug":"parallel-courses"},{"articleLive":2,"formTitle":"[1137]第 N 个泰波那契数","frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"articleLive":2,"formTitle":"[1138]字母板上的路径","frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"articleLive":2,"formTitle":"[1139]最大的以 1 为边界的正方形","frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"articleLive":2,"formTitle":"[1140]石子游戏 II","frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","title":"石子游戏 II","titleSlug":"stone-game-ii"},{"articleLive":2,"formTitle":"[1141]查询近30天活跃用户数","frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"articleLive":2,"formTitle":"[1142]过去30天的用户活动 II","frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"articleLive":2,"formTitle":"[1143]最长公共子序列","frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"articleLive":2,"formTitle":"[1144]递减元素使数组呈锯齿状","frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"articleLive":2,"formTitle":"[1145]二叉树着色游戏","frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"articleLive":2,"formTitle":"[1146]快照数组","frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","title":"快照数组","titleSlug":"snapshot-array"},{"articleLive":2,"formTitle":"[1147]段式回文","frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"articleLive":2,"formTitle":"[1148]文章浏览 I","frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","title":"文章浏览 I","titleSlug":"article-views-i"},{"articleLive":2,"formTitle":"[1149]文章浏览 II","frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","title":"文章浏览 II","titleSlug":"article-views-ii"},{"articleLive":2,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"articleLive":2,"formTitle":"[1151]最少交换次数来组合所有的 1","frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"articleLive":2,"formTitle":"[1152]用户网站访问行为分析","frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"articleLive":2,"formTitle":"[1153]字符串转化","frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"articleLive":2,"formTitle":"[1154]一年中的第几天","frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","title":"一年中的第几天","titleSlug":"day-of-the-year"},{"articleLive":2,"formTitle":"[1155]掷骰子的N种方法","frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"articleLive":2,"formTitle":"[1156]单字符重复子串的最大长度","frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"articleLive":2,"formTitle":"[1157]子数组中占绝大多数的元素","frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"articleLive":2,"formTitle":"[1158]市场分析 I","frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","title":"市场分析 I","titleSlug":"market-analysis-i"},{"articleLive":2,"formTitle":"[1159]市场分析 II","frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","title":"市场分析 II","titleSlug":"market-analysis-ii"},{"articleLive":2,"formTitle":"[1160]拼写单词","frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"articleLive":2,"formTitle":"[1161]最大层内元素和","frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"articleLive":2,"formTitle":"[1162]地图分析","frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"articleLive":2,"formTitle":"[1163]按字典序排在最后的子串","frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"articleLive":2,"formTitle":"[1164]指定日期的产品价格","frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"articleLive":2,"formTitle":"[1165]单行键盘","frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","title":"单行键盘","titleSlug":"single-row-keyboard"},{"articleLive":2,"formTitle":"[1166]设计文件系统","frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","title":"设计文件系统","titleSlug":"design-file-system"},{"articleLive":2,"formTitle":"[1167]连接棒材的最低费用","frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"articleLive":2,"formTitle":"[1168]水资源分配优化","frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"articleLive":2,"formTitle":"[1169]查询无效交易","frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","title":"查询无效交易","titleSlug":"invalid-transactions"},{"articleLive":2,"formTitle":"[1170]比较字符串最小字母出现频次","frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"articleLive":2,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"articleLive":2,"formTitle":"[1172]餐盘栈","frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"articleLive":2,"formTitle":"[1173]即时食物配送 I","frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"articleLive":2,"formTitle":"[1174]即时食物配送 II","frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"articleLive":2,"formTitle":"[1175]质数排列","frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","title":"质数排列","titleSlug":"prime-arrangements"},{"articleLive":2,"formTitle":"[1176]健身计划评估","frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","title":"健身计划评估","titleSlug":"diet-plan-performance"},{"articleLive":2,"formTitle":"[1177]构建回文串检测","frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"articleLive":2,"formTitle":"[1178]猜字谜","frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"articleLive":2,"formTitle":"[1179]重新格式化部门表","frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"articleLive":2,"formTitle":"[1180]统计只含单一字母的子串","frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"articleLive":2,"formTitle":"[1181]前后拼接","frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"articleLive":2,"formTitle":"[1182]与目标颜色间的最短距离","frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"articleLive":2,"formTitle":"[1183]矩阵中 1 的最大数量","frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"articleLive":2,"formTitle":"[1184]公交站间的距离","frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"articleLive":2,"formTitle":"[1185]一周中的第几天","frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","title":"一周中的第几天","titleSlug":"day-of-the-week"},{"articleLive":2,"formTitle":"[1186]删除一次得到子数组最大和","frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"articleLive":2,"formTitle":"[1187]使数组严格递增","frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"articleLive":2,"formTitle":"[1188]设计有限阻塞队列","frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"articleLive":2,"formTitle":"[1189]“气球” 的最大数量","frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"articleLive":2,"formTitle":"[1190]反转每对括号间的子串","frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"articleLive":2,"formTitle":"[1191]K 次串联后最大子数组之和","frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"articleLive":2,"formTitle":"[1192]查找集群内的「关键连接」","frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"articleLive":2,"formTitle":"[1193]每月交易 I","frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"articleLive":2,"formTitle":"[1194]锦标赛优胜者","frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"articleLive":2,"formTitle":"[1195]交替打印字符串","frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"articleLive":2,"formTitle":"[1196]最多可以买到的苹果数量","frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"articleLive":2,"formTitle":"[1197]进击的骑士","frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"articleLive":2,"formTitle":"[1198]找出所有行中最小公共元素","frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"articleLive":2,"formTitle":"[1199]建造街区的最短时间","frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"articleLive":2,"formTitle":"[1200]最小绝对差","frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"articleLive":2,"formTitle":"[1201]丑数 III","frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","title":"丑数 III","titleSlug":"ugly-number-iii"},{"articleLive":2,"formTitle":"[1202]交换字符串中的元素","frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"articleLive":2,"formTitle":"[1203]项目管理","frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"articleLive":2,"formTitle":"[1204]最后一个能进入电梯的人","frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-elevator"},{"articleLive":2,"formTitle":"[1205]每月交易II","frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"articleLive":2,"formTitle":"[1206]设计跳表","frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","title":"设计跳表","titleSlug":"design-skiplist"},{"articleLive":2,"formTitle":"[1207]独一无二的出现次数","frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"articleLive":2,"formTitle":"[1208]尽可能使字符串相等","frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"articleLive":2,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"articleLive":2,"formTitle":"[1210]穿过迷宫的最少移动次数","frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"articleLive":2,"formTitle":"[1211]查询结果的质量和占比","frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"articleLive":2,"formTitle":"[1212]查询球队积分","frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"articleLive":2,"formTitle":"[1213]三个有序数组的交集","frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"articleLive":2,"formTitle":"[1214]查找两棵二叉搜索树之和","frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"articleLive":2,"formTitle":"[1215]步进数","frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","title":"步进数","titleSlug":"stepping-numbers"},{"articleLive":2,"formTitle":"[1216]验证回文字符串 III","frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"articleLive":2,"formTitle":"[1217]玩筹码","frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"articleLive":2,"formTitle":"[1218]最长定差子序列","frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"articleLive":2,"formTitle":"[1219]黄金矿工","frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"articleLive":2,"formTitle":"[1220]统计元音字母序列的数目","frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"articleLive":2,"formTitle":"[1221]分割平衡字符串","frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"articleLive":2,"formTitle":"[1222]可以攻击国王的皇后","frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"articleLive":2,"formTitle":"[1223]掷骰子模拟","frontendQuestionId":"1223","leaf":true,"level":2,"nodeType":"def","questionId":"1343","status":"","title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"articleLive":2,"formTitle":"[1224]最大相等频率","frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"articleLive":2,"formTitle":"[1225]报告系统状态的连续日期","frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"articleLive":2,"formTitle":"[1226]哲学家进餐","frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"articleLive":2,"formTitle":"[1227]飞机座位分配概率","frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"articleLive":2,"formTitle":"[1228]等差数列中缺失的数字","frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"articleLive":2,"formTitle":"[1229]安排会议日程","frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","title":"安排会议日程","titleSlug":"meeting-scheduler"},{"articleLive":2,"formTitle":"[1230]抛掷硬币","frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"articleLive":2,"formTitle":"[1231]分享巧克力","frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","title":"分享巧克力","titleSlug":"divide-chocolate"},{"articleLive":2,"formTitle":"[1232]缀点成线","frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"articleLive":2,"formTitle":"[1233]删除子文件夹","frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"articleLive":2,"formTitle":"[1234]替换子串得到平衡字符串","frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"articleLive":2,"formTitle":"[1235]规划兼职工作","frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"articleLive":2,"formTitle":"[1236]网络爬虫","frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","title":"网络爬虫","titleSlug":"web-crawler"},{"articleLive":2,"formTitle":"[1237]找出给定方程的正整数解","frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"articleLive":2,"formTitle":"[1238]循环码排列","frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"articleLive":2,"formTitle":"[1239]串联字符串的最大长度","frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"articleLive":2,"formTitle":"[1240]铺瓷砖","frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"articleLive":2,"formTitle":"[1241]每个帖子的评论数","frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"articleLive":2,"formTitle":"[1242]多线程网页爬虫","frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"articleLive":2,"formTitle":"[1243]数组变换","frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","title":"数组变换","titleSlug":"array-transformation"},{"articleLive":2,"formTitle":"[1244]力扣排行榜","frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"articleLive":2,"formTitle":"[1245]树的直径","frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","title":"树的直径","titleSlug":"tree-diameter"},{"articleLive":2,"formTitle":"[1246]删除回文子数组","frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","title":"删除回文子数组","titleSlug":"palindrome-removal"},{"articleLive":2,"formTitle":"[1247]交换字符使得字符串相同","frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"articleLive":2,"formTitle":"[1248]统计「优美子数组」","frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"articleLive":2,"formTitle":"[1249]移除无效的括号","frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"","title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"articleLive":2,"formTitle":"[1250]检查「好数组」","frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"articleLive":2,"formTitle":"[1251]平均售价","frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","title":"平均售价","titleSlug":"average-selling-price"},{"articleLive":2,"formTitle":"[1252]奇数值单元格的数目","frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"articleLive":2,"formTitle":"[1253]重构 2 行二进制矩阵","frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"articleLive":2,"formTitle":"[1254]统计封闭岛屿的数目","frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"","title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"articleLive":2,"formTitle":"[1255]得分最高的单词集合","frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"articleLive":2,"formTitle":"[1256]加密数字","frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","title":"加密数字","titleSlug":"encode-number"},{"articleLive":2,"formTitle":"[1257]最小公共区域","frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","title":"最小公共区域","titleSlug":"smallest-common-region"},{"articleLive":2,"formTitle":"[1258]近义词句子","frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","title":"近义词句子","titleSlug":"synonymous-sentences"},{"articleLive":2,"formTitle":"[1259]不相交的握手","frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"articleLive":2,"formTitle":"[1260]二维网格迁移","frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"articleLive":2,"formTitle":"[1261]在受污染的二叉树中查找元素","frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"articleLive":2,"formTitle":"[1262]可被三整除的最大和","frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"articleLive":2,"formTitle":"[1263]推箱子","frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"articleLive":2,"formTitle":"[1264]页面推荐","frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","title":"页面推荐","titleSlug":"page-recommendations"},{"articleLive":2,"formTitle":"[1265]逆序打印不可变链表","frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"articleLive":2,"formTitle":"[1266]访问所有点的最小时间","frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"articleLive":2,"formTitle":"[1267]统计参与通信的服务器","frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"articleLive":2,"formTitle":"[1268]搜索推荐系统","frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"articleLive":2,"formTitle":"[1269]停在原地的方案数","frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"","title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"articleLive":2,"formTitle":"[1270]向公司CEO汇报工作的所有人","frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"articleLive":2,"formTitle":"[1271]十六进制魔术数字","frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","title":"十六进制魔术数字","titleSlug":"hexspeak"},{"articleLive":2,"formTitle":"[1272]删除区间","frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","title":"删除区间","titleSlug":"remove-interval"},{"articleLive":2,"formTitle":"[1273]删除树节点","frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","title":"删除树节点","titleSlug":"delete-tree-nodes"},{"articleLive":2,"formTitle":"[1274]矩形内船只的数目","frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"articleLive":2,"formTitle":"[1275]找出井字棋的获胜者","frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"articleLive":2,"formTitle":"[1276]不浪费原料的汉堡制作方案","frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"articleLive":2,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"articleLive":2,"formTitle":"[1278]分割回文串 III","frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"articleLive":2,"formTitle":"[1279]红绿灯路口","frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"articleLive":2,"formTitle":"[1280]学生们参加各科测试的次数","frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"articleLive":2,"formTitle":"[1281]整数的各位积和之差","frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"articleLive":2,"formTitle":"[1282]用户分组","frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"articleLive":2,"formTitle":"[1283]使结果不超过阈值的最小除数","frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"articleLive":2,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"articleLive":2,"formTitle":"[1285]找到连续区间的开始和结束数字","frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"articleLive":2,"formTitle":"[1286]字母组合迭代器","frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"articleLive":2,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"articleLive":2,"formTitle":"[1288]删除被覆盖区间","frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"articleLive":2,"formTitle":"[1289]下降路径最小和  II","frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"articleLive":2,"formTitle":"[1290]二进制链表转整数","frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"articleLive":2,"formTitle":"[1291]顺次数","frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","title":"顺次数","titleSlug":"sequential-digits"},{"articleLive":2,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"articleLive":2,"formTitle":"[1293]网格中的最短路径","frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"articleLive":2,"formTitle":"[1294]不同国家的天气类型","frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"articleLive":2,"formTitle":"[1295]统计位数为偶数的数字","frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"articleLive":2,"formTitle":"[1296]划分数组为连续数字的集合","frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"articleLive":2,"formTitle":"[1297]子串的最大出现次数","frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"articleLive":2,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"articleLive":2,"formTitle":"[1299]将每个元素替换为右侧最大元素","frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"articleLive":2,"formTitle":"[1300]转变数组后最接近目标值的数组和","frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"articleLive":2,"formTitle":"[1301]最大得分的路径数目","frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"articleLive":2,"formTitle":"[1302]层数最深叶子节点的和","frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"articleLive":2,"formTitle":"[1303]求团队人数","frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","title":"求团队人数","titleSlug":"find-the-team-size"},{"articleLive":2,"formTitle":"[1304]和为零的N个唯一整数","frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"articleLive":2,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"articleLive":2,"formTitle":"[1306]跳跃游戏 III","frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"articleLive":2,"formTitle":"[1307]口算难题","frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"articleLive":2,"formTitle":"[1308]不同性别每日分数总计","frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"articleLive":2,"formTitle":"[1309]解码字母到整数映射","frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"articleLive":2,"formTitle":"[1310]子数组异或查询","frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"","title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"articleLive":2,"formTitle":"[1311]获取你好友已观看的视频","frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"articleLive":2,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"articleLive":2,"formTitle":"[1313]解压缩编码列表","frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"articleLive":2,"formTitle":"[1314]矩阵区域和","frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"articleLive":2,"formTitle":"[1315]祖父节点值为偶数的节点和","frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"articleLive":2,"formTitle":"[1316]不同的循环子字符串","frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"articleLive":2,"formTitle":"[1317]将整数转换为两个无零整数的和","frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"articleLive":2,"formTitle":"[1318]或运算的最小翻转次数","frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"articleLive":2,"formTitle":"[1319]连通网络的操作次数","frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"articleLive":2,"formTitle":"[1320]二指输入的的最小距离","frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"articleLive":2,"formTitle":"[1321]餐馆营业额变化增长","frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"articleLive":2,"formTitle":"[1322]广告效果","frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","title":"广告效果","titleSlug":"ads-performance"},{"articleLive":2,"formTitle":"[1323]6 和 9 组成的最大数字","frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"articleLive":2,"formTitle":"[1324]竖直打印单词","frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","title":"竖直打印单词","titleSlug":"print-words-vertically"},{"articleLive":2,"formTitle":"[1325]删除给定值的叶子节点","frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"articleLive":2,"formTitle":"[1326]灌溉花园的最少水龙头数目","frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"articleLive":2,"formTitle":"[1327]列出指定时间段内所有的下单产品","frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"articleLive":2,"formTitle":"[1328]破坏回文串","frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","title":"破坏回文串","titleSlug":"break-a-palindrome"},{"articleLive":2,"formTitle":"[1329]将矩阵按对角线排序","frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"articleLive":2,"formTitle":"[1330]翻转子数组得到最大的数组值","frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"articleLive":2,"formTitle":"[1331]数组序号转换","frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"articleLive":2,"formTitle":"[1332]删除回文子序列","frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"articleLive":2,"formTitle":"[1333]餐厅过滤器","frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"articleLive":2,"formTitle":"[1334]阈值距离内邻居最少的城市","frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"articleLive":2,"formTitle":"[1335]工作计划的最低难度","frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"articleLive":2,"formTitle":"[1336]每次访问的交易次数","frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"articleLive":2,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"","title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"articleLive":2,"formTitle":"[1338]数组大小减半","frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"","title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"articleLive":2,"formTitle":"[1339]分裂二叉树的最大乘积","frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"articleLive":2,"formTitle":"[1340]跳跃游戏 V","frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"articleLive":2,"formTitle":"[1341]电影评分","frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","title":"电影评分","titleSlug":"movie-rating"},{"articleLive":2,"formTitle":"[1342]将数字变成 0 的操作次数","frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"articleLive":2,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"articleLive":2,"formTitle":"[1344]时钟指针的夹角","frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"articleLive":2,"formTitle":"[1345]跳跃游戏 IV","frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"articleLive":2,"formTitle":"[1346]检查整数及其两倍数是否存在","frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"articleLive":2,"formTitle":"[1347]制造字母异位词的最小步骤数","frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"articleLive":2,"formTitle":"[1348]推文计数","frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"articleLive":2,"formTitle":"[1349]参加考试的最大学生数","frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"articleLive":2,"formTitle":"[1350]院系无效的学生","frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"articleLive":2,"formTitle":"[1351]统计有序矩阵中的负数","frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"articleLive":2,"formTitle":"[1352]最后 K 个数的乘积","frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"articleLive":2,"formTitle":"[1353]最多可以参加的会议数目","frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"articleLive":2,"formTitle":"[1354]多次求和构造目标数组","frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"articleLive":2,"formTitle":"[1355]活动参与者","frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","title":"活动参与者","titleSlug":"activity-participants"},{"articleLive":2,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"articleLive":2,"formTitle":"[1357]每隔 n 个顾客打折","frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"articleLive":2,"formTitle":"[1358]包含所有三种字符的子字符串数目","frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"articleLive":2,"formTitle":"[1359]有效的快递序列数目","frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"articleLive":2,"formTitle":"[1360]日期之间隔几天","frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"articleLive":2,"formTitle":"[1361]验证二叉树","frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"articleLive":2,"formTitle":"[1362]最接近的因数","frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","title":"最接近的因数","titleSlug":"closest-divisors"},{"articleLive":2,"formTitle":"[1363]形成三的最大倍数","frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"articleLive":2,"formTitle":"[1364]顾客的可信联系人数量","frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"articleLive":2,"formTitle":"[1365]有多少小于当前数字的数字","frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"articleLive":2,"formTitle":"[1366]通过投票对团队排名","frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"articleLive":2,"formTitle":"[1367]二叉树中的列表","frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"articleLive":2,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"articleLive":2,"formTitle":"[1369]获取最近第二次的活动","frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"articleLive":2,"formTitle":"[1370]上升下降字符串","frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"articleLive":2,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"articleLive":2,"formTitle":"[1372]二叉树中的最长交错路径","frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1373]二叉搜索子树的最大键值和","frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"articleLive":2,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"articleLive":2,"formTitle":"[1375]灯泡开关 III","frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"articleLive":2,"formTitle":"[1376]通知所有员工所需的时间","frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"articleLive":2,"formTitle":"[1377]T 秒后青蛙的位置","frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"articleLive":2,"formTitle":"[1378]使用唯一标识码替换员工ID","frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"articleLive":2,"formTitle":"[1379]找出克隆二叉树中的相同节点","frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"articleLive":2,"formTitle":"[1380]矩阵中的幸运数","frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"articleLive":2,"formTitle":"[1381]设计一个支持增量操作的栈","frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"","title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"articleLive":2,"formTitle":"[1382]将二叉搜索树变平衡","frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"articleLive":2,"formTitle":"[1383]最大的团队表现值","frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"articleLive":2,"formTitle":"[1384]按年度列出销售总额","frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"articleLive":2,"formTitle":"[1385]两个数组间的距离值","frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"articleLive":2,"formTitle":"[1386]安排电影院座位","frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"articleLive":2,"formTitle":"[1387]将整数按权重排序","frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"articleLive":2,"formTitle":"[1388]3n 块披萨","frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"articleLive":2,"formTitle":"[1389]按既定顺序创建目标数组","frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"articleLive":2,"formTitle":"[1390]四因数","frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","title":"四因数","titleSlug":"four-divisors"},{"articleLive":2,"formTitle":"[1391]检查网格中是否存在有效路径","frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"articleLive":2,"formTitle":"[1392]最长快乐前缀","frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"articleLive":2,"formTitle":"[1393]股票的资本损益","frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","title":"股票的资本损益","titleSlug":"capital-gainloss"},{"articleLive":2,"formTitle":"[1394]找出数组中的幸运数","frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"articleLive":2,"formTitle":"[1395]统计作战单位数","frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"articleLive":2,"formTitle":"[1396]设计地铁系统","frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","title":"设计地铁系统","titleSlug":"design-underground-system"},{"articleLive":2,"formTitle":"[1397]找到所有好字符串","frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"articleLive":2,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"articleLive":2,"formTitle":"[1399]统计最大组的数目","frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","title":"统计最大组的数目","titleSlug":"count-largest-group"},{"articleLive":2,"formTitle":"[1400]构造 K 个回文字符串","frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"articleLive":2,"formTitle":"[1401]圆和矩形是否有重叠","frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"articleLive":2,"formTitle":"[1402]做菜顺序","frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","title":"做菜顺序","titleSlug":"reducing-dishes"},{"articleLive":2,"formTitle":"[1403]非递增顺序的最小子序列","frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"articleLive":2,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"articleLive":2,"formTitle":"[1405]最长快乐字符串","frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"articleLive":2,"formTitle":"[1406]石子游戏 III","frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","title":"石子游戏 III","titleSlug":"stone-game-iii"},{"articleLive":2,"formTitle":"[1407]排名靠前的旅行者","frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"articleLive":2,"formTitle":"[1408]数组中的字符串匹配","frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"articleLive":2,"formTitle":"[1409]查询带键的排列","frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"articleLive":2,"formTitle":"[1410]HTML 实体解析器","frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"","title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"articleLive":2,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"articleLive":2,"formTitle":"[1412]查找成绩处于中游的学生","frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"articleLive":2,"formTitle":"[1413]逐步求和得到正数的最小值","frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"articleLive":2,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"articleLive":2,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"articleLive":2,"formTitle":"[1416]恢复数组","frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","title":"恢复数组","titleSlug":"restore-the-array"},{"articleLive":2,"formTitle":"[1417]重新格式化字符串","frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"articleLive":2,"formTitle":"[1418]点菜展示表","frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"","title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"articleLive":2,"formTitle":"[1419]数青蛙","frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"articleLive":2,"formTitle":"[1420]生成数组","frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"articleLive":2,"formTitle":"[1421]净现值查询","frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","title":"净现值查询","titleSlug":"npv-queries"},{"articleLive":2,"formTitle":"[1422]分割字符串的最大得分","frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"articleLive":2,"formTitle":"[1423]可获得的最大点数","frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"","title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"articleLive":2,"formTitle":"[1424]对角线遍历 II","frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"articleLive":2,"formTitle":"[1425]带限制的子序列和","frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"articleLive":2,"formTitle":"[1426]数元素","frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","title":"数元素","titleSlug":"counting-elements"},{"articleLive":2,"formTitle":"[1427]字符串的左右移","frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"articleLive":2,"formTitle":"[1428]至少有一个 1 的最左端列","frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"articleLive":2,"formTitle":"[1429]第一个唯一数字","frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","title":"第一个唯一数字","titleSlug":"first-unique-number"},{"articleLive":2,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1431]拥有最多糖果的孩子","frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"articleLive":2,"formTitle":"[1432]改变一个整数能得到的最大差值","frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"articleLive":2,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"articleLive":2,"formTitle":"[1434]每个人戴不同帽子的方案数","frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"articleLive":2,"formTitle":"[1435]制作会话柱状图","frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"articleLive":2,"formTitle":"[1436]旅行终点站","frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","title":"旅行终点站","titleSlug":"destination-city"},{"articleLive":2,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"articleLive":2,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"articleLive":2,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"articleLive":2,"formTitle":"[1440]计算布尔表达式的值","frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"articleLive":2,"formTitle":"[1441]用栈操作构建数组","frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"articleLive":2,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"","title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"articleLive":2,"formTitle":"[1443]收集树上所有苹果的最少时间","frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"articleLive":2,"formTitle":"[1444]切披萨的方案数","frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"articleLive":2,"formTitle":"[1445]苹果和桔子","frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","title":"苹果和桔子","titleSlug":"apples-oranges"},{"articleLive":2,"formTitle":"[1446]连续字符","frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","title":"连续字符","titleSlug":"consecutive-characters"},{"articleLive":2,"formTitle":"[1447]最简分数","frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","title":"最简分数","titleSlug":"simplified-fractions"},{"articleLive":2,"formTitle":"[1448]统计二叉树中好节点的数目","frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"articleLive":2,"formTitle":"[1449]数位成本和为目标值的最大数字","frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"","title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"articleLive":2,"formTitle":"[1450]在既定时间做作业的学生人数","frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"articleLive":2,"formTitle":"[1451]重新排列句子中的单词","frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"articleLive":2,"formTitle":"[1452]收藏清单","frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"articleLive":2,"formTitle":"[1453]圆形靶内的最大飞镖数量","frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"articleLive":2,"formTitle":"[1454]活跃用户","frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","title":"活跃用户","titleSlug":"active-users"},{"articleLive":2,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"articleLive":2,"formTitle":"[1456]定长子串中元音的最大数目","frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"articleLive":2,"formTitle":"[1457]二叉树中的伪回文路径","frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1458]两个子序列的最大点积","frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"articleLive":2,"formTitle":"[1459]矩形面积","frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","title":"矩形面积","titleSlug":"rectangles-area"},{"articleLive":2,"formTitle":"[1460]通过翻转子数组使两个数组相等","frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"","title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"articleLive":2,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"articleLive":2,"formTitle":"[1462]课程表 IV","frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","title":"课程表 IV","titleSlug":"course-schedule-iv"},{"articleLive":2,"formTitle":"[1463]摘樱桃 II","frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"articleLive":2,"formTitle":"[1464]数组中两元素的最大乘积","frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"articleLive":2,"formTitle":"[1465]切割后面积最大的蛋糕","frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"articleLive":2,"formTitle":"[1466]重新规划路线","frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"articleLive":2,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"articleLive":2,"formTitle":"[1468]计算税后工资","frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","title":"计算税后工资","titleSlug":"calculate-salaries"},{"articleLive":2,"formTitle":"[1469]寻找所有的独生节点","frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"articleLive":2,"formTitle":"[1470]重新排列数组","frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","title":"重新排列数组","titleSlug":"shuffle-the-array"},{"articleLive":2,"formTitle":"[1471]数组中的 k 个最强值","frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"articleLive":2,"formTitle":"[1472]设计浏览器历史记录","frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"articleLive":2,"formTitle":"[1473]粉刷房子 III","frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"articleLive":2,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"articleLive":2,"formTitle":"[1475]商品折扣后的最终价格","frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"articleLive":2,"formTitle":"[1476]子矩形查询","frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","title":"子矩形查询","titleSlug":"subrectangle-queries"},{"articleLive":2,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"articleLive":2,"formTitle":"[1478]安排邮筒","frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"articleLive":2,"formTitle":"[1479]周内每天的销售情况","frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"articleLive":2,"formTitle":"[1480]一维数组的动态和","frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"articleLive":2,"formTitle":"[1481]不同整数的最少数目","frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"articleLive":2,"formTitle":"[1482]制作 m 束花所需的最少天数","frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"","title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"articleLive":2,"formTitle":"[1483]树节点的第 K 个祖先","frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"articleLive":2,"formTitle":"[1484]克隆含随机指针的二叉树","frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"articleLive":2,"formTitle":"[1485]按日期分组销售产品","frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"articleLive":2,"formTitle":"[1486]数组异或操作","frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"","title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"articleLive":2,"formTitle":"[1487]保证文件名唯一","frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"articleLive":2,"formTitle":"[1488]避免洪水泛滥","frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"articleLive":2,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"articleLive":2,"formTitle":"[1490]克隆 N 叉树","frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"articleLive":2,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"articleLive":2,"formTitle":"[1492]n 的第 k 个因子","frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"articleLive":2,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"articleLive":2,"formTitle":"[1494]并行课程 II","frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"articleLive":2,"formTitle":"[1495]上月播放的儿童适宜电影","frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"articleLive":2,"formTitle":"[1496]判断路径是否相交","frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","title":"判断路径是否相交","titleSlug":"path-crossing"},{"articleLive":2,"formTitle":"[1497]检查数组对是否可以被 k 整除","frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"articleLive":2,"formTitle":"[1498]满足条件的子序列数目","frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"articleLive":2,"formTitle":"[1499]满足不等式的最大值","frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"articleLive":2,"formTitle":"[1500]设计文件分享系统","frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"articleLive":2,"formTitle":"[1501]可以放心投资的国家","frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"articleLive":2,"formTitle":"[1502]判断能否形成等差数列","frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"articleLive":2,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"articleLive":2,"formTitle":"[1504]统计全 1 子矩形","frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"articleLive":2,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"articleLive":2,"formTitle":"[1506]找到 N 叉树的根节点","frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1507]转变日期格式","frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","title":"转变日期格式","titleSlug":"reformat-date"},{"articleLive":2,"formTitle":"[1508]子数组和排序后的区间和","frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"articleLive":2,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"articleLive":2,"formTitle":"[1510]石子游戏 IV","frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"articleLive":2,"formTitle":"[1511]消费者下单频率","frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"articleLive":2,"formTitle":"[1512]好数对的数目","frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"articleLive":2,"formTitle":"[1513]仅含 1 的子串数","frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"articleLive":2,"formTitle":"[1514]概率最大的路径","frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"articleLive":2,"formTitle":"[1515]服务中心的最佳位置","frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"articleLive":2,"formTitle":"[1516]移动 N 叉树的子树","frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1517]查找拥有有效邮箱的用户","frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"articleLive":2,"formTitle":"[1518]换酒问题","frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","title":"换酒问题","titleSlug":"water-bottles"},{"articleLive":2,"formTitle":"[1519]子树中标签相同的节点数","frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"articleLive":2,"formTitle":"[1520]最多的不重叠子字符串","frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"articleLive":2,"formTitle":"[1521]找到最接近目标值的函数值","frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"articleLive":2,"formTitle":"[1522]N 叉树的直径","frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1523]在区间范围内统计奇数数目","frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"articleLive":2,"formTitle":"[1524]和为奇数的子数组数目","frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"articleLive":2,"formTitle":"[1525]字符串的好分割数目","frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"articleLive":2,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"articleLive":2,"formTitle":"[1527]患某种疾病的患者","frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"articleLive":2,"formTitle":"[1528]重新排列字符串","frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","title":"重新排列字符串","titleSlug":"shuffle-string"},{"articleLive":2,"formTitle":"[1529]灯泡开关 IV","frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"articleLive":2,"formTitle":"[1530]好叶子节点对的数量","frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"articleLive":2,"formTitle":"[1531]压缩字符串 II","frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"articleLive":2,"formTitle":"[1532]最近的三笔订单","frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"articleLive":2,"formTitle":"[1533]找到最大整数的索引","frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"articleLive":2,"formTitle":"[1534]统计好三元组","frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","title":"统计好三元组","titleSlug":"count-good-triplets"},{"articleLive":2,"formTitle":"[1535]找出数组游戏的赢家","frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"articleLive":2,"formTitle":"[1536]排布二进制网格的最少交换次数","frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"articleLive":2,"formTitle":"[1537]最大得分","frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","title":"最大得分","titleSlug":"get-the-maximum-score"},{"articleLive":2,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"articleLive":2,"formTitle":"[1539]第 k 个缺失的正整数","frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"articleLive":2,"formTitle":"[1540]K 次操作转变字符串","frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"articleLive":2,"formTitle":"[1541]平衡括号字符串的最少插入次数","frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"","title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"articleLive":2,"formTitle":"[1542]找出最长的超赞子字符串","frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"articleLive":2,"formTitle":"[1543]产品名称格式修复","frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"articleLive":2,"formTitle":"[1544]整理字符串","frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","title":"整理字符串","titleSlug":"make-the-string-great"},{"articleLive":2,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"articleLive":2,"formTitle":"[1546]和为目标值的最大数目不重叠非空子数组数目","frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","title":"和为目标值的最大数目不重叠非空子数组数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"articleLive":2,"formTitle":"[1547]切棍子的最小成本","frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"articleLive":2,"formTitle":"[1548]图中最相似的路径","frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"articleLive":2,"formTitle":"[1549]每件商品的最新订单","frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"articleLive":2,"formTitle":"[1550]存在连续三个奇数的数组","frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"articleLive":2,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"articleLive":2,"formTitle":"[1552]两球之间的磁力","frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"articleLive":2,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"articleLive":2,"formTitle":"[1554]只有一个不同字符的字符串","frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"articleLive":2,"formTitle":"[1555]银行账户概要","frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","title":"银行账户概要","titleSlug":"bank-account-summary"},{"articleLive":2,"formTitle":"[1556]千位分隔数","frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","title":"千位分隔数","titleSlug":"thousand-separator"},{"articleLive":2,"formTitle":"[1557]可以到达所有点的最少点数目","frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"articleLive":2,"formTitle":"[1558]得到目标数组的最少函数调用次数","frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"articleLive":2,"formTitle":"[1559]二维网格图中探测环","frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"articleLive":2,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"articleLive":2,"formTitle":"[1561]你可以获得的最大硬币数目","frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"articleLive":2,"formTitle":"[1562]查找大小为 M 的最新分组","frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"articleLive":2,"formTitle":"[1563]石子游戏 V","frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","title":"石子游戏 V","titleSlug":"stone-game-v"},{"articleLive":2,"formTitle":"[1564]把箱子放进仓库里 I","frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"articleLive":2,"formTitle":"[1565]按月统计订单数与顾客数","frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"articleLive":2,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"articleLive":2,"formTitle":"[1567]乘积为正数的最长子数组长度","frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"articleLive":2,"formTitle":"[1568]使陆地分离的最少天数","frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"articleLive":2,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"articleLive":2,"formTitle":"[1570]两个稀疏向量的点积","frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"articleLive":2,"formTitle":"[1571]仓库经理","frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","title":"仓库经理","titleSlug":"warehouse-manager"},{"articleLive":2,"formTitle":"[1572]矩阵对角线元素的和","frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"articleLive":2,"formTitle":"[1573]分割字符串的方案数","frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"articleLive":2,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"articleLive":2,"formTitle":"[1575]统计所有可行路径","frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"articleLive":2,"formTitle":"[1576]替换所有的问号","frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"articleLive":2,"formTitle":"[1577]数的平方等于两数乘积的方法数","frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"articleLive":2,"formTitle":"[1578]避免重复字母的最小删除成本","frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"articleLive":2,"formTitle":"[1579]保证图可完全遍历","frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"articleLive":2,"formTitle":"[1580]把箱子放进仓库里 II","frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"articleLive":2,"formTitle":"[1581]进店却未进行过交易的顾客","frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"articleLive":2,"formTitle":"[1582]二进制矩阵中的特殊位置","frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"articleLive":2,"formTitle":"[1583]统计不开心的朋友","frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"articleLive":2,"formTitle":"[1584]连接所有点的最小费用","frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"articleLive":2,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"articleLive":2,"formTitle":"[1586]二叉搜索树迭代器 II","frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"articleLive":2,"formTitle":"[1587]银行账户概要 II","frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"articleLive":2,"formTitle":"[1588]所有奇数长度子数组的和","frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"articleLive":2,"formTitle":"[1589]所有排列中的最大和","frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"articleLive":2,"formTitle":"[1590]使数组和能被 P 整除","frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"articleLive":2,"formTitle":"[1591]奇怪的打印机 II","frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"articleLive":2,"formTitle":"[1592]重新排列单词间的空格","frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"articleLive":2,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"articleLive":2,"formTitle":"[1594]矩阵的最大非负积","frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"articleLive":2,"formTitle":"[1595]连通两组点的最小成本","frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"articleLive":2,"formTitle":"[1596]每位顾客最经常订购的商品","frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"articleLive":2,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"articleLive":2,"formTitle":"[1598]文件夹操作日志搜集器","frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"articleLive":2,"formTitle":"[1599]经营摩天轮的最大利润","frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"articleLive":2,"formTitle":"[1600]皇位继承顺序","frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"articleLive":2,"formTitle":"[1601]最多可达成的换楼请求数目","frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"articleLive":2,"formTitle":"[1602]找到二叉树中最近的右侧节点","frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"articleLive":2,"formTitle":"[1603]设计停车系统","frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","title":"设计停车系统","titleSlug":"design-parking-system"},{"articleLive":2,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"articleLive":2,"formTitle":"[1605]给定行和列的和求可行矩阵","frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"articleLive":2,"formTitle":"[1606]找到处理最多请求的服务器","frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"articleLive":2,"formTitle":"[1607]没有卖出的卖家","frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"articleLive":2,"formTitle":"[1608]特殊数组的特征值","frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"articleLive":2,"formTitle":"[1609]奇偶树","frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","title":"奇偶树","titleSlug":"even-odd-tree"},{"articleLive":2,"formTitle":"[1610]可见点的最大数目","frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"articleLive":2,"formTitle":"[1611]使整数变为 0 的最少操作次数","frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"articleLive":2,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"articleLive":2,"formTitle":"[1613]找到遗失的ID","frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"articleLive":2,"formTitle":"[1614]括号的最大嵌套深度","frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"articleLive":2,"formTitle":"[1615]最大网络秩","frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","title":"最大网络秩","titleSlug":"maximal-network-rank"},{"articleLive":2,"formTitle":"[1616]分割两个字符串得到回文串","frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"articleLive":2,"formTitle":"[1617]统计子树中城市之间最大距离","frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"articleLive":2,"formTitle":"[1618]找出适应屏幕的最大字号","frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"articleLive":2,"formTitle":"[1619]删除某些元素后的数组均值","frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"articleLive":2,"formTitle":"[1620]网络信号最好的坐标","frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"articleLive":2,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"articleLive":2,"formTitle":"[1622]奇妙序列","frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","title":"奇妙序列","titleSlug":"fancy-sequence"},{"articleLive":2,"formTitle":"[1623]三人国家代表队","frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"articleLive":2,"formTitle":"[1624]两个相同字符之间的最长子字符串","frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"articleLive":2,"formTitle":"[1625]执行操作后字典序最小的字符串","frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"articleLive":2,"formTitle":"[1626]无矛盾的最佳球队","frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"articleLive":2,"formTitle":"[1627]带阈值的图连通性","frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"articleLive":2,"formTitle":"[1628]设计带解析函数的表达式树","frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"articleLive":2,"formTitle":"[1629]按键持续时间最长的键","frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"articleLive":2,"formTitle":"[1630]等差子数组","frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"articleLive":2,"formTitle":"[1631]最小体力消耗路径","frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"articleLive":2,"formTitle":"[1632]矩阵转换后的秩","frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"articleLive":2,"formTitle":"[1633]各赛事的用户注册率","frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"articleLive":2,"formTitle":"[1634]求两个多项式链表的和","frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"articleLive":2,"formTitle":"[1635]Hopper 公司查询 I","frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"articleLive":2,"formTitle":"[1636]按照频率将数组升序排序","frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"articleLive":2,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"articleLive":2,"formTitle":"[1638]统计只差一个字符的子串数目","frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"articleLive":2,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"articleLive":2,"formTitle":"[1640]能否连接形成数组","frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"articleLive":2,"formTitle":"[1641]统计字典序元音字符串的数目","frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"articleLive":2,"formTitle":"[1642]可以到达的最远建筑","frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"articleLive":2,"formTitle":"[1643]第 K 条最小指令","frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"articleLive":2,"formTitle":"[1644]二叉树的最近公共祖先 II","frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"articleLive":2,"formTitle":"[1645]Hopper Company Queries II","frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"articleLive":2,"formTitle":"[1646]获取生成数组中的最大值","frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"articleLive":2,"formTitle":"[1647]字符频次唯一的最小删除次数","frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"articleLive":2,"formTitle":"[1648]销售价值减少的颜色球","frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"articleLive":2,"formTitle":"[1649]通过指令创建有序数组","frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"articleLive":2,"formTitle":"[1650]二叉树的最近公共祖先 III","frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"articleLive":2,"formTitle":"[1651]Hopper Company Queries III","frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"articleLive":2,"formTitle":"[1652]拆炸弹","frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"articleLive":2,"formTitle":"[1653]使字符串平衡的最少删除次数","frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"articleLive":2,"formTitle":"[1654]到家的最少跳跃次数","frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"articleLive":2,"formTitle":"[1655]分配重复整数","frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"articleLive":2,"formTitle":"[1656]设计有序流","frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"articleLive":2,"formTitle":"[1657]确定两个字符串是否接近","frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"articleLive":2,"formTitle":"[1658]将 x 减到 0 的最小操作数","frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"articleLive":2,"formTitle":"[1659]最大化网格幸福感","frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"articleLive":2,"formTitle":"[1660]纠正二叉树","frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"articleLive":2,"formTitle":"[1661]每台机器的进程平均运行时间","frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"articleLive":2,"formTitle":"[1662]检查两个字符串数组是否相等","frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"articleLive":2,"formTitle":"[1663]具有给定数值的最小字符串","frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"articleLive":2,"formTitle":"[1664]生成平衡数组的方案数","frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"articleLive":2,"formTitle":"[1665]完成所有任务的最少初始能量","frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"articleLive":2,"formTitle":"[1666]改变二叉树的根节点","frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"articleLive":2,"formTitle":"[1667]修复表中的名字","frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"articleLive":2,"formTitle":"[1668]最大重复子字符串","frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"articleLive":2,"formTitle":"[1669]合并两个链表","frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"articleLive":2,"formTitle":"[1670]设计前中后队列","frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"articleLive":2,"formTitle":"[1671]得到山形数组的最少删除次数","frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"articleLive":2,"formTitle":"[1672]最富有客户的资产总量","frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"articleLive":2,"formTitle":"[1673]找出最具竞争力的子序列","frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"","title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"articleLive":2,"formTitle":"[1674]使数组互补的最少操作次数","frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"articleLive":2,"formTitle":"[1675]数组的最小偏移量","frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"articleLive":2,"formTitle":"[1676]二叉树的最近公共祖先 IV","frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"articleLive":2,"formTitle":"[1677]发票中的产品金额","frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"articleLive":2,"formTitle":"[1678]设计 Goal 解析器","frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"articleLive":2,"formTitle":"[1679]K 和数对的最大数目","frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"articleLive":2,"formTitle":"[1680]连接连续二进制数字","frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"articleLive":2,"formTitle":"[1681]最小不兼容性","frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"articleLive":2,"formTitle":"[1682]最长回文子序列 II","frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"articleLive":2,"formTitle":"[1683]无效的推文","frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","title":"无效的推文","titleSlug":"invalid-tweets"},{"articleLive":2,"formTitle":"[1684]统计一致字符串的数目","frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"articleLive":2,"formTitle":"[1685]有序数组中差绝对值之和","frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"articleLive":2,"formTitle":"[1686]石子游戏 VI","frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"articleLive":2,"formTitle":"[1687]从仓库到码头运输箱子","frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"articleLive":2,"formTitle":"[1688]比赛中的配对次数","frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"articleLive":2,"formTitle":"[1689]十-二进制数的最少数目","frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"articleLive":2,"formTitle":"[1690]石子游戏 VII","frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"articleLive":2,"formTitle":"[1691]堆叠长方体的最大高度","frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"articleLive":2,"formTitle":"[1692]计算分配糖果的不同方式","frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"articleLive":2,"formTitle":"[1693]每天的领导和合伙人","frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"articleLive":2,"formTitle":"[1694]重新格式化电话号码","frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"articleLive":2,"formTitle":"[1695]删除子数组的最大得分","frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"articleLive":2,"formTitle":"[1696]跳跃游戏 VI","frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"articleLive":2,"formTitle":"[1697]检查边长度限制的路径是否存在","frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"articleLive":2,"formTitle":"[1698]字符串的不同子字符串个数","frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"articleLive":2,"formTitle":"[1699]两人之间的通话次数","frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"articleLive":2,"formTitle":"[1700]无法吃午餐的学生数量","frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"articleLive":2,"formTitle":"[1701]平均等待时间","frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","title":"平均等待时间","titleSlug":"average-waiting-time"},{"articleLive":2,"formTitle":"[1702]修改后的最大二进制字符串","frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"articleLive":2,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"articleLive":2,"formTitle":"[1704]判断字符串的两半是否相似","frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"articleLive":2,"formTitle":"[1705]吃苹果的最大数目","frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"articleLive":2,"formTitle":"[1706]球会落何处","frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"articleLive":2,"formTitle":"[1707]与数组中元素的最大异或值","frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"articleLive":2,"formTitle":"[1708]长度为 K 的最大子数组","frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"articleLive":2,"formTitle":"[1709]访问日期之间最大的空档期","frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"articleLive":2,"formTitle":"[1710]卡车上的最大单元数","frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"articleLive":2,"formTitle":"[1711]大餐计数","frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"","title":"大餐计数","titleSlug":"count-good-meals"},{"articleLive":2,"formTitle":"[1712]将数组分成三个子数组的方案数","frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"articleLive":2,"formTitle":"[1713]得到子序列的最少操作次数","frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"","title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"articleLive":2,"formTitle":"[1714]数组中特殊等间距元素的和","frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"articleLive":2,"formTitle":"[1715]苹果和橘子的个数","frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"articleLive":2,"formTitle":"[1716]计算力扣银行的钱","frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"articleLive":2,"formTitle":"[1717]删除子字符串的最大得分","frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"articleLive":2,"formTitle":"[1718]构建字典序最大的可行序列","frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"articleLive":2,"formTitle":"[1719]重构一棵树的方案数","frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"articleLive":2,"formTitle":"[1720]解码异或后的数组","frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"","title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"articleLive":2,"formTitle":"[1721]交换链表中的节点","frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"articleLive":2,"formTitle":"[1722]执行交换操作后的最小汉明距离","frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"articleLive":2,"formTitle":"[1723]完成所有工作的最短时间","frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"","title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"articleLive":2,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"articleLive":2,"formTitle":"[1725]可以形成最大正方形的矩形数目","frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"articleLive":2,"formTitle":"[1726]同积元组","frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","title":"同积元组","titleSlug":"tuple-with-same-product"},{"articleLive":2,"formTitle":"[1727]重新排列后的最大子矩阵","frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"articleLive":2,"formTitle":"[1728]猫和老鼠 II","frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"articleLive":2,"formTitle":"[1729]求关注者的数量","frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","title":"求关注者的数量","titleSlug":"find-followers-count"},{"articleLive":2,"formTitle":"[1730]获取食物的最短路径","frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"articleLive":2,"formTitle":"[1731]每位经理的下属员工数量","frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"articleLive":2,"formTitle":"[1732]找到最高海拔","frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"articleLive":2,"formTitle":"[1733]需要教语言的最少人数","frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"articleLive":2,"formTitle":"[1734]解码异或后的排列","frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"","title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"articleLive":2,"formTitle":"[1735]生成乘积数组的方案数","frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"articleLive":2,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"","title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"articleLive":2,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"articleLive":2,"formTitle":"[1738]找出第 K 大的异或坐标值","frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"","title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"articleLive":2,"formTitle":"[1739]放置盒子","frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","title":"放置盒子","titleSlug":"building-boxes"},{"articleLive":2,"formTitle":"[1740]找到二叉树中的距离","frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1741]查找每个员工花费的总时间","frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"articleLive":2,"formTitle":"[1742]盒子中小球的最大数量","frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"articleLive":2,"formTitle":"[1743]从相邻元素对还原数组","frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"","title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"articleLive":2,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"","title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"articleLive":2,"formTitle":"[1745]回文串分割 IV","frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"articleLive":2,"formTitle":"[1746]经过一次操作后的最大子数组和","frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"articleLive":2,"formTitle":"[1747]应该被禁止的Leetflex账户","frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"articleLive":2,"formTitle":"[1748]唯一元素的和","frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"articleLive":2,"formTitle":"[1749]任意子数组和的绝对值的最大值","frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"articleLive":2,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"articleLive":2,"formTitle":"[1751]最多可以参加的会议数目 II","frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"articleLive":2,"formTitle":"[1752]检查数组是否经排序和轮转得到","frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"articleLive":2,"formTitle":"[1753]移除石子的最大得分","frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"articleLive":2,"formTitle":"[1754]构造字典序最大的合并字符串","frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"articleLive":2,"formTitle":"[1755]最接近目标值的子序列和","frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"articleLive":2,"formTitle":"[1756]设计最近使用（MRU）队列","frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"articleLive":2,"formTitle":"[1757]可回收且低脂的产品","frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"articleLive":2,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"articleLive":2,"formTitle":"[1759]统计同构子字符串的数目","frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"articleLive":2,"formTitle":"[1760]袋子里最少数目的球","frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"articleLive":2,"formTitle":"[1761]一个图中连通三元组的最小度数","frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"articleLive":2,"formTitle":"[1762]能看到海景的建筑物","frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"articleLive":2,"formTitle":"[1763]最长的美好子字符串","frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"articleLive":2,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"articleLive":2,"formTitle":"[1765]地图中的最高点","frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"articleLive":2,"formTitle":"[1766]互质树","frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","title":"互质树","titleSlug":"tree-of-coprimes"},{"articleLive":2,"formTitle":"[1767]Find the Subtasks That Did Not Execute","frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"},{"articleLive":2,"formTitle":"[1768]交替合并字符串","frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"articleLive":2,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"articleLive":2,"formTitle":"[1770]执行乘法运算的最大分数","frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"articleLive":2,"formTitle":"[1771]由子序列构造的最长回文串的长度","frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"articleLive":2,"formTitle":"[1772]按受欢迎程度排列功能","frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"articleLive":2,"formTitle":"[1773]统计匹配检索规则的物品数量","frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"articleLive":2,"formTitle":"[1774]最接近目标价格的甜点成本","frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"articleLive":2,"formTitle":"[1775]通过最少操作次数使数组的和相等","frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"articleLive":2,"formTitle":"[1776]车队 II","frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","title":"车队 II","titleSlug":"car-fleet-ii"},{"articleLive":2,"formTitle":"[1777]每家商店的产品价格","frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"articleLive":2,"formTitle":"[1778]Shortest Path in a Hidden Grid","frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"},{"articleLive":2,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"articleLive":2,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"articleLive":2,"formTitle":"[1781]所有子字符串美丽值之和","frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"articleLive":2,"formTitle":"[1782]统计点对的数目","frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"articleLive":2,"formTitle":"[1783]大满贯数量","frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","title":"大满贯数量","titleSlug":"grand-slam-titles"},{"articleLive":2,"formTitle":"[1784]检查二进制字符串字段","frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"articleLive":2,"formTitle":"[1785]构成特定和需要添加的最少元素","frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"articleLive":2,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"articleLive":2,"formTitle":"[1787]使所有区间的异或结果为零","frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"","title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"articleLive":2,"formTitle":"[1788]Maximize the Beauty of the Garden","frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"},{"articleLive":2,"formTitle":"[1789]Primary Department for Each Employee","frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"},{"articleLive":2,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"articleLive":2,"formTitle":"[1791]找出星型图的中心节点","frontendQuestionId":"1791","leaf":true,"level":2,"nodeType":"def","questionId":"1916","status":"","title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"articleLive":2,"formTitle":"[1792]最大平均通过率","frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"articleLive":2,"formTitle":"[1793]好子数组的最大分数","frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"articleLive":2,"formTitle":"[1794]Count Pairs of Equal Substrings With Minimum Difference","frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"articleLive":2,"formTitle":"[1795]Rearrange Products Table","frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","title":"Rearrange Products Table","titleSlug":"rearrange-products-table"},{"articleLive":2,"formTitle":"[1796]字符串中第二大的数字","frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"articleLive":2,"formTitle":"[1797]设计一个验证系统","frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"articleLive":2,"formTitle":"[1798]你能构造出连续值的最大数目","frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"articleLive":2,"formTitle":"[1799]N 次操作后的最大分数和","frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"articleLive":2,"formTitle":"[1800]最大升序子数组和","frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"articleLive":2,"formTitle":"[1801]积压订单中的订单总数","frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"articleLive":2,"formTitle":"[1802]有界数组中指定下标处的最大值","frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"articleLive":2,"formTitle":"[1803]统计异或值在范围内的数对有多少","frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"","title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"articleLive":2,"formTitle":"[1804]实现 Trie （前缀树） II","frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"articleLive":2,"formTitle":"[1805]字符串中不同整数的数目","frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"articleLive":2,"formTitle":"[1806]还原排列的最少操作步数","frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"articleLive":2,"formTitle":"[1807]替换字符串中的括号内容","frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"articleLive":2,"formTitle":"[1808]好因子的最大数目","frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"articleLive":2,"formTitle":"[1809]Ad-Free Sessions","frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"},{"articleLive":2,"formTitle":"[1810]Minimum Path Cost in a Hidden Grid","frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"articleLive":2,"formTitle":"[1811]Find Interview Candidates","frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","title":"Find Interview Candidates","titleSlug":"find-interview-candidates"},{"articleLive":2,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"articleLive":2,"formTitle":"[1813]句子相似性 III","frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"articleLive":2,"formTitle":"[1814]统计一个数组中好对子的数目","frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"articleLive":2,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"articleLive":2,"formTitle":"[1816]截断句子","frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","title":"截断句子","titleSlug":"truncate-sentence"},{"articleLive":2,"formTitle":"[1817]查找用户活跃分钟数","frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"articleLive":2,"formTitle":"[1818]绝对差值和","frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"notac","title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"articleLive":2,"formTitle":"[1819]序列中不同最大公约数的数目","frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"articleLive":2,"formTitle":"[1820]Maximum Number of Accepted Invitations","frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"},{"articleLive":2,"formTitle":"[1821]Find Customers With Positive Revenue this Year","frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"},{"articleLive":2,"formTitle":"[1822]数组元素积的符号","frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"articleLive":2,"formTitle":"[1823]找出游戏的获胜者","frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"articleLive":2,"formTitle":"[1824]最少侧跳次数","frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"articleLive":2,"formTitle":"[1825]求出 MK 平均值","frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"articleLive":2,"formTitle":"[1826]Faulty Sensor","frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"articleLive":2,"formTitle":"[1827]最少操作使数组递增","frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"articleLive":2,"formTitle":"[1828]统计一个圆中点的数目","frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"articleLive":2,"formTitle":"[1829]每个查询的最大异或值","frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"articleLive":2,"formTitle":"[1830]使字符串有序的最少操作次数","frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"articleLive":2,"formTitle":"[1831]Maximum Transaction Each Day","frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"},{"articleLive":2,"formTitle":"[1832]判断句子是否为全字母句","frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"articleLive":2,"formTitle":"[1833]雪糕的最大数量","frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"articleLive":2,"formTitle":"[1834]单线程 CPU","frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"articleLive":2,"formTitle":"[1835]所有数对按位与结果的异或和","frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"articleLive":2,"formTitle":"[1836]Remove Duplicates From an Unsorted Linked List","frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"articleLive":2,"formTitle":"[1837]K 进制表示下的各位数字总和","frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"articleLive":2,"formTitle":"[1838]最高频元素的频数","frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"articleLive":2,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"articleLive":2,"formTitle":"[1840]最高建筑高度","frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","title":"最高建筑高度","titleSlug":"maximum-building-height"},{"articleLive":2,"formTitle":"[1841]League Statistics","frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","title":"League Statistics","titleSlug":"league-statistics"},{"articleLive":2,"formTitle":"[1842]Next Palindrome Using Same Digits","frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"},{"articleLive":2,"formTitle":"[LCP 01]猜数字","frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","title":"猜数字","titleSlug":"guess-numbers"},{"articleLive":2,"formTitle":"[LCP 02]分式化简","frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","title":"分式化简","titleSlug":"deep-dark-fraction"},{"articleLive":2,"formTitle":"[LCP 03]机器人大冒险","frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","title":"机器人大冒险","titleSlug":"programmable-robot"},{"articleLive":2,"formTitle":"[LCP 04]覆盖","frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","title":"覆盖","titleSlug":"broken-board-dominoes"},{"articleLive":2,"formTitle":"[LCP 05]发 LeetCoin","frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","title":"发 LeetCoin","titleSlug":"coin-bonus"},{"articleLive":2,"formTitle":"[LCP 06]拿硬币","frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","title":"拿硬币","titleSlug":"na-ying-bi"},{"articleLive":2,"formTitle":"[LCP 07]传递信息","frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"","title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"articleLive":2,"formTitle":"[LCP 08]剧情触发时间","frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"articleLive":2,"formTitle":"[LCP 09]最小跳跃次数","frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"articleLive":2,"formTitle":"[LCP 10]二叉树任务调度","frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"articleLive":2,"formTitle":"[LCP 11]期望个数统计","frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"articleLive":2,"formTitle":"[LCP 12]小张刷题计划","frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"articleLive":2,"formTitle":"[LCP 13]寻宝","frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","title":"寻宝","titleSlug":"xun-bao"},{"articleLive":2,"formTitle":"[LCP 14]切分数组","frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"articleLive":2,"formTitle":"[LCP 15]游乐园的迷宫","frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"articleLive":2,"formTitle":"[LCP 16]游乐园的游览计划","frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"articleLive":2,"formTitle":"[LCP 17]速算机器人","frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","title":"速算机器人","titleSlug":"nGK0Fy"},{"articleLive":2,"formTitle":"[LCP 18]早餐组合","frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"","title":"早餐组合","titleSlug":"2vYnGI"},{"articleLive":2,"formTitle":"[LCP 19]秋叶收藏集","frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","title":"秋叶收藏集","titleSlug":"UlBDOe"},{"articleLive":2,"formTitle":"[LCP 20]快速公交","frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","title":"快速公交","titleSlug":"meChtZ"},{"articleLive":2,"formTitle":"[LCP 21]追逐游戏","frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","title":"追逐游戏","titleSlug":"Za25hA"},{"articleLive":2,"formTitle":"[LCP 22]黑白方格画","frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"","title":"黑白方格画","titleSlug":"ccw6C7"},{"articleLive":2,"formTitle":"[LCP 23]魔术排列","frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","title":"魔术排列","titleSlug":"er94lq"},{"articleLive":2,"formTitle":"[LCP 24]数字游戏","frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","title":"数字游戏","titleSlug":"5TxKeK"},{"articleLive":2,"formTitle":"[LCP 25]古董键盘","frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","title":"古董键盘","titleSlug":"Uh984O"},{"articleLive":2,"formTitle":"[LCP 26]导航装置","frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","title":"导航装置","titleSlug":"hSRGyL"},{"articleLive":2,"formTitle":"[LCP 27]黑盒光线反射","frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"articleLive":2,"formTitle":"[LCP 28]采购方案","frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","title":"采购方案","titleSlug":"4xy4Wx"},{"articleLive":2,"formTitle":"[LCP 29]乐团站位","frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","title":"乐团站位","titleSlug":"SNJvJP"},{"articleLive":2,"formTitle":"[LCP 30]魔塔游戏","frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"notac","title":"魔塔游戏","titleSlug":"p0NxJO"},{"articleLive":2,"formTitle":"[LCP 31]变换的迷宫","frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","title":"变换的迷宫","titleSlug":"Db3wC1"},{"articleLive":2,"formTitle":"[LCP 32]批量处理任务","frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","title":"批量处理任务","titleSlug":"t3fKg1"},{"articleLive":2,"formTitle":"[LCP 33]蓄水","frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","title":"蓄水","titleSlug":"o8SXZn"},{"articleLive":2,"formTitle":"[LCP 34]二叉树染色","frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"articleLive":2,"formTitle":"[LCP 35]电动车游城市","frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","title":"电动车游城市","titleSlug":"DFPeFJ"},{"articleLive":2,"formTitle":"[LCP 36]最多牌组数","frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","title":"最多牌组数","titleSlug":"Up5XYM"},{"articleLive":2,"formTitle":"[LCP 37]最小矩形面积","frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"articleLive":2,"formTitle":"[LCP 38]守卫城堡","frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","title":"守卫城堡","titleSlug":"7rLGCR"},{"articleLive":2,"formTitle":"[剑指 Offer 03]数组中重复的数字","frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 04]二维数组中的查找","frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 05]替换空格","frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 07]重建二叉树","frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 12]矩阵中的路径","frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 13]机器人的运动范围","frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 14- I]剪绳子","frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 15]二进制中1的个数","frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"","title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 16]数值的整数次方","frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 18]删除链表的节点","frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 19]正则表达式匹配","frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 20]表示数值的字符串","frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 24]反转链表","frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 26]树的子结构","frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 27]二叉树的镜像","frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 28]对称的二叉树","frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 30]包含min函数的栈","frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 35]复杂链表的复制","frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 37]序列化二叉树","frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"","title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 38]字符串的排列","frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"","title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"","title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 40]最小的k个数","frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 41]数据流中的中位数","frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"","title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 47]礼物的最大价值","frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 49]丑数","frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","title":"丑数","titleSlug":"chou-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 51]数组中的逆序对","frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"","title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 57]和为s的两个数字","frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"","title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 60]n个骰子的点数","frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 63]股票的最大利润","frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 64]求1+2+…+n","frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 66]构建乘积数组","frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"articleLive":2,"formTitle":"[面试题 01.01]判定字符是否唯一","frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"articleLive":2,"formTitle":"[面试题 01.02]判定是否互为字符重排","frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"articleLive":2,"formTitle":"[面试题 01.03]URL化","frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","title":"URL化","titleSlug":"string-to-url-lcci"},{"articleLive":2,"formTitle":"[面试题 01.04]回文排列","frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"articleLive":2,"formTitle":"[面试题 01.05]一次编辑","frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","title":"一次编辑","titleSlug":"one-away-lcci"},{"articleLive":2,"formTitle":"[面试题 01.06]字符串压缩","frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","title":"字符串压缩","titleSlug":"compress-string-lcci"},{"articleLive":2,"formTitle":"[面试题 01.07]旋转矩阵","frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"articleLive":2,"formTitle":"[面试题 01.08]零矩阵","frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"articleLive":2,"formTitle":"[面试题 01.09]字符串轮转","frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"articleLive":2,"formTitle":"[面试题 02.01]移除重复节点","frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"articleLive":2,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.03]删除中间节点","frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"articleLive":2,"formTitle":"[面试题 02.04]分割链表","frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","title":"分割链表","titleSlug":"partition-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.05]链表求和","frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","title":"链表求和","titleSlug":"sum-lists-lcci"},{"articleLive":2,"formTitle":"[面试题 02.06]回文链表","frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.07]链表相交","frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"articleLive":2,"formTitle":"[面试题 02.08]环路检测","frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"articleLive":2,"formTitle":"[面试题 03.01]三合一","frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","title":"三合一","titleSlug":"three-in-one-lcci"},{"articleLive":2,"formTitle":"[面试题 03.02]栈的最小值","frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","title":"栈的最小值","titleSlug":"min-stack-lcci"},{"articleLive":2,"formTitle":"[面试题 03.03]堆盘子","frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"articleLive":2,"formTitle":"[面试题 03.04]化栈为队","frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"articleLive":2,"formTitle":"[面试题 03.05]栈排序","frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"articleLive":2,"formTitle":"[面试题 03.06]动物收容所","frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"articleLive":2,"formTitle":"[面试题 04.01]节点间通路","frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"articleLive":2,"formTitle":"[面试题 04.02]最小高度树","frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.03]特定深度节点链表","frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"articleLive":2,"formTitle":"[面试题 04.04]检查平衡性","frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","title":"检查平衡性","titleSlug":"check-balance-lcci"},{"articleLive":2,"formTitle":"[面试题 04.05]合法二叉搜索树","frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.06]后继者","frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","title":"后继者","titleSlug":"successor-lcci"},{"articleLive":2,"formTitle":"[面试题 04.08]首个共同祖先","frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"articleLive":2,"formTitle":"[面试题 04.09]二叉搜索树序列","frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"articleLive":2,"formTitle":"[面试题 04.10]检查子树","frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","title":"检查子树","titleSlug":"check-subtree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.12]求和路径","frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"articleLive":2,"formTitle":"[面试题 05.01]插入","frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","title":"插入","titleSlug":"insert-into-bits-lcci"},{"articleLive":2,"formTitle":"[面试题 05.02]二进制数转字符串","frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"articleLive":2,"formTitle":"[面试题 05.03]翻转数位","frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"articleLive":2,"formTitle":"[面试题 05.04]下一个数","frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","title":"下一个数","titleSlug":"closed-number-lcci"},{"articleLive":2,"formTitle":"[面试题 05.06]整数转换","frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","title":"整数转换","titleSlug":"convert-integer-lcci"},{"articleLive":2,"formTitle":"[面试题 05.07]配对交换","frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","title":"配对交换","titleSlug":"exchange-lcci"},{"articleLive":2,"formTitle":"[面试题 05.08]绘制直线","frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","title":"绘制直线","titleSlug":"draw-line-lcci"},{"articleLive":2,"formTitle":"[面试题 08.01]三步问题","frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"articleLive":2,"formTitle":"[面试题 08.02]迷路的机器人","frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"articleLive":2,"formTitle":"[面试题 08.03]魔术索引","frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","title":"魔术索引","titleSlug":"magic-index-lcci"},{"articleLive":2,"formTitle":"[面试题 08.04]幂集","frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","title":"幂集","titleSlug":"power-set-lcci"},{"articleLive":2,"formTitle":"[面试题 08.05]递归乘法","frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"articleLive":2,"formTitle":"[面试题 08.06]汉诺塔问题","frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"articleLive":2,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"articleLive":2,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"articleLive":2,"formTitle":"[面试题 08.09]括号","frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","title":"括号","titleSlug":"bracket-lcci"},{"articleLive":2,"formTitle":"[面试题 08.10]颜色填充","frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","title":"颜色填充","titleSlug":"color-fill-lcci"},{"articleLive":2,"formTitle":"[面试题 08.11]硬币","frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","title":"硬币","titleSlug":"coin-lcci"},{"articleLive":2,"formTitle":"[面试题 08.12]八皇后","frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","title":"八皇后","titleSlug":"eight-queens-lcci"},{"articleLive":2,"formTitle":"[面试题 08.13]堆箱子","frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","title":"堆箱子","titleSlug":"pile-box-lcci"},{"articleLive":2,"formTitle":"[面试题 08.14]布尔运算","frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"","title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"articleLive":2,"formTitle":"[面试题 10.01]合并排序的数组","frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"articleLive":2,"formTitle":"[面试题 10.02]变位词组","frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"","title":"变位词组","titleSlug":"group-anagrams-lcci"},{"articleLive":2,"formTitle":"[面试题 10.03]搜索旋转数组","frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"articleLive":2,"formTitle":"[面试题 10.05]稀疏数组搜索","frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"articleLive":2,"formTitle":"[面试题 10.09]排序矩阵查找","frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"articleLive":2,"formTitle":"[面试题 10.10]数字流的秩","frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"articleLive":2,"formTitle":"[面试题 10.11]峰与谷","frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"articleLive":2,"formTitle":"[面试题 16.01]交换数字","frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","title":"交换数字","titleSlug":"swap-numbers-lcci"},{"articleLive":2,"formTitle":"[面试题 16.02]单词频率","frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","title":"单词频率","titleSlug":"words-frequency-lcci"},{"articleLive":2,"formTitle":"[面试题 16.03]交点","frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","title":"交点","titleSlug":"intersection-lcci"},{"articleLive":2,"formTitle":"[面试题 16.04]井字游戏","frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"articleLive":2,"formTitle":"[面试题 16.05]阶乘尾数","frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"articleLive":2,"formTitle":"[面试题 16.06]最小差","frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","title":"最小差","titleSlug":"smallest-difference-lcci"},{"articleLive":2,"formTitle":"[面试题 16.07]最大数值","frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","title":"最大数值","titleSlug":"maximum-lcci"},{"articleLive":2,"formTitle":"[面试题 16.08]整数的英语表示","frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","title":"整数的英语表示","titleSlug":"english-int-lcci"},{"articleLive":2,"formTitle":"[面试题 16.09]运算","frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","title":"运算","titleSlug":"operations-lcci"},{"articleLive":2,"formTitle":"[面试题 16.10]生存人数","frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","title":"生存人数","titleSlug":"living-people-lcci"},{"articleLive":2,"formTitle":"[面试题 16.11]跳水板","frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","title":"跳水板","titleSlug":"diving-board-lcci"},{"articleLive":2,"formTitle":"[面试题 16.13]平分正方形","frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"articleLive":2,"formTitle":"[面试题 16.14]最佳直线","frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","title":"最佳直线","titleSlug":"best-line-lcci"},{"articleLive":2,"formTitle":"[面试题 16.15]珠玑妙算","frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"articleLive":2,"formTitle":"[面试题 16.16]部分排序","frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","title":"部分排序","titleSlug":"sub-sort-lcci"},{"articleLive":2,"formTitle":"[面试题 16.17]连续数列","frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"articleLive":2,"formTitle":"[面试题 16.18]模式匹配","frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"articleLive":2,"formTitle":"[面试题 16.19]水域大小","frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","title":"水域大小","titleSlug":"pond-sizes-lcci"},{"articleLive":2,"formTitle":"[面试题 16.20]T9键盘","frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","title":"T9键盘","titleSlug":"t9-lcci"},{"articleLive":2,"formTitle":"[面试题 16.21]交换和","frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","title":"交换和","titleSlug":"sum-swap-lcci"},{"articleLive":2,"formTitle":"[面试题 16.22]兰顿蚂蚁","frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"articleLive":2,"formTitle":"[面试题 16.24]数对和","frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"articleLive":2,"formTitle":"[面试题 16.25]LRU 缓存","frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"articleLive":2,"formTitle":"[面试题 16.26]计算器","frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","title":"计算器","titleSlug":"calculator-lcci"},{"articleLive":2,"formTitle":"[面试题 17.01]不用加号的加法","frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"articleLive":2,"formTitle":"[面试题 17.04]消失的数字","frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","title":"消失的数字","titleSlug":"missing-number-lcci"},{"articleLive":2,"formTitle":"[面试题 17.05] 字母与数字","frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"articleLive":2,"formTitle":"[面试题 17.06]2出现的次数","frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"articleLive":2,"formTitle":"[面试题 17.07]婴儿名字","frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","title":"婴儿名字","titleSlug":"baby-names-lcci"},{"articleLive":2,"formTitle":"[面试题 17.08]马戏团人塔","frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"articleLive":2,"formTitle":"[面试题 17.09]第 k 个数","frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"articleLive":2,"formTitle":"[面试题 17.10]主要元素","frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"","title":"主要元素","titleSlug":"find-majority-element-lcci"},{"articleLive":2,"formTitle":"[面试题 17.11]单词距离","frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","title":"单词距离","titleSlug":"find-closest-lcci"},{"articleLive":2,"formTitle":"[面试题 17.12]BiNode","frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","title":"BiNode","titleSlug":"binode-lcci"},{"articleLive":2,"formTitle":"[面试题 17.13]恢复空格","frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","title":"恢复空格","titleSlug":"re-space-lcci"},{"articleLive":2,"formTitle":"[面试题 17.14]最小K个数","frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","title":"最小K个数","titleSlug":"smallest-k-lcci"},{"articleLive":2,"formTitle":"[面试题 17.15]最长单词","frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","title":"最长单词","titleSlug":"longest-word-lcci"},{"articleLive":2,"formTitle":"[面试题 17.16]按摩师","frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","title":"按摩师","titleSlug":"the-masseuse-lcci"},{"articleLive":2,"formTitle":"[面试题 17.17]多次搜索","frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","title":"多次搜索","titleSlug":"multi-search-lcci"},{"articleLive":2,"formTitle":"[面试题 17.18]最短超串","frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"articleLive":2,"formTitle":"[面试题 17.19]消失的两个数字","frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"articleLive":2,"formTitle":"[面试题 17.20]连续中值","frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","title":"连续中值","titleSlug":"continuous-median-lcci"},{"articleLive":2,"formTitle":"[面试题 17.21]直方图的水量","frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"articleLive":2,"formTitle":"[面试题 17.22]单词转换","frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","title":"单词转换","titleSlug":"word-transformer-lcci"},{"articleLive":2,"formTitle":"[面试题 17.23]最大黑方阵","frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"articleLive":2,"formTitle":"[面试题 17.24]最大子矩阵","frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"articleLive":2,"formTitle":"[面试题 17.25]单词矩阵","frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"articleLive":2,"formTitle":"[面试题 17.26]稀疏相似度","frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
+[{"articleLive":2,"formTitle":"[137]只出现一次的数字 II","frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"articleLive":2,"formTitle":"[1]两数之和","frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","title":"两数之和","titleSlug":"two-sum"},{"articleLive":2,"formTitle":"[2]两数相加","frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","title":"两数相加","titleSlug":"add-two-numbers"},{"articleLive":2,"formTitle":"[3]无重复字符的最长子串","frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"articleLive":2,"formTitle":"[4]寻找两个正序数组的中位数","frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"articleLive":2,"formTitle":"[5]最长回文子串","frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"articleLive":2,"formTitle":"[6]Z 字形变换","frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"articleLive":2,"formTitle":"[7]整数反转","frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"","title":"整数反转","titleSlug":"reverse-integer"},{"articleLive":2,"formTitle":"[8]字符串转换整数 (atoi)","frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"articleLive":2,"formTitle":"[9]回文数","frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","title":"回文数","titleSlug":"palindrome-number"},{"articleLive":2,"formTitle":"[10]正则表达式匹配","frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"articleLive":2,"formTitle":"[11]盛最多水的容器","frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"","title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"articleLive":2,"formTitle":"[12]整数转罗马数字","frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"articleLive":2,"formTitle":"[13]罗马数字转整数","frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"articleLive":2,"formTitle":"[14]最长公共前缀","frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"articleLive":2,"formTitle":"[15]三数之和","frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","title":"三数之和","titleSlug":"3sum"},{"articleLive":2,"formTitle":"[16]最接近的三数之和","frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","title":"最接近的三数之和","titleSlug":"3sum-closest"},{"articleLive":2,"formTitle":"[17]电话号码的字母组合","frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"articleLive":2,"formTitle":"[18]四数之和","frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","title":"四数之和","titleSlug":"4sum"},{"articleLive":2,"formTitle":"[19]删除链表的倒数第 N 个结点","frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"articleLive":2,"formTitle":"[20]有效的括号","frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","title":"有效的括号","titleSlug":"valid-parentheses"},{"articleLive":2,"formTitle":"[21]合并两个有序链表","frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"articleLive":2,"formTitle":"[22]括号生成","frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","title":"括号生成","titleSlug":"generate-parentheses"},{"articleLive":2,"formTitle":"[23]合并K个升序链表","frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"articleLive":2,"formTitle":"[24]两两交换链表中的节点","frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"articleLive":2,"formTitle":"[25]K 个一组翻转链表","frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"articleLive":2,"formTitle":"[26]删除有序数组中的重复项","frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"articleLive":2,"formTitle":"[27]移除元素","frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","title":"移除元素","titleSlug":"remove-element"},{"articleLive":2,"formTitle":"[28]实现 strStr()","frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","title":"实现 strStr()","titleSlug":"implement-strstr"},{"articleLive":2,"formTitle":"[29]两数相除","frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","title":"两数相除","titleSlug":"divide-two-integers"},{"articleLive":2,"formTitle":"[30]串联所有单词的子串","frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"articleLive":2,"formTitle":"[31]下一个排列","frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","title":"下一个排列","titleSlug":"next-permutation"},{"articleLive":2,"formTitle":"[32]最长有效括号","frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"articleLive":2,"formTitle":"[33]搜索旋转排序数组","frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"articleLive":2,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"articleLive":2,"formTitle":"[35]搜索插入位置","frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","title":"搜索插入位置","titleSlug":"search-insert-position"},{"articleLive":2,"formTitle":"[36]有效的数独","frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","title":"有效的数独","titleSlug":"valid-sudoku"},{"articleLive":2,"formTitle":"[37]解数独","frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","title":"解数独","titleSlug":"sudoku-solver"},{"articleLive":2,"formTitle":"[38]外观数列","frontendQuestionId":"38","leaf":true,"level":1,"nodeType":"def","questionId":"38","status":"","title":"外观数列","titleSlug":"count-and-say"},{"articleLive":2,"formTitle":"[39]组合总和","frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","title":"组合总和","titleSlug":"combination-sum"},{"articleLive":2,"formTitle":"[40]组合总和 II","frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","title":"组合总和 II","titleSlug":"combination-sum-ii"},{"articleLive":2,"formTitle":"[41]缺失的第一个正数","frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"articleLive":2,"formTitle":"[42]接雨水","frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","title":"接雨水","titleSlug":"trapping-rain-water"},{"articleLive":2,"formTitle":"[43]字符串相乘","frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","title":"字符串相乘","titleSlug":"multiply-strings"},{"articleLive":2,"formTitle":"[44]通配符匹配","frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","title":"通配符匹配","titleSlug":"wildcard-matching"},{"articleLive":2,"formTitle":"[45]跳跃游戏 II","frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"","title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"articleLive":2,"formTitle":"[46]全排列","frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","title":"全排列","titleSlug":"permutations"},{"articleLive":2,"formTitle":"[47]全排列 II","frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","title":"全排列 II","titleSlug":"permutations-ii"},{"articleLive":2,"formTitle":"[48]旋转图像","frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","title":"旋转图像","titleSlug":"rotate-image"},{"articleLive":2,"formTitle":"[49]字母异位词分组","frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","title":"字母异位词分组","titleSlug":"group-anagrams"},{"articleLive":2,"formTitle":"[50]Pow(x, n)","frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","title":"Pow(x, n)","titleSlug":"powx-n"},{"articleLive":2,"formTitle":"[51]N 皇后","frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","title":"N 皇后","titleSlug":"n-queens"},{"articleLive":2,"formTitle":"[52]N皇后 II","frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","title":"N皇后 II","titleSlug":"n-queens-ii"},{"articleLive":2,"formTitle":"[53]最大子序和","frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","title":"最大子序和","titleSlug":"maximum-subarray"},{"articleLive":2,"formTitle":"[54]螺旋矩阵","frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"articleLive":2,"formTitle":"[55]跳跃游戏","frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","title":"跳跃游戏","titleSlug":"jump-game"},{"articleLive":2,"formTitle":"[56]合并区间","frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","title":"合并区间","titleSlug":"merge-intervals"},{"articleLive":2,"formTitle":"[57]插入区间","frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","title":"插入区间","titleSlug":"insert-interval"},{"articleLive":2,"formTitle":"[58]最后一个单词的长度","frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"articleLive":2,"formTitle":"[59]螺旋矩阵 II","frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"articleLive":2,"formTitle":"[60]排列序列","frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","title":"排列序列","titleSlug":"permutation-sequence"},{"articleLive":2,"formTitle":"[61]旋转链表","frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","title":"旋转链表","titleSlug":"rotate-list"},{"articleLive":2,"formTitle":"[62]不同路径","frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","title":"不同路径","titleSlug":"unique-paths"},{"articleLive":2,"formTitle":"[63]不同路径 II","frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","title":"不同路径 II","titleSlug":"unique-paths-ii"},{"articleLive":2,"formTitle":"[64]最小路径和","frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","title":"最小路径和","titleSlug":"minimum-path-sum"},{"articleLive":2,"formTitle":"[65]有效数字","frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","title":"有效数字","titleSlug":"valid-number"},{"articleLive":2,"formTitle":"[66]加一","frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","title":"加一","titleSlug":"plus-one"},{"articleLive":2,"formTitle":"[67]二进制求和","frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","title":"二进制求和","titleSlug":"add-binary"},{"articleLive":2,"formTitle":"[68]文本左右对齐","frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","title":"文本左右对齐","titleSlug":"text-justification"},{"articleLive":2,"formTitle":"[69]x 的平方根","frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","title":"x 的平方根","titleSlug":"sqrtx"},{"articleLive":2,"formTitle":"[70]爬楼梯","frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","title":"爬楼梯","titleSlug":"climbing-stairs"},{"articleLive":2,"formTitle":"[71]简化路径","frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","title":"简化路径","titleSlug":"simplify-path"},{"articleLive":2,"formTitle":"[72]编辑距离","frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","title":"编辑距离","titleSlug":"edit-distance"},{"articleLive":2,"formTitle":"[73]矩阵置零","frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"articleLive":2,"formTitle":"[74]搜索二维矩阵","frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"articleLive":2,"formTitle":"[75]颜色分类","frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","title":"颜色分类","titleSlug":"sort-colors"},{"articleLive":2,"formTitle":"[76]最小覆盖子串","frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"articleLive":2,"formTitle":"[77]组合","frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","title":"组合","titleSlug":"combinations"},{"articleLive":2,"formTitle":"[78]子集","frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","title":"子集","titleSlug":"subsets"},{"articleLive":2,"formTitle":"[79]单词搜索","frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","title":"单词搜索","titleSlug":"word-search"},{"articleLive":2,"formTitle":"[80]删除有序数组中的重复项 II","frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"articleLive":2,"formTitle":"[81]搜索旋转排序数组 II","frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"articleLive":2,"formTitle":"[82]删除排序链表中的重复元素 II","frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"articleLive":2,"formTitle":"[83]删除排序链表中的重复元素","frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"articleLive":2,"formTitle":"[84]柱状图中最大的矩形","frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"articleLive":2,"formTitle":"[85]最大矩形","frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","title":"最大矩形","titleSlug":"maximal-rectangle"},{"articleLive":2,"formTitle":"[86]分隔链表","frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","title":"分隔链表","titleSlug":"partition-list"},{"articleLive":2,"formTitle":"[87]扰乱字符串","frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","title":"扰乱字符串","titleSlug":"scramble-string"},{"articleLive":2,"formTitle":"[88]合并两个有序数组","frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"notac","title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"articleLive":2,"formTitle":"[89]格雷编码","frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","title":"格雷编码","titleSlug":"gray-code"},{"articleLive":2,"formTitle":"[90]子集 II","frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","title":"子集 II","titleSlug":"subsets-ii"},{"articleLive":2,"formTitle":"[91]解码方法","frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","title":"解码方法","titleSlug":"decode-ways"},{"articleLive":2,"formTitle":"[92]反转链表 II","frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"articleLive":2,"formTitle":"[93]复原 IP 地址","frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"articleLive":2,"formTitle":"[94]二叉树的中序遍历","frontendQuestionId":"94","leaf":true,"level":2,"nodeType":"def","questionId":"94","status":"ac","title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"articleLive":2,"formTitle":"[95]不同的二叉搜索树 II","frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"articleLive":2,"formTitle":"[96]不同的二叉搜索树","frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"articleLive":2,"formTitle":"[97]交错字符串","frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","title":"交错字符串","titleSlug":"interleaving-string"},{"articleLive":2,"formTitle":"[98]验证二叉搜索树","frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"articleLive":2,"formTitle":"[99]恢复二叉搜索树","frontendQuestionId":"99","leaf":true,"level":3,"nodeType":"def","questionId":"99","status":"","title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"articleLive":2,"formTitle":"[100]相同的树","frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","title":"相同的树","titleSlug":"same-tree"},{"articleLive":2,"formTitle":"[101]对称二叉树","frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","title":"对称二叉树","titleSlug":"symmetric-tree"},{"articleLive":2,"formTitle":"[102]二叉树的层序遍历","frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"articleLive":2,"formTitle":"[103]二叉树的锯齿形层序遍历","frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"articleLive":2,"formTitle":"[104]二叉树的最大深度","frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"articleLive":2,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"articleLive":2,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"articleLive":2,"formTitle":"[107]二叉树的层序遍历 II","frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"articleLive":2,"formTitle":"[108]将有序数组转换为二叉搜索树","frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"articleLive":2,"formTitle":"[109]有序链表转换二叉搜索树","frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"articleLive":2,"formTitle":"[110]平衡二叉树","frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"articleLive":2,"formTitle":"[111]二叉树的最小深度","frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"articleLive":2,"formTitle":"[112]路径总和","frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","title":"路径总和","titleSlug":"path-sum"},{"articleLive":2,"formTitle":"[113]路径总和 II","frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","title":"路径总和 II","titleSlug":"path-sum-ii"},{"articleLive":2,"formTitle":"[114]二叉树展开为链表","frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"articleLive":2,"formTitle":"[115]不同的子序列","frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","title":"不同的子序列","titleSlug":"distinct-subsequences"},{"articleLive":2,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"articleLive":2,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"","title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"articleLive":2,"formTitle":"[118]杨辉三角","frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","title":"杨辉三角","titleSlug":"pascals-triangle"},{"articleLive":2,"formTitle":"[119]杨辉三角 II","frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"articleLive":2,"formTitle":"[120]三角形最小路径和","frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","title":"三角形最小路径和","titleSlug":"triangle"},{"articleLive":2,"formTitle":"[121]买卖股票的最佳时机","frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"articleLive":2,"formTitle":"[122]买卖股票的最佳时机 II","frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"articleLive":2,"formTitle":"[123]买卖股票的最佳时机 III","frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"articleLive":2,"formTitle":"[124]二叉树中的最大路径和","frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"articleLive":2,"formTitle":"[125]验证回文串","frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","title":"验证回文串","titleSlug":"valid-palindrome"},{"articleLive":2,"formTitle":"[126]单词接龙 II","frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"articleLive":2,"formTitle":"[127]单词接龙","frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","title":"单词接龙","titleSlug":"word-ladder"},{"articleLive":2,"formTitle":"[128]最长连续序列","frontendQuestionId":"128","leaf":true,"level":3,"nodeType":"def","questionId":"128","status":"","title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"articleLive":2,"formTitle":"[129]求根节点到叶节点数字之和","frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"articleLive":2,"formTitle":"[130]被围绕的区域","frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","title":"被围绕的区域","titleSlug":"surrounded-regions"},{"articleLive":2,"formTitle":"[131]分割回文串","frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","title":"分割回文串","titleSlug":"palindrome-partitioning"},{"articleLive":2,"formTitle":"[132]分割回文串 II","frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"articleLive":2,"formTitle":"[133]克隆图","frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","title":"克隆图","titleSlug":"clone-graph"},{"articleLive":2,"formTitle":"[134]加油站","frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","title":"加油站","titleSlug":"gas-station"},{"articleLive":2,"formTitle":"[135]分发糖果","frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","title":"分发糖果","titleSlug":"candy"},{"articleLive":2,"formTitle":"[136]只出现一次的数字","frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","title":"只出现一次的数字","titleSlug":"single-number"},{"articleLive":2,"formTitle":"[138]复制带随机指针的链表","frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"articleLive":2,"formTitle":"[139]单词拆分","frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","title":"单词拆分","titleSlug":"word-break"},{"articleLive":2,"formTitle":"[140]单词拆分 II","frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","title":"单词拆分 II","titleSlug":"word-break-ii"},{"articleLive":2,"formTitle":"[141]环形链表","frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","title":"环形链表","titleSlug":"linked-list-cycle"},{"articleLive":2,"formTitle":"[142]环形链表 II","frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"articleLive":2,"formTitle":"[143]重排链表","frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","title":"重排链表","titleSlug":"reorder-list"},{"articleLive":2,"formTitle":"[144]二叉树的前序遍历","frontendQuestionId":"144","leaf":true,"level":2,"nodeType":"def","questionId":"144","status":"ac","title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"articleLive":2,"formTitle":"[145]二叉树的后序遍历","frontendQuestionId":"145","leaf":true,"level":2,"nodeType":"def","questionId":"145","status":"ac","title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"articleLive":2,"formTitle":"[146]LRU 缓存机制","frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","title":"LRU 缓存机制","titleSlug":"lru-cache"},{"articleLive":2,"formTitle":"[147]对链表进行插入排序","frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"articleLive":2,"formTitle":"[148]排序链表","frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","title":"排序链表","titleSlug":"sort-list"},{"articleLive":2,"formTitle":"[149]直线上最多的点数","frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"articleLive":2,"formTitle":"[150]逆波兰表达式求值","frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"articleLive":2,"formTitle":"[151]翻转字符串里的单词","frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"articleLive":2,"formTitle":"[152]乘积最大子数组","frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"articleLive":2,"formTitle":"[153]寻找旋转排序数组中的最小值","frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"articleLive":2,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"articleLive":2,"formTitle":"[155]最小栈","frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","title":"最小栈","titleSlug":"min-stack"},{"articleLive":2,"formTitle":"[156]上下翻转二叉树","frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"articleLive":2,"formTitle":"[157]用 Read4 读取 N 个字符","frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"articleLive":2,"formTitle":"[158]用 Read4 读取 N 个字符 II","frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"articleLive":2,"formTitle":"[159]至多包含两个不同字符的最长子串","frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"articleLive":2,"formTitle":"[160]相交链表","frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"articleLive":2,"formTitle":"[161]相隔为 1 的编辑距离","frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"articleLive":2,"formTitle":"[162]寻找峰值","frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","title":"寻找峰值","titleSlug":"find-peak-element"},{"articleLive":2,"formTitle":"[163]缺失的区间","frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","title":"缺失的区间","titleSlug":"missing-ranges"},{"articleLive":2,"formTitle":"[164]最大间距","frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","title":"最大间距","titleSlug":"maximum-gap"},{"articleLive":2,"formTitle":"[165]比较版本号","frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","title":"比较版本号","titleSlug":"compare-version-numbers"},{"articleLive":2,"formTitle":"[166]分数到小数","frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"articleLive":2,"formTitle":"[167]两数之和 II - 输入有序数组","frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"","title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"articleLive":2,"formTitle":"[168]Excel表列名称","frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"articleLive":2,"formTitle":"[169]多数元素","frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","title":"多数元素","titleSlug":"majority-element"},{"articleLive":2,"formTitle":"[170]两数之和 III - 数据结构设计","frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"articleLive":2,"formTitle":"[171]Excel表列序号","frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","title":"Excel表列序号","titleSlug":"excel-sheet-column-number"},{"articleLive":2,"formTitle":"[172]阶乘后的零","frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"articleLive":2,"formTitle":"[173]二叉搜索树迭代器","frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"articleLive":2,"formTitle":"[174]地下城游戏","frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","title":"地下城游戏","titleSlug":"dungeon-game"},{"articleLive":2,"formTitle":"[175]组合两个表","frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","title":"组合两个表","titleSlug":"combine-two-tables"},{"articleLive":2,"formTitle":"[176]第二高的薪水","frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","title":"第二高的薪水","titleSlug":"second-highest-salary"},{"articleLive":2,"formTitle":"[177]第N高的薪水","frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"articleLive":2,"formTitle":"[178]分数排名","frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","title":"分数排名","titleSlug":"rank-scores"},{"articleLive":2,"formTitle":"[179]最大数","frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","title":"最大数","titleSlug":"largest-number"},{"articleLive":2,"formTitle":"[180]连续出现的数字","frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"articleLive":2,"formTitle":"[181]超过经理收入的员工","frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"articleLive":2,"formTitle":"[182]查找重复的电子邮箱","frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"articleLive":2,"formTitle":"[183]从不订购的客户","frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"articleLive":2,"formTitle":"[184]部门工资最高的员工","frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"articleLive":2,"formTitle":"[185]部门工资前三高的所有员工","frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"articleLive":2,"formTitle":"[186]翻转字符串里的单词 II","frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"articleLive":2,"formTitle":"[187]重复的DNA序列","frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"articleLive":2,"formTitle":"[188]买卖股票的最佳时机 IV","frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"articleLive":2,"formTitle":"[189]旋转数组","frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","title":"旋转数组","titleSlug":"rotate-array"},{"articleLive":2,"formTitle":"[190]颠倒二进制位","frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","title":"颠倒二进制位","titleSlug":"reverse-bits"},{"articleLive":2,"formTitle":"[191]位1的个数","frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","title":"位1的个数","titleSlug":"number-of-1-bits"},{"articleLive":2,"formTitle":"[192]统计词频","frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","title":"统计词频","titleSlug":"word-frequency"},{"articleLive":2,"formTitle":"[193]有效电话号码","frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"articleLive":2,"formTitle":"[194]转置文件","frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","title":"转置文件","titleSlug":"transpose-file"},{"articleLive":2,"formTitle":"[195]第十行","frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","title":"第十行","titleSlug":"tenth-line"},{"articleLive":2,"formTitle":"[196]删除重复的电子邮箱","frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"articleLive":2,"formTitle":"[197]上升的温度","frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","title":"上升的温度","titleSlug":"rising-temperature"},{"articleLive":2,"formTitle":"[198]打家劫舍","frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","title":"打家劫舍","titleSlug":"house-robber"},{"articleLive":2,"formTitle":"[199]二叉树的右视图","frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"articleLive":2,"formTitle":"[200]岛屿数量","frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","title":"岛屿数量","titleSlug":"number-of-islands"},{"articleLive":2,"formTitle":"[201]数字范围按位与","frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"articleLive":2,"formTitle":"[202]快乐数","frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","title":"快乐数","titleSlug":"happy-number"},{"articleLive":2,"formTitle":"[203]移除链表元素","frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"articleLive":2,"formTitle":"[204]计数质数","frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","title":"计数质数","titleSlug":"count-primes"},{"articleLive":2,"formTitle":"[205]同构字符串","frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","title":"同构字符串","titleSlug":"isomorphic-strings"},{"articleLive":2,"formTitle":"[206]反转链表","frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","title":"反转链表","titleSlug":"reverse-linked-list"},{"articleLive":2,"formTitle":"[207]课程表","frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","title":"课程表","titleSlug":"course-schedule"},{"articleLive":2,"formTitle":"[208]实现 Trie (前缀树)","frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"articleLive":2,"formTitle":"[209]长度最小的子数组","frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"","title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"articleLive":2,"formTitle":"[210]课程表 II","frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","title":"课程表 II","titleSlug":"course-schedule-ii"},{"articleLive":2,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"articleLive":2,"formTitle":"[212]单词搜索 II","frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","title":"单词搜索 II","titleSlug":"word-search-ii"},{"articleLive":2,"formTitle":"[213]打家劫舍 II","frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"articleLive":2,"formTitle":"[214]最短回文串","frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","title":"最短回文串","titleSlug":"shortest-palindrome"},{"articleLive":2,"formTitle":"[215]数组中的第K个最大元素","frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"articleLive":2,"formTitle":"[216]组合总和 III","frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","title":"组合总和 III","titleSlug":"combination-sum-iii"},{"articleLive":2,"formTitle":"[217]存在重复元素","frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","title":"存在重复元素","titleSlug":"contains-duplicate"},{"articleLive":2,"formTitle":"[218]天际线问题","frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","title":"天际线问题","titleSlug":"the-skyline-problem"},{"articleLive":2,"formTitle":"[219]存在重复元素 II","frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"articleLive":2,"formTitle":"[220]存在重复元素 III","frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"articleLive":2,"formTitle":"[221]最大正方形","frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","title":"最大正方形","titleSlug":"maximal-square"},{"articleLive":2,"formTitle":"[222]完全二叉树的节点个数","frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"articleLive":2,"formTitle":"[223]矩形面积","frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","title":"矩形面积","titleSlug":"rectangle-area"},{"articleLive":2,"formTitle":"[224]基本计算器","frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","title":"基本计算器","titleSlug":"basic-calculator"},{"articleLive":2,"formTitle":"[225]用队列实现栈","frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"articleLive":2,"formTitle":"[226]翻转二叉树","frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"articleLive":2,"formTitle":"[227]基本计算器 II","frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"articleLive":2,"formTitle":"[228]汇总区间","frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","title":"汇总区间","titleSlug":"summary-ranges"},{"articleLive":2,"formTitle":"[229]求众数 II","frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","title":"求众数 II","titleSlug":"majority-element-ii"},{"articleLive":2,"formTitle":"[230]二叉搜索树中第K小的元素","frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"articleLive":2,"formTitle":"[231]2的幂","frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","title":"2的幂","titleSlug":"power-of-two"},{"articleLive":2,"formTitle":"[232]用栈实现队列","frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"articleLive":2,"formTitle":"[233]数字 1 的个数","frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"articleLive":2,"formTitle":"[234]回文链表","frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","title":"回文链表","titleSlug":"palindrome-linked-list"},{"articleLive":2,"formTitle":"[235]二叉搜索树的最近公共祖先","frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"articleLive":2,"formTitle":"[236]二叉树的最近公共祖先","frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"articleLive":2,"formTitle":"[237]删除链表中的节点","frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"articleLive":2,"formTitle":"[238]除自身以外数组的乘积","frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"articleLive":2,"formTitle":"[239]滑动窗口最大值","frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"articleLive":2,"formTitle":"[240]搜索二维矩阵 II","frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"articleLive":2,"formTitle":"[241]为运算表达式设计优先级","frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"articleLive":2,"formTitle":"[242]有效的字母异位词","frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","title":"有效的字母异位词","titleSlug":"valid-anagram"},{"articleLive":2,"formTitle":"[243]最短单词距离","frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","title":"最短单词距离","titleSlug":"shortest-word-distance"},{"articleLive":2,"formTitle":"[244]最短单词距离 II","frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"articleLive":2,"formTitle":"[245]最短单词距离 III","frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"articleLive":2,"formTitle":"[246]中心对称数","frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","title":"中心对称数","titleSlug":"strobogrammatic-number"},{"articleLive":2,"formTitle":"[247]中心对称数 II","frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"articleLive":2,"formTitle":"[248]中心对称数 III","frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"articleLive":2,"formTitle":"[249]移位字符串分组","frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"articleLive":2,"formTitle":"[250]统计同值子树","frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"articleLive":2,"formTitle":"[251]展开二维向量","frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"articleLive":2,"formTitle":"[252]会议室","frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","title":"会议室","titleSlug":"meeting-rooms"},{"articleLive":2,"formTitle":"[253]会议室 II","frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"articleLive":2,"formTitle":"[254]因子的组合","frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","title":"因子的组合","titleSlug":"factor-combinations"},{"articleLive":2,"formTitle":"[255]验证前序遍历序列二叉搜索树","frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"articleLive":2,"formTitle":"[256]粉刷房子","frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","title":"粉刷房子","titleSlug":"paint-house"},{"articleLive":2,"formTitle":"[257]二叉树的所有路径","frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"articleLive":2,"formTitle":"[258]各位相加","frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","title":"各位相加","titleSlug":"add-digits"},{"articleLive":2,"formTitle":"[259]较小的三数之和","frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","title":"较小的三数之和","titleSlug":"3sum-smaller"},{"articleLive":2,"formTitle":"[260]只出现一次的数字 III","frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"articleLive":2,"formTitle":"[261]以图判树","frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","title":"以图判树","titleSlug":"graph-valid-tree"},{"articleLive":2,"formTitle":"[262]行程和用户","frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","title":"行程和用户","titleSlug":"trips-and-users"},{"articleLive":2,"formTitle":"[263]丑数","frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","title":"丑数","titleSlug":"ugly-number"},{"articleLive":2,"formTitle":"[264]丑数 II","frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","title":"丑数 II","titleSlug":"ugly-number-ii"},{"articleLive":2,"formTitle":"[265]粉刷房子 II","frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"articleLive":2,"formTitle":"[266]回文排列","frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","title":"回文排列","titleSlug":"palindrome-permutation"},{"articleLive":2,"formTitle":"[267]回文排列 II","frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"articleLive":2,"formTitle":"[268]丢失的数字","frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","title":"丢失的数字","titleSlug":"missing-number"},{"articleLive":2,"formTitle":"[269]火星词典","frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","title":"火星词典","titleSlug":"alien-dictionary"},{"articleLive":2,"formTitle":"[270]最接近的二叉搜索树值","frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"articleLive":2,"formTitle":"[271]字符串的编码与解码","frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"articleLive":2,"formTitle":"[272]最接近的二叉搜索树值 II","frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"articleLive":2,"formTitle":"[273]整数转换英文表示","frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"articleLive":2,"formTitle":"[274]H 指数","frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","title":"H 指数","titleSlug":"h-index"},{"articleLive":2,"formTitle":"[275]H 指数 II","frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","title":"H 指数 II","titleSlug":"h-index-ii"},{"articleLive":2,"formTitle":"[276]栅栏涂色","frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","title":"栅栏涂色","titleSlug":"paint-fence"},{"articleLive":2,"formTitle":"[277]搜寻名人","frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","title":"搜寻名人","titleSlug":"find-the-celebrity"},{"articleLive":2,"formTitle":"[278]第一个错误的版本","frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","title":"第一个错误的版本","titleSlug":"first-bad-version"},{"articleLive":2,"formTitle":"[279]完全平方数","frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","title":"完全平方数","titleSlug":"perfect-squares"},{"articleLive":2,"formTitle":"[280]摆动排序","frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","title":"摆动排序","titleSlug":"wiggle-sort"},{"articleLive":2,"formTitle":"[281]锯齿迭代器","frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"articleLive":2,"formTitle":"[282]给表达式添加运算符","frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"articleLive":2,"formTitle":"[283]移动零","frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","title":"移动零","titleSlug":"move-zeroes"},{"articleLive":2,"formTitle":"[284]顶端迭代器","frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","title":"顶端迭代器","titleSlug":"peeking-iterator"},{"articleLive":2,"formTitle":"[285]二叉搜索树中的中序后继","frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"articleLive":2,"formTitle":"[286]墙与门","frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","title":"墙与门","titleSlug":"walls-and-gates"},{"articleLive":2,"formTitle":"[287]寻找重复数","frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"articleLive":2,"formTitle":"[288]单词的唯一缩写","frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"articleLive":2,"formTitle":"[289]生命游戏","frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","title":"生命游戏","titleSlug":"game-of-life"},{"articleLive":2,"formTitle":"[290]单词规律","frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","title":"单词规律","titleSlug":"word-pattern"},{"articleLive":2,"formTitle":"[291]单词规律 II","frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","title":"单词规律 II","titleSlug":"word-pattern-ii"},{"articleLive":2,"formTitle":"[292]Nim 游戏","frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","title":"Nim 游戏","titleSlug":"nim-game"},{"articleLive":2,"formTitle":"[293]翻转游戏","frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","title":"翻转游戏","titleSlug":"flip-game"},{"articleLive":2,"formTitle":"[294]翻转游戏 II","frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"articleLive":2,"formTitle":"[295]数据流的中位数","frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"articleLive":2,"formTitle":"[296]最佳的碰头地点","frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"articleLive":2,"formTitle":"[297]二叉树的序列化与反序列化","frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"articleLive":2,"formTitle":"[298]二叉树最长连续序列","frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"articleLive":2,"formTitle":"[299]猜数字游戏","frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"articleLive":2,"formTitle":"[300]最长递增子序列","frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"articleLive":2,"formTitle":"[301]删除无效的括号","frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"articleLive":2,"formTitle":"[302]包含全部黑色像素的最小矩形","frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"articleLive":2,"formTitle":"[303]区域和检索 - 数组不可变","frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"articleLive":2,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"articleLive":2,"formTitle":"[305]岛屿数量 II","frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"articleLive":2,"formTitle":"[306]累加数","frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","title":"累加数","titleSlug":"additive-number"},{"articleLive":2,"formTitle":"[307]区域和检索 - 数组可修改","frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"articleLive":2,"formTitle":"[308]二维区域和检索 - 可变","frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"articleLive":2,"formTitle":"[309]最佳买卖股票时机含冷冻期","frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"articleLive":2,"formTitle":"[310]最小高度树","frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","title":"最小高度树","titleSlug":"minimum-height-trees"},{"articleLive":2,"formTitle":"[311]稀疏矩阵的乘法","frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"articleLive":2,"formTitle":"[312]戳气球","frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","title":"戳气球","titleSlug":"burst-balloons"},{"articleLive":2,"formTitle":"[313]超级丑数","frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","title":"超级丑数","titleSlug":"super-ugly-number"},{"articleLive":2,"formTitle":"[314]二叉树的垂直遍历","frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"articleLive":2,"formTitle":"[315]计算右侧小于当前元素的个数","frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"articleLive":2,"formTitle":"[316]去除重复字母","frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"articleLive":2,"formTitle":"[317]离建筑物最近的距离","frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"articleLive":2,"formTitle":"[318]最大单词长度乘积","frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"articleLive":2,"formTitle":"[319]灯泡开关","frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","title":"灯泡开关","titleSlug":"bulb-switcher"},{"articleLive":2,"formTitle":"[320]列举单词的全部缩写","frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"articleLive":2,"formTitle":"[321]拼接最大数","frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","title":"拼接最大数","titleSlug":"create-maximum-number"},{"articleLive":2,"formTitle":"[322]零钱兑换","frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","title":"零钱兑换","titleSlug":"coin-change"},{"articleLive":2,"formTitle":"[323]无向图中连通分量的数目","frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"articleLive":2,"formTitle":"[324]摆动排序 II","frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"articleLive":2,"formTitle":"[325]和等于 k 的最长子数组长度","frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"articleLive":2,"formTitle":"[326]3的幂","frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","title":"3的幂","titleSlug":"power-of-three"},{"articleLive":2,"formTitle":"[327]区间和的个数","frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","title":"区间和的个数","titleSlug":"count-of-range-sum"},{"articleLive":2,"formTitle":"[328]奇偶链表","frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"articleLive":2,"formTitle":"[329]矩阵中的最长递增路径","frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"articleLive":2,"formTitle":"[330]按要求补齐数组","frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","title":"按要求补齐数组","titleSlug":"patching-array"},{"articleLive":2,"formTitle":"[331]验证二叉树的前序序列化","frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"articleLive":2,"formTitle":"[332]重新安排行程","frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"articleLive":2,"formTitle":"[333]最大 BST 子树","frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"articleLive":2,"formTitle":"[334]递增的三元子序列","frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"articleLive":2,"formTitle":"[335]路径交叉","frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","title":"路径交叉","titleSlug":"self-crossing"},{"articleLive":2,"formTitle":"[336]回文对","frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","title":"回文对","titleSlug":"palindrome-pairs"},{"articleLive":2,"formTitle":"[337]打家劫舍 III","frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"articleLive":2,"formTitle":"[338]比特位计数","frontendQuestionId":"338","leaf":true,"level":2,"nodeType":"def","questionId":"338","status":"","title":"比特位计数","titleSlug":"counting-bits"},{"articleLive":2,"formTitle":"[339]嵌套列表权重和","frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"articleLive":2,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"articleLive":2,"formTitle":"[341]扁平化嵌套列表迭代器","frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"articleLive":2,"formTitle":"[342]4的幂","frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","title":"4的幂","titleSlug":"power-of-four"},{"articleLive":2,"formTitle":"[343]整数拆分","frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","title":"整数拆分","titleSlug":"integer-break"},{"articleLive":2,"formTitle":"[344]反转字符串","frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","title":"反转字符串","titleSlug":"reverse-string"},{"articleLive":2,"formTitle":"[345]反转字符串中的元音字母","frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"","title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"articleLive":2,"formTitle":"[346]数据流中的移动平均值","frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"articleLive":2,"formTitle":"[347]前 K 个高频元素","frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"articleLive":2,"formTitle":"[348]设计井字棋","frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"articleLive":2,"formTitle":"[349]两个数组的交集","frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"","title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"articleLive":2,"formTitle":"[350]两个数组的交集 II","frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"","title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"articleLive":2,"formTitle":"[351]安卓系统手势解锁","frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"articleLive":2,"formTitle":"[352]将数据流变为多个不相交区间","frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"articleLive":2,"formTitle":"[353]贪吃蛇","frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","title":"贪吃蛇","titleSlug":"design-snake-game"},{"articleLive":2,"formTitle":"[354]俄罗斯套娃信封问题","frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"articleLive":2,"formTitle":"[355]设计推特","frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","title":"设计推特","titleSlug":"design-twitter"},{"articleLive":2,"formTitle":"[356]直线镜像","frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","title":"直线镜像","titleSlug":"line-reflection"},{"articleLive":2,"formTitle":"[357]计算各个位数不同的数字个数","frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"articleLive":2,"formTitle":"[358]K 距离间隔重排字符串","frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"articleLive":2,"formTitle":"[359]日志速率限制器","frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"articleLive":2,"formTitle":"[360]有序转化数组","frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","title":"有序转化数组","titleSlug":"sort-transformed-array"},{"articleLive":2,"formTitle":"[361]轰炸敌人","frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","title":"轰炸敌人","titleSlug":"bomb-enemy"},{"articleLive":2,"formTitle":"[362]敲击计数器","frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","title":"敲击计数器","titleSlug":"design-hit-counter"},{"articleLive":2,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"articleLive":2,"formTitle":"[364]加权嵌套序列和 II","frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"articleLive":2,"formTitle":"[365]水壶问题","frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","title":"水壶问题","titleSlug":"water-and-jug-problem"},{"articleLive":2,"formTitle":"[366]寻找二叉树的叶子节点","frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"articleLive":2,"formTitle":"[367]有效的完全平方数","frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"articleLive":2,"formTitle":"[368]最大整除子集","frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"articleLive":2,"formTitle":"[369]给单链表加一","frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"articleLive":2,"formTitle":"[370]区间加法","frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","title":"区间加法","titleSlug":"range-addition"},{"articleLive":2,"formTitle":"[371]两整数之和","frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"","title":"两整数之和","titleSlug":"sum-of-two-integers"},{"articleLive":2,"formTitle":"[372]超级次方","frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","title":"超级次方","titleSlug":"super-pow"},{"articleLive":2,"formTitle":"[373]查找和最小的K对数字","frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"articleLive":2,"formTitle":"[374]猜数字大小","frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"articleLive":2,"formTitle":"[375]猜数字大小 II","frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"articleLive":2,"formTitle":"[376]摆动序列","frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","title":"摆动序列","titleSlug":"wiggle-subsequence"},{"articleLive":2,"formTitle":"[377]组合总和 Ⅳ","frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"articleLive":2,"formTitle":"[378]有序矩阵中第 K 小的元素","frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"articleLive":2,"formTitle":"[379]电话目录管理系统","frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"articleLive":2,"formTitle":"[380]常数时间插入、删除和获取随机元素","frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","title":"常数时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"articleLive":2,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"articleLive":2,"formTitle":"[382]链表随机节点","frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","title":"链表随机节点","titleSlug":"linked-list-random-node"},{"articleLive":2,"formTitle":"[383]赎金信","frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","title":"赎金信","titleSlug":"ransom-note"},{"articleLive":2,"formTitle":"[384]打乱数组","frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","title":"打乱数组","titleSlug":"shuffle-an-array"},{"articleLive":2,"formTitle":"[385]迷你语法分析器","frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","title":"迷你语法分析器","titleSlug":"mini-parser"},{"articleLive":2,"formTitle":"[386]字典序排数","frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","title":"字典序排数","titleSlug":"lexicographical-numbers"},{"articleLive":2,"formTitle":"[387]字符串中的第一个唯一字符","frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"articleLive":2,"formTitle":"[388]文件的最长绝对路径","frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"articleLive":2,"formTitle":"[389]找不同","frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","title":"找不同","titleSlug":"find-the-difference"},{"articleLive":2,"formTitle":"[390]消除游戏","frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","title":"消除游戏","titleSlug":"elimination-game"},{"articleLive":2,"formTitle":"[391]完美矩形","frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","title":"完美矩形","titleSlug":"perfect-rectangle"},{"articleLive":2,"formTitle":"[392]判断子序列","frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","title":"判断子序列","titleSlug":"is-subsequence"},{"articleLive":2,"formTitle":"[393]UTF-8 编码验证","frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"articleLive":2,"formTitle":"[394]字符串解码","frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","title":"字符串解码","titleSlug":"decode-string"},{"articleLive":2,"formTitle":"[395]至少有 K 个重复字符的最长子串","frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"articleLive":2,"formTitle":"[396]旋转函数","frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","title":"旋转函数","titleSlug":"rotate-function"},{"articleLive":2,"formTitle":"[397]整数替换","frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","title":"整数替换","titleSlug":"integer-replacement"},{"articleLive":2,"formTitle":"[398]随机数索引","frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","title":"随机数索引","titleSlug":"random-pick-index"},{"articleLive":2,"formTitle":"[399]除法求值","frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","title":"除法求值","titleSlug":"evaluate-division"},{"articleLive":2,"formTitle":"[400]第 N 位数字","frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","title":"第 N 位数字","titleSlug":"nth-digit"},{"articleLive":2,"formTitle":"[401]二进制手表","frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","title":"二进制手表","titleSlug":"binary-watch"},{"articleLive":2,"formTitle":"[402]移掉K位数字","frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","title":"移掉K位数字","titleSlug":"remove-k-digits"},{"articleLive":2,"formTitle":"[403]青蛙过河","frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","title":"青蛙过河","titleSlug":"frog-jump"},{"articleLive":2,"formTitle":"[404]左叶子之和","frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"articleLive":2,"formTitle":"[405]数字转换为十六进制数","frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"articleLive":2,"formTitle":"[406]根据身高重建队列","frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"articleLive":2,"formTitle":"[407]接雨水 II","frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"articleLive":2,"formTitle":"[408]有效单词缩写","frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"articleLive":2,"formTitle":"[409]最长回文串","frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","title":"最长回文串","titleSlug":"longest-palindrome"},{"articleLive":2,"formTitle":"[410]分割数组的最大值","frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"articleLive":2,"formTitle":"[411]最短独占单词缩写","frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"articleLive":2,"formTitle":"[412]Fizz Buzz","frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"articleLive":2,"formTitle":"[413]等差数列划分","frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","title":"等差数列划分","titleSlug":"arithmetic-slices"},{"articleLive":2,"formTitle":"[414]第三大的数","frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","title":"第三大的数","titleSlug":"third-maximum-number"},{"articleLive":2,"formTitle":"[415]字符串相加","frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","title":"字符串相加","titleSlug":"add-strings"},{"articleLive":2,"formTitle":"[416]分割等和子集","frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"articleLive":2,"formTitle":"[417]太平洋大西洋水流问题","frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"articleLive":2,"formTitle":"[418]屏幕可显示句子的数量","frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"articleLive":2,"formTitle":"[419]甲板上的战舰","frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"articleLive":2,"formTitle":"[420]强密码检验器","frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","title":"强密码检验器","titleSlug":"strong-password-checker"},{"articleLive":2,"formTitle":"[421]数组中两个数的最大异或值","frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"","title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"articleLive":2,"formTitle":"[422]有效的单词方块","frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","title":"有效的单词方块","titleSlug":"valid-word-square"},{"articleLive":2,"formTitle":"[423]从英文中重建数字","frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"articleLive":2,"formTitle":"[424]替换后的最长重复字符","frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"articleLive":2,"formTitle":"[425]单词方块","frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","title":"单词方块","titleSlug":"word-squares"},{"articleLive":2,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"articleLive":2,"formTitle":"[427]建立四叉树","frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","title":"建立四叉树","titleSlug":"construct-quad-tree"},{"articleLive":2,"formTitle":"[428]序列化和反序列化 N 叉树","frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"articleLive":2,"formTitle":"[429]N 叉树的层序遍历","frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"","title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"articleLive":2,"formTitle":"[430]扁平化多级双向链表","frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"articleLive":2,"formTitle":"[431]将 N 叉树编码为二叉树","frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"articleLive":2,"formTitle":"[432]全 O(1) 的数据结构","frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"articleLive":2,"formTitle":"[433]最小基因变化","frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"articleLive":2,"formTitle":"[434]字符串中的单词数","frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"articleLive":2,"formTitle":"[435]无重叠区间","frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"articleLive":2,"formTitle":"[436]寻找右区间","frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","title":"寻找右区间","titleSlug":"find-right-interval"},{"articleLive":2,"formTitle":"[437]路径总和 III","frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","title":"路径总和 III","titleSlug":"path-sum-iii"},{"articleLive":2,"formTitle":"[438]找到字符串中所有字母异位词","frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"","title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"articleLive":2,"formTitle":"[439]三元表达式解析器","frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"articleLive":2,"formTitle":"[440]字典序的第K小数字","frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"articleLive":2,"formTitle":"[441]排列硬币","frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","title":"排列硬币","titleSlug":"arranging-coins"},{"articleLive":2,"formTitle":"[442]数组中重复的数据","frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"articleLive":2,"formTitle":"[443]压缩字符串","frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","title":"压缩字符串","titleSlug":"string-compression"},{"articleLive":2,"formTitle":"[444]序列重建","frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","title":"序列重建","titleSlug":"sequence-reconstruction"},{"articleLive":2,"formTitle":"[445]两数相加 II","frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"articleLive":2,"formTitle":"[446]等差数列划分 II - 子序列","frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"articleLive":2,"formTitle":"[447]回旋镖的数量","frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"articleLive":2,"formTitle":"[448]找到所有数组中消失的数字","frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"articleLive":2,"formTitle":"[449]序列化和反序列化二叉搜索树","frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"articleLive":2,"formTitle":"[450]删除二叉搜索树中的节点","frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"articleLive":2,"formTitle":"[451]根据字符出现频率排序","frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"","title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"articleLive":2,"formTitle":"[452]用最少数量的箭引爆气球","frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"articleLive":2,"formTitle":"[453]最小操作次数使数组元素相等","frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"articleLive":2,"formTitle":"[454]四数相加 II","frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","title":"四数相加 II","titleSlug":"4sum-ii"},{"articleLive":2,"formTitle":"[455]分发饼干","frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","title":"分发饼干","titleSlug":"assign-cookies"},{"articleLive":2,"formTitle":"[456]132 模式","frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","title":"132 模式","titleSlug":"132-pattern"},{"articleLive":2,"formTitle":"[457]环形数组是否存在循环","frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"articleLive":2,"formTitle":"[458]可怜的小猪","frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","title":"可怜的小猪","titleSlug":"poor-pigs"},{"articleLive":2,"formTitle":"[459]重复的子字符串","frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"articleLive":2,"formTitle":"[460]LFU 缓存","frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","title":"LFU 缓存","titleSlug":"lfu-cache"},{"articleLive":2,"formTitle":"[461]汉明距离","frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","title":"汉明距离","titleSlug":"hamming-distance"},{"articleLive":2,"formTitle":"[462]最少移动次数使数组元素相等 II","frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"articleLive":2,"formTitle":"[463]岛屿的周长","frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","title":"岛屿的周长","titleSlug":"island-perimeter"},{"articleLive":2,"formTitle":"[464]我能赢吗","frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","title":"我能赢吗","titleSlug":"can-i-win"},{"articleLive":2,"formTitle":"[465]最优账单平衡","frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"articleLive":2,"formTitle":"[466]统计重复个数","frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","title":"统计重复个数","titleSlug":"count-the-repetitions"},{"articleLive":2,"formTitle":"[467]环绕字符串中唯一的子字符串","frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"articleLive":2,"formTitle":"[468]验证IP地址","frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","title":"验证IP地址","titleSlug":"validate-ip-address"},{"articleLive":2,"formTitle":"[469]凸多边形","frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","title":"凸多边形","titleSlug":"convex-polygon"},{"articleLive":2,"formTitle":"[470]用 Rand7() 实现 Rand10()","frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"articleLive":2,"formTitle":"[471]编码最短长度的字符串","frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"articleLive":2,"formTitle":"[472]连接词","frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","title":"连接词","titleSlug":"concatenated-words"},{"articleLive":2,"formTitle":"[473]火柴拼正方形","frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"articleLive":2,"formTitle":"[474]一和零","frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","title":"一和零","titleSlug":"ones-and-zeroes"},{"articleLive":2,"formTitle":"[475]供暖器","frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","title":"供暖器","titleSlug":"heaters"},{"articleLive":2,"formTitle":"[476]数字的补数","frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","title":"数字的补数","titleSlug":"number-complement"},{"articleLive":2,"formTitle":"[477]汉明距离总和","frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"articleLive":2,"formTitle":"[478]在圆内随机生成点","frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"articleLive":2,"formTitle":"[479]最大回文数乘积","frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"articleLive":2,"formTitle":"[480]滑动窗口中位数","frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"articleLive":2,"formTitle":"[481]神奇字符串","frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","title":"神奇字符串","titleSlug":"magical-string"},{"articleLive":2,"formTitle":"[482]密钥格式化","frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","title":"密钥格式化","titleSlug":"license-key-formatting"},{"articleLive":2,"formTitle":"[483]最小好进制","frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","title":"最小好进制","titleSlug":"smallest-good-base"},{"articleLive":2,"formTitle":"[484]寻找排列","frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","title":"寻找排列","titleSlug":"find-permutation"},{"articleLive":2,"formTitle":"[485]最大连续 1 的个数","frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"articleLive":2,"formTitle":"[486]预测赢家","frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","title":"预测赢家","titleSlug":"predict-the-winner"},{"articleLive":2,"formTitle":"[487]最大连续1的个数 II","frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"articleLive":2,"formTitle":"[488]祖玛游戏","frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","title":"祖玛游戏","titleSlug":"zuma-game"},{"articleLive":2,"formTitle":"[489]扫地机器人","frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"articleLive":2,"formTitle":"[490]迷宫","frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","title":"迷宫","titleSlug":"the-maze"},{"articleLive":2,"formTitle":"[491]递增子序列","frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","title":"递增子序列","titleSlug":"increasing-subsequences"},{"articleLive":2,"formTitle":"[492]构造矩形","frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","title":"构造矩形","titleSlug":"construct-the-rectangle"},{"articleLive":2,"formTitle":"[493]翻转对","frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","title":"翻转对","titleSlug":"reverse-pairs"},{"articleLive":2,"formTitle":"[494]目标和","frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","title":"目标和","titleSlug":"target-sum"},{"articleLive":2,"formTitle":"[495]提莫攻击","frontendQuestionId":"495","leaf":true,"level":2,"nodeType":"def","questionId":"495","status":"","title":"提莫攻击","titleSlug":"teemo-attacking"},{"articleLive":2,"formTitle":"[496]下一个更大元素 I","frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"articleLive":2,"formTitle":"[497]非重叠矩形中的随机点","frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"articleLive":2,"formTitle":"[498]对角线遍历","frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","title":"对角线遍历","titleSlug":"diagonal-traverse"},{"articleLive":2,"formTitle":"[499]迷宫 III","frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","title":"迷宫 III","titleSlug":"the-maze-iii"},{"articleLive":2,"formTitle":"[500]键盘行","frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","title":"键盘行","titleSlug":"keyboard-row"},{"articleLive":2,"formTitle":"[501]二叉搜索树中的众数","frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"articleLive":2,"formTitle":"[502]IPO","frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","title":"IPO","titleSlug":"ipo"},{"articleLive":2,"formTitle":"[503]下一个更大元素 II","frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"articleLive":2,"formTitle":"[504]七进制数","frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","title":"七进制数","titleSlug":"base-7"},{"articleLive":2,"formTitle":"[505]迷宫 II","frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","title":"迷宫 II","titleSlug":"the-maze-ii"},{"articleLive":2,"formTitle":"[506]相对名次","frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","title":"相对名次","titleSlug":"relative-ranks"},{"articleLive":2,"formTitle":"[507]完美数","frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","title":"完美数","titleSlug":"perfect-number"},{"articleLive":2,"formTitle":"[508]出现次数最多的子树元素和","frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"articleLive":2,"formTitle":"[509]斐波那契数","frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","title":"斐波那契数","titleSlug":"fibonacci-number"},{"articleLive":2,"formTitle":"[510]二叉搜索树中的中序后继 II","frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"articleLive":2,"formTitle":"[511]游戏玩法分析 I","frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"articleLive":2,"formTitle":"[512]游戏玩法分析 II","frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"articleLive":2,"formTitle":"[513]找树左下角的值","frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"articleLive":2,"formTitle":"[514]自由之路","frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","title":"自由之路","titleSlug":"freedom-trail"},{"articleLive":2,"formTitle":"[515]在每个树行中找最大值","frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"articleLive":2,"formTitle":"[516]最长回文子序列","frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"articleLive":2,"formTitle":"[517]超级洗衣机","frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","title":"超级洗衣机","titleSlug":"super-washing-machines"},{"articleLive":2,"formTitle":"[518]零钱兑换 II","frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","title":"零钱兑换 II","titleSlug":"coin-change-2"},{"articleLive":2,"formTitle":"[519]随机翻转矩阵","frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"articleLive":2,"formTitle":"[520]检测大写字母","frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","title":"检测大写字母","titleSlug":"detect-capital"},{"articleLive":2,"formTitle":"[521]最长特殊序列 Ⅰ","frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"articleLive":2,"formTitle":"[522]最长特殊序列 II","frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"articleLive":2,"formTitle":"[523]连续的子数组和","frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"articleLive":2,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"articleLive":2,"formTitle":"[525]连续数组","frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","title":"连续数组","titleSlug":"contiguous-array"},{"articleLive":2,"formTitle":"[526]优美的排列","frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","title":"优美的排列","titleSlug":"beautiful-arrangement"},{"articleLive":2,"formTitle":"[527]单词缩写","frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","title":"单词缩写","titleSlug":"word-abbreviation"},{"articleLive":2,"formTitle":"[528]按权重随机选择","frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"articleLive":2,"formTitle":"[529]扫雷游戏","frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","title":"扫雷游戏","titleSlug":"minesweeper"},{"articleLive":2,"formTitle":"[530]二叉搜索树的最小绝对差","frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"articleLive":2,"formTitle":"[531]孤独像素 I","frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"articleLive":2,"formTitle":"[532]数组中的 k-diff 数对","frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"articleLive":2,"formTitle":"[533]孤独像素 II","frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"articleLive":2,"formTitle":"[534]游戏玩法分析 III","frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"articleLive":2,"formTitle":"[535]TinyURL 的加密与解密","frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"articleLive":2,"formTitle":"[536]从字符串生成二叉树","frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"articleLive":2,"formTitle":"[537]复数乘法","frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","title":"复数乘法","titleSlug":"complex-number-multiplication"},{"articleLive":2,"formTitle":"[538]把二叉搜索树转换为累加树","frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"articleLive":2,"formTitle":"[539]最小时间差","frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","title":"最小时间差","titleSlug":"minimum-time-difference"},{"articleLive":2,"formTitle":"[540]有序数组中的单一元素","frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"articleLive":2,"formTitle":"[541]反转字符串 II","frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"articleLive":2,"formTitle":"[542]01 矩阵","frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","title":"01 矩阵","titleSlug":"01-matrix"},{"articleLive":2,"formTitle":"[543]二叉树的直径","frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"articleLive":2,"formTitle":"[544]输出比赛匹配对","frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"articleLive":2,"formTitle":"[545]二叉树的边界","frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"articleLive":2,"formTitle":"[546]移除盒子","frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","title":"移除盒子","titleSlug":"remove-boxes"},{"articleLive":2,"formTitle":"[547]省份数量","frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","title":"省份数量","titleSlug":"number-of-provinces"},{"articleLive":2,"formTitle":"[548]将数组分割成和相等的子数组","frontendQuestionId":"548","leaf":true,"level":2,"nodeType":"def","questionId":"548","status":"lock","title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"articleLive":2,"formTitle":"[549]二叉树中最长的连续序列","frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"articleLive":2,"formTitle":"[550]游戏玩法分析 IV","frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"articleLive":2,"formTitle":"[551]学生出勤记录 I","frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"articleLive":2,"formTitle":"[552]学生出勤记录 II","frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"articleLive":2,"formTitle":"[553]最优除法","frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","title":"最优除法","titleSlug":"optimal-division"},{"articleLive":2,"formTitle":"[554]砖墙","frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","title":"砖墙","titleSlug":"brick-wall"},{"articleLive":2,"formTitle":"[555]分割连接字符串","frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"articleLive":2,"formTitle":"[556]下一个更大元素 III","frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"articleLive":2,"formTitle":"[557]反转字符串中的单词 III","frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"articleLive":2,"formTitle":"[558]四叉树交集","frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"articleLive":2,"formTitle":"[559]N 叉树的最大深度","frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"articleLive":2,"formTitle":"[560]和为K的子数组","frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"articleLive":2,"formTitle":"[561]数组拆分 I","frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","title":"数组拆分 I","titleSlug":"array-partition-i"},{"articleLive":2,"formTitle":"[562]矩阵中最长的连续1线段","frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"articleLive":2,"formTitle":"[563]二叉树的坡度","frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"articleLive":2,"formTitle":"[564]寻找最近的回文数","frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"articleLive":2,"formTitle":"[565]数组嵌套","frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","title":"数组嵌套","titleSlug":"array-nesting"},{"articleLive":2,"formTitle":"[566]重塑矩阵","frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"articleLive":2,"formTitle":"[567]字符串的排列","frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","title":"字符串的排列","titleSlug":"permutation-in-string"},{"articleLive":2,"formTitle":"[568]最大休假天数","frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"articleLive":2,"formTitle":"[569]员工薪水中位数","frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"articleLive":2,"formTitle":"[570]至少有5名直接下属的经理","frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"articleLive":2,"formTitle":"[571]给定数字的频率查询中位数","frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"articleLive":2,"formTitle":"[572]另一个树的子树","frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","title":"另一个树的子树","titleSlug":"subtree-of-another-tree"},{"articleLive":2,"formTitle":"[573]松鼠模拟","frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"articleLive":2,"formTitle":"[574]当选者","frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","title":"当选者","titleSlug":"winning-candidate"},{"articleLive":2,"formTitle":"[575]分糖果","frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","title":"分糖果","titleSlug":"distribute-candies"},{"articleLive":2,"formTitle":"[576]出界的路径数","frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"articleLive":2,"formTitle":"[577]员工奖金","frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","title":"员工奖金","titleSlug":"employee-bonus"},{"articleLive":2,"formTitle":"[578]查询回答率最高的问题","frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"articleLive":2,"formTitle":"[579]查询员工的累计薪水","frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"articleLive":2,"formTitle":"[580]统计各专业学生人数","frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"articleLive":2,"formTitle":"[581]最短无序连续子数组","frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"","title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"articleLive":2,"formTitle":"[582]杀掉进程","frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","title":"杀掉进程","titleSlug":"kill-process"},{"articleLive":2,"formTitle":"[583]两个字符串的删除操作","frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"articleLive":2,"formTitle":"[584]寻找用户推荐人","frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"articleLive":2,"formTitle":"[585]2016年的投资","frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","title":"2016年的投资","titleSlug":"investments-in-2016"},{"articleLive":2,"formTitle":"[586]订单最多的客户","frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"articleLive":2,"formTitle":"[587]安装栅栏","frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","title":"安装栅栏","titleSlug":"erect-the-fence"},{"articleLive":2,"formTitle":"[588]设计内存文件系统","frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"articleLive":2,"formTitle":"[589]N 叉树的前序遍历","frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"articleLive":2,"formTitle":"[590]N 叉树的后序遍历","frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"articleLive":2,"formTitle":"[591]标签验证器","frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","title":"标签验证器","titleSlug":"tag-validator"},{"articleLive":2,"formTitle":"[592]分数加减运算","frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"articleLive":2,"formTitle":"[593]有效的正方形","frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","title":"有效的正方形","titleSlug":"valid-square"},{"articleLive":2,"formTitle":"[594]最长和谐子序列","frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"articleLive":2,"formTitle":"[595]大的国家","frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","title":"大的国家","titleSlug":"big-countries"},{"articleLive":2,"formTitle":"[596]超过5名学生的课","frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"articleLive":2,"formTitle":"[597]好友申请 I：总体通过率","frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"articleLive":2,"formTitle":"[598]范围求和 II","frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","title":"范围求和 II","titleSlug":"range-addition-ii"},{"articleLive":2,"formTitle":"[599]两个列表的最小索引总和","frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"articleLive":2,"formTitle":"[600]不含连续1的非负整数","frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"articleLive":2,"formTitle":"[601]体育馆的人流量","frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"articleLive":2,"formTitle":"[602]好友申请 II ：谁有最多的好友","frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"articleLive":2,"formTitle":"[603]连续空余座位","frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"articleLive":2,"formTitle":"[604]迭代压缩字符串","frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"articleLive":2,"formTitle":"[605]种花问题","frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","title":"种花问题","titleSlug":"can-place-flowers"},{"articleLive":2,"formTitle":"[606]根据二叉树创建字符串","frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"articleLive":2,"formTitle":"[607]销售员","frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","title":"销售员","titleSlug":"sales-person"},{"articleLive":2,"formTitle":"[608]树节点","frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","title":"树节点","titleSlug":"tree-node"},{"articleLive":2,"formTitle":"[609]在系统中查找重复文件","frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"articleLive":2,"formTitle":"[610]判断三角形","frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","title":"判断三角形","titleSlug":"triangle-judgement"},{"articleLive":2,"formTitle":"[611]有效三角形的个数","frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"articleLive":2,"formTitle":"[612]平面上的最近距离","frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"articleLive":2,"formTitle":"[613]直线上的最近距离","frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"articleLive":2,"formTitle":"[614]二级关注者","frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","title":"二级关注者","titleSlug":"second-degree-follower"},{"articleLive":2,"formTitle":"[615]平均工资：部门与公司比较","frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"articleLive":2,"formTitle":"[616]给字符串添加加粗标签","frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"articleLive":2,"formTitle":"[617]合并二叉树","frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"articleLive":2,"formTitle":"[618]学生地理信息报告","frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"articleLive":2,"formTitle":"[619]只出现一次的最大数字","frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"articleLive":2,"formTitle":"[620]有趣的电影","frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","title":"有趣的电影","titleSlug":"not-boring-movies"},{"articleLive":2,"formTitle":"[621]任务调度器","frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","title":"任务调度器","titleSlug":"task-scheduler"},{"articleLive":2,"formTitle":"[622]设计循环队列","frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","title":"设计循环队列","titleSlug":"design-circular-queue"},{"articleLive":2,"formTitle":"[623]在二叉树中增加一行","frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"articleLive":2,"formTitle":"[624]数组列表中的最大距离","frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"articleLive":2,"formTitle":"[625]最小因式分解","frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","title":"最小因式分解","titleSlug":"minimum-factorization"},{"articleLive":2,"formTitle":"[626]换座位","frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","title":"换座位","titleSlug":"exchange-seats"},{"articleLive":2,"formTitle":"[627]变更性别","frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","title":"变更性别","titleSlug":"swap-salary"},{"articleLive":2,"formTitle":"[628]三个数的最大乘积","frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"articleLive":2,"formTitle":"[629]K个逆序对数组","frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"articleLive":2,"formTitle":"[630]课程表 III","frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","title":"课程表 III","titleSlug":"course-schedule-iii"},{"articleLive":2,"formTitle":"[631]设计 Excel 求和公式","frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"articleLive":2,"formTitle":"[632]最小区间","frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"articleLive":2,"formTitle":"[633]平方数之和","frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"articleLive":2,"formTitle":"[634]寻找数组的错位排列","frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"articleLive":2,"formTitle":"[635]设计日志存储系统","frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"articleLive":2,"formTitle":"[636]函数的独占时间","frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"articleLive":2,"formTitle":"[637]二叉树的层平均值","frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"articleLive":2,"formTitle":"[638]大礼包","frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","title":"大礼包","titleSlug":"shopping-offers"},{"articleLive":2,"formTitle":"[639]解码方法 II","frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","title":"解码方法 II","titleSlug":"decode-ways-ii"},{"articleLive":2,"formTitle":"[640]求解方程","frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","title":"求解方程","titleSlug":"solve-the-equation"},{"articleLive":2,"formTitle":"[641]设计循环双端队列","frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"articleLive":2,"formTitle":"[642]设计搜索自动补全系统","frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"articleLive":2,"formTitle":"[643]子数组最大平均数 I","frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"articleLive":2,"formTitle":"[644]子数组最大平均数 II","frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"articleLive":2,"formTitle":"[645]错误的集合","frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","title":"错误的集合","titleSlug":"set-mismatch"},{"articleLive":2,"formTitle":"[646]最长数对链","frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"articleLive":2,"formTitle":"[647]回文子串","frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","title":"回文子串","titleSlug":"palindromic-substrings"},{"articleLive":2,"formTitle":"[648]单词替换","frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","title":"单词替换","titleSlug":"replace-words"},{"articleLive":2,"formTitle":"[649]Dota2 参议院","frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","title":"Dota2 参议院","titleSlug":"dota2-senate"},{"articleLive":2,"formTitle":"[650]只有两个键的键盘","frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"articleLive":2,"formTitle":"[651]4键键盘","frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","title":"4键键盘","titleSlug":"4-keys-keyboard"},{"articleLive":2,"formTitle":"[652]寻找重复的子树","frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"articleLive":2,"formTitle":"[653]两数之和 IV - 输入 BST","frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"articleLive":2,"formTitle":"[654]最大二叉树","frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"articleLive":2,"formTitle":"[655]输出二叉树","frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","title":"输出二叉树","titleSlug":"print-binary-tree"},{"articleLive":2,"formTitle":"[656]金币路径","frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","title":"金币路径","titleSlug":"coin-path"},{"articleLive":2,"formTitle":"[657]机器人能否返回原点","frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"articleLive":2,"formTitle":"[658]找到 K 个最接近的元素","frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"articleLive":2,"formTitle":"[659]分割数组为连续子序列","frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"articleLive":2,"formTitle":"[660]移除 9","frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","title":"移除 9","titleSlug":"remove-9"},{"articleLive":2,"formTitle":"[661]图片平滑器","frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","title":"图片平滑器","titleSlug":"image-smoother"},{"articleLive":2,"formTitle":"[662]二叉树最大宽度","frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"articleLive":2,"formTitle":"[663]均匀树划分","frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","title":"均匀树划分","titleSlug":"equal-tree-partition"},{"articleLive":2,"formTitle":"[664]奇怪的打印机","frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","title":"奇怪的打印机","titleSlug":"strange-printer"},{"articleLive":2,"formTitle":"[665]非递减数列","frontendQuestionId":"665","leaf":true,"level":1,"nodeType":"def","questionId":"665","status":"","title":"非递减数列","titleSlug":"non-decreasing-array"},{"articleLive":2,"formTitle":"[666]路径总和 IV","frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","title":"路径总和 IV","titleSlug":"path-sum-iv"},{"articleLive":2,"formTitle":"[667]优美的排列 II","frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"articleLive":2,"formTitle":"[668]乘法表中第k小的数","frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"articleLive":2,"formTitle":"[669]修剪二叉搜索树","frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"articleLive":2,"formTitle":"[670]最大交换","frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","title":"最大交换","titleSlug":"maximum-swap"},{"articleLive":2,"formTitle":"[671]二叉树中第二小的节点","frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"notac","title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"articleLive":2,"formTitle":"[672]灯泡开关 Ⅱ","frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"articleLive":2,"formTitle":"[673]最长递增子序列的个数","frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"articleLive":2,"formTitle":"[674]最长连续递增序列","frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"articleLive":2,"formTitle":"[675]为高尔夫比赛砍树","frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"articleLive":2,"formTitle":"[676]实现一个魔法字典","frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"articleLive":2,"formTitle":"[677]键值映射","frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","title":"键值映射","titleSlug":"map-sum-pairs"},{"articleLive":2,"formTitle":"[678]有效的括号字符串","frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"articleLive":2,"formTitle":"[679]24 点游戏","frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","title":"24 点游戏","titleSlug":"24-game"},{"articleLive":2,"formTitle":"[680]验证回文字符串 Ⅱ","frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"articleLive":2,"formTitle":"[681]最近时刻","frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","title":"最近时刻","titleSlug":"next-closest-time"},{"articleLive":2,"formTitle":"[682]棒球比赛","frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","title":"棒球比赛","titleSlug":"baseball-game"},{"articleLive":2,"formTitle":"[683]K 个关闭的灯泡","frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"articleLive":2,"formTitle":"[684]冗余连接","frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","title":"冗余连接","titleSlug":"redundant-connection"},{"articleLive":2,"formTitle":"[685]冗余连接 II","frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"articleLive":2,"formTitle":"[686]重复叠加字符串匹配","frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"articleLive":2,"formTitle":"[687]最长同值路径","frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","title":"最长同值路径","titleSlug":"longest-univalue-path"},{"articleLive":2,"formTitle":"[688]“马”在棋盘上的概率","frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"articleLive":2,"formTitle":"[689]三个无重叠子数组的最大和","frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"articleLive":2,"formTitle":"[690]员工的重要性","frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"","title":"员工的重要性","titleSlug":"employee-importance"},{"articleLive":2,"formTitle":"[691]贴纸拼词","frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"articleLive":2,"formTitle":"[692]前K个高频单词","frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"articleLive":2,"formTitle":"[693]交替位二进制数","frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"articleLive":2,"formTitle":"[694]不同岛屿的数量","frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"articleLive":2,"formTitle":"[695]岛屿的最大面积","frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"articleLive":2,"formTitle":"[696]计数二进制子串","frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"articleLive":2,"formTitle":"[697]数组的度","frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","title":"数组的度","titleSlug":"degree-of-an-array"},{"articleLive":2,"formTitle":"[698]划分为k个相等的子集","frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"articleLive":2,"formTitle":"[699]掉落的方块","frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","title":"掉落的方块","titleSlug":"falling-squares"},{"articleLive":2,"formTitle":"[700]二叉搜索树中的搜索","frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"articleLive":2,"formTitle":"[701]二叉搜索树中的插入操作","frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"articleLive":2,"formTitle":"[702]搜索长度未知的有序数组","frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"articleLive":2,"formTitle":"[703]数据流中的第 K 大元素","frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"articleLive":2,"formTitle":"[704]二分查找","frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","title":"二分查找","titleSlug":"binary-search"},{"articleLive":2,"formTitle":"[705]设计哈希集合","frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","title":"设计哈希集合","titleSlug":"design-hashset"},{"articleLive":2,"formTitle":"[706]设计哈希映射","frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","title":"设计哈希映射","titleSlug":"design-hashmap"},{"articleLive":2,"formTitle":"[707]设计链表","frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","title":"设计链表","titleSlug":"design-linked-list"},{"articleLive":2,"formTitle":"[708]循环有序列表的插入","frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"articleLive":2,"formTitle":"[709]转换成小写字母","frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","title":"转换成小写字母","titleSlug":"to-lower-case"},{"articleLive":2,"formTitle":"[710]黑名单中的随机数","frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"articleLive":2,"formTitle":"[711]不同岛屿的数量 II","frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"articleLive":2,"formTitle":"[712]两个字符串的最小ASCII删除和","frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"articleLive":2,"formTitle":"[713]乘积小于K的子数组","frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"articleLive":2,"formTitle":"[714]买卖股票的最佳时机含手续费","frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"articleLive":2,"formTitle":"[715]Range 模块","frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","title":"Range 模块","titleSlug":"range-module"},{"articleLive":2,"formTitle":"[716]最大栈","frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","title":"最大栈","titleSlug":"max-stack"},{"articleLive":2,"formTitle":"[717]1比特与2比特字符","frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"articleLive":2,"formTitle":"[718]最长重复子数组","frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"articleLive":2,"formTitle":"[719]找出第 k 小的距离对","frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"articleLive":2,"formTitle":"[720]词典中最长的单词","frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"articleLive":2,"formTitle":"[721]账户合并","frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","title":"账户合并","titleSlug":"accounts-merge"},{"articleLive":2,"formTitle":"[722]删除注释","frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","title":"删除注释","titleSlug":"remove-comments"},{"articleLive":2,"formTitle":"[723]粉碎糖果","frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","title":"粉碎糖果","titleSlug":"candy-crush"},{"articleLive":2,"formTitle":"[724]寻找数组的中心下标","frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"articleLive":2,"formTitle":"[725]分隔链表","frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"articleLive":2,"formTitle":"[726]原子的数量","frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","title":"原子的数量","titleSlug":"number-of-atoms"},{"articleLive":2,"formTitle":"[727]最小窗口子序列","frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"articleLive":2,"formTitle":"[728]自除数","frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","title":"自除数","titleSlug":"self-dividing-numbers"},{"articleLive":2,"formTitle":"[729]我的日程安排表 I","frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"articleLive":2,"formTitle":"[730]统计不同回文子序列","frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"articleLive":2,"formTitle":"[731]我的日程安排表 II","frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"articleLive":2,"formTitle":"[732]我的日程安排表 III","frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"articleLive":2,"formTitle":"[733]图像渲染","frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","title":"图像渲染","titleSlug":"flood-fill"},{"articleLive":2,"formTitle":"[734]句子相似性","frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","title":"句子相似性","titleSlug":"sentence-similarity"},{"articleLive":2,"formTitle":"[735]行星碰撞","frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","title":"行星碰撞","titleSlug":"asteroid-collision"},{"articleLive":2,"formTitle":"[736]Lisp 语法解析","frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"articleLive":2,"formTitle":"[737]句子相似性 II","frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"articleLive":2,"formTitle":"[738]单调递增的数字","frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"articleLive":2,"formTitle":"[739]每日温度","frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","title":"每日温度","titleSlug":"daily-temperatures"},{"articleLive":2,"formTitle":"[740]删除并获得点数","frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","title":"删除并获得点数","titleSlug":"delete-and-earn"},{"articleLive":2,"formTitle":"[741]摘樱桃","frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","title":"摘樱桃","titleSlug":"cherry-pickup"},{"articleLive":2,"formTitle":"[742]二叉树最近的叶节点","frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"articleLive":2,"formTitle":"[743]网络延迟时间","frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","title":"网络延迟时间","titleSlug":"network-delay-time"},{"articleLive":2,"formTitle":"[744]寻找比目标字母大的最小字母","frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"articleLive":2,"formTitle":"[745]前缀和后缀搜索","frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"articleLive":2,"formTitle":"[746]使用最小花费爬楼梯","frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"articleLive":2,"formTitle":"[747]至少是其他数字两倍的最大数","frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"articleLive":2,"formTitle":"[748]最短补全词","frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","title":"最短补全词","titleSlug":"shortest-completing-word"},{"articleLive":2,"formTitle":"[749]隔离病毒","frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","title":"隔离病毒","titleSlug":"contain-virus"},{"articleLive":2,"formTitle":"[750]角矩形的数量","frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"articleLive":2,"formTitle":"[751]IP 到 CIDR","frontendQuestionId":"751","leaf":true,"level":1,"nodeType":"def","questionId":"752","status":"lock","title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"articleLive":2,"formTitle":"[752]打开转盘锁","frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","title":"打开转盘锁","titleSlug":"open-the-lock"},{"articleLive":2,"formTitle":"[753]破解保险箱","frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","title":"破解保险箱","titleSlug":"cracking-the-safe"},{"articleLive":2,"formTitle":"[754]到达终点数字","frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","title":"到达终点数字","titleSlug":"reach-a-number"},{"articleLive":2,"formTitle":"[755]倒水","frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","title":"倒水","titleSlug":"pour-water"},{"articleLive":2,"formTitle":"[756]金字塔转换矩阵","frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"articleLive":2,"formTitle":"[757]设置交集大小至少为2","frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"articleLive":2,"formTitle":"[758]字符串中的加粗单词","frontendQuestionId":"758","leaf":true,"level":1,"nodeType":"def","questionId":"760","status":"lock","title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"articleLive":2,"formTitle":"[759]员工空闲时间","frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","title":"员工空闲时间","titleSlug":"employee-free-time"},{"articleLive":2,"formTitle":"[760]找出变位映射","frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"articleLive":2,"formTitle":"[761]特殊的二进制序列","frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"articleLive":2,"formTitle":"[762]二进制表示中质数个计算置位","frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"articleLive":2,"formTitle":"[763]划分字母区间","frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","title":"划分字母区间","titleSlug":"partition-labels"},{"articleLive":2,"formTitle":"[764]最大加号标志","frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","title":"最大加号标志","titleSlug":"largest-plus-sign"},{"articleLive":2,"formTitle":"[765]情侣牵手","frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","title":"情侣牵手","titleSlug":"couples-holding-hands"},{"articleLive":2,"formTitle":"[766]托普利茨矩阵","frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"articleLive":2,"formTitle":"[767]重构字符串","frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","title":"重构字符串","titleSlug":"reorganize-string"},{"articleLive":2,"formTitle":"[768]最多能完成排序的块 II","frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"articleLive":2,"formTitle":"[769]最多能完成排序的块","frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"articleLive":2,"formTitle":"[770]基本计算器 IV","frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"articleLive":2,"formTitle":"[771]宝石与石头","frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","title":"宝石与石头","titleSlug":"jewels-and-stones"},{"articleLive":2,"formTitle":"[772]基本计算器 III","frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"articleLive":2,"formTitle":"[773]滑动谜题","frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","title":"滑动谜题","titleSlug":"sliding-puzzle"},{"articleLive":2,"formTitle":"[774]最小化去加油站的最大距离","frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"articleLive":2,"formTitle":"[775]全局倒置与局部倒置","frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"articleLive":2,"formTitle":"[776]拆分二叉搜索树","frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","title":"拆分二叉搜索树","titleSlug":"split-bst"},{"articleLive":2,"formTitle":"[777]在LR字符串中交换相邻字符","frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"articleLive":2,"formTitle":"[778]水位上升的泳池中游泳","frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"articleLive":2,"formTitle":"[779]第K个语法符号","frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"articleLive":2,"formTitle":"[780]到达终点","frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","title":"到达终点","titleSlug":"reaching-points"},{"articleLive":2,"formTitle":"[781]森林中的兔子","frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"articleLive":2,"formTitle":"[782]变为棋盘","frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"articleLive":2,"formTitle":"[783]二叉搜索树节点最小距离","frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"articleLive":2,"formTitle":"[784]字母大小写全排列","frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"articleLive":2,"formTitle":"[785]判断二分图","frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","title":"判断二分图","titleSlug":"is-graph-bipartite"},{"articleLive":2,"formTitle":"[786]第 K 个最小的素数分数","frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"articleLive":2,"formTitle":"[787]K 站中转内最便宜的航班","frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"articleLive":2,"formTitle":"[788]旋转数字","frontendQuestionId":"788","leaf":true,"level":1,"nodeType":"def","questionId":"804","status":"","title":"旋转数字","titleSlug":"rotated-digits"},{"articleLive":2,"formTitle":"[789]逃脱阻碍者","frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"articleLive":2,"formTitle":"[790]多米诺和托米诺平铺","frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"articleLive":2,"formTitle":"[791]自定义字符串排序","frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"articleLive":2,"formTitle":"[792]匹配子序列的单词数","frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"articleLive":2,"formTitle":"[793]阶乘函数后 K 个零","frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"articleLive":2,"formTitle":"[794]有效的井字游戏","frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"articleLive":2,"formTitle":"[795]区间子数组个数","frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"articleLive":2,"formTitle":"[796]旋转字符串","frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","title":"旋转字符串","titleSlug":"rotate-string"},{"articleLive":2,"formTitle":"[797]所有可能的路径","frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"articleLive":2,"formTitle":"[798]得分最高的最小轮调","frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"articleLive":2,"formTitle":"[799]香槟塔","frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","title":"香槟塔","titleSlug":"champagne-tower"},{"articleLive":2,"formTitle":"[800]相似 RGB 颜色","frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"articleLive":2,"formTitle":"[801]使序列递增的最小交换次数","frontendQuestionId":"801","leaf":true,"level":2,"nodeType":"def","questionId":"819","status":"","title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"articleLive":2,"formTitle":"[802]找到最终的安全状态","frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"articleLive":2,"formTitle":"[803]打砖块","frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"articleLive":2,"formTitle":"[804]唯一摩尔斯密码词","frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"articleLive":2,"formTitle":"[805]数组的均值分割","frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"articleLive":2,"formTitle":"[806]写字符串需要的行数","frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"articleLive":2,"formTitle":"[807]保持城市天际线","frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"articleLive":2,"formTitle":"[808]分汤","frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","title":"分汤","titleSlug":"soup-servings"},{"articleLive":2,"formTitle":"[809]情感丰富的文字","frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","title":"情感丰富的文字","titleSlug":"expressive-words"},{"articleLive":2,"formTitle":"[810]黑板异或游戏","frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"articleLive":2,"formTitle":"[811]子域名访问计数","frontendQuestionId":"811","leaf":true,"level":1,"nodeType":"def","questionId":"829","status":"","title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"articleLive":2,"formTitle":"[812]最大三角形面积","frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"articleLive":2,"formTitle":"[813]最大平均值和的分组","frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"articleLive":2,"formTitle":"[814]二叉树剪枝","frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"articleLive":2,"formTitle":"[815]公交路线","frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","title":"公交路线","titleSlug":"bus-routes"},{"articleLive":2,"formTitle":"[816]模糊坐标","frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"articleLive":2,"formTitle":"[817]链表组件","frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","title":"链表组件","titleSlug":"linked-list-components"},{"articleLive":2,"formTitle":"[818]赛车","frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","title":"赛车","titleSlug":"race-car"},{"articleLive":2,"formTitle":"[819]最常见的单词","frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","title":"最常见的单词","titleSlug":"most-common-word"},{"articleLive":2,"formTitle":"[820]单词的压缩编码","frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"articleLive":2,"formTitle":"[821]字符的最短距离","frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"articleLive":2,"formTitle":"[822]翻转卡片游戏","frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"articleLive":2,"formTitle":"[823]带因子的二叉树","frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"articleLive":2,"formTitle":"[824]山羊拉丁文","frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","title":"山羊拉丁文","titleSlug":"goat-latin"},{"articleLive":2,"formTitle":"[825]适龄的朋友","frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"articleLive":2,"formTitle":"[826]安排工作以达到最大收益","frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"articleLive":2,"formTitle":"[827]最大人工岛","frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","title":"最大人工岛","titleSlug":"making-a-large-island"},{"articleLive":2,"formTitle":"[828]统计子串中的唯一字符","frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"articleLive":2,"formTitle":"[829]连续整数求和","frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"articleLive":2,"formTitle":"[830]较大分组的位置","frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"articleLive":2,"formTitle":"[831]隐藏个人信息","frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"articleLive":2,"formTitle":"[832]翻转图像","frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","title":"翻转图像","titleSlug":"flipping-an-image"},{"articleLive":2,"formTitle":"[833]字符串中的查找与替换","frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"articleLive":2,"formTitle":"[834]树中距离之和","frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"articleLive":2,"formTitle":"[835]图像重叠","frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","title":"图像重叠","titleSlug":"image-overlap"},{"articleLive":2,"formTitle":"[836]矩形重叠","frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","title":"矩形重叠","titleSlug":"rectangle-overlap"},{"articleLive":2,"formTitle":"[837]新21点","frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","title":"新21点","titleSlug":"new-21-game"},{"articleLive":2,"formTitle":"[838]推多米诺","frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","title":"推多米诺","titleSlug":"push-dominoes"},{"articleLive":2,"formTitle":"[839]相似字符串组","frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","title":"相似字符串组","titleSlug":"similar-string-groups"},{"articleLive":2,"formTitle":"[840]矩阵中的幻方","frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"articleLive":2,"formTitle":"[841]钥匙和房间","frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"articleLive":2,"formTitle":"[842]将数组拆分成斐波那契序列","frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"articleLive":2,"formTitle":"[843]猜猜这个单词","frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","title":"猜猜这个单词","titleSlug":"guess-the-word"},{"articleLive":2,"formTitle":"[844]比较含退格的字符串","frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"articleLive":2,"formTitle":"[845]数组中的最长山脉","frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"articleLive":2,"formTitle":"[846]一手顺子","frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","title":"一手顺子","titleSlug":"hand-of-straights"},{"articleLive":2,"formTitle":"[847]访问所有节点的最短路径","frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"articleLive":2,"formTitle":"[848]字母移位","frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","title":"字母移位","titleSlug":"shifting-letters"},{"articleLive":2,"formTitle":"[849]到最近的人的最大距离","frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"articleLive":2,"formTitle":"[850]矩形面积 II","frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"articleLive":2,"formTitle":"[851]喧闹和富有","frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","title":"喧闹和富有","titleSlug":"loud-and-rich"},{"articleLive":2,"formTitle":"[852]山脉数组的峰顶索引","frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"articleLive":2,"formTitle":"[853]车队","frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","title":"车队","titleSlug":"car-fleet"},{"articleLive":2,"formTitle":"[854]相似度为 K 的字符串","frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"articleLive":2,"formTitle":"[855]考场就座","frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","title":"考场就座","titleSlug":"exam-room"},{"articleLive":2,"formTitle":"[856]括号的分数","frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","title":"括号的分数","titleSlug":"score-of-parentheses"},{"articleLive":2,"formTitle":"[857]雇佣 K 名工人的最低成本","frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"articleLive":2,"formTitle":"[858]镜面反射","frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","title":"镜面反射","titleSlug":"mirror-reflection"},{"articleLive":2,"formTitle":"[859]亲密字符串","frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","title":"亲密字符串","titleSlug":"buddy-strings"},{"articleLive":2,"formTitle":"[860]柠檬水找零","frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","title":"柠檬水找零","titleSlug":"lemonade-change"},{"articleLive":2,"formTitle":"[861]翻转矩阵后的得分","frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"articleLive":2,"formTitle":"[862]和至少为 K 的最短子数组","frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"articleLive":2,"formTitle":"[863]二叉树中所有距离为 K 的结点","frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"articleLive":2,"formTitle":"[864]获取所有钥匙的最短路径","frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"articleLive":2,"formTitle":"[865]具有所有最深节点的最小子树","frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"articleLive":2,"formTitle":"[866]回文素数","frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","title":"回文素数","titleSlug":"prime-palindrome"},{"articleLive":2,"formTitle":"[867]转置矩阵","frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","title":"转置矩阵","titleSlug":"transpose-matrix"},{"articleLive":2,"formTitle":"[868]二进制间距","frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","title":"二进制间距","titleSlug":"binary-gap"},{"articleLive":2,"formTitle":"[869]重新排序得到 2 的幂","frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"articleLive":2,"formTitle":"[870]优势洗牌","frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","title":"优势洗牌","titleSlug":"advantage-shuffle"},{"articleLive":2,"formTitle":"[871]最低加油次数","frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"articleLive":2,"formTitle":"[872]叶子相似的树","frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"articleLive":2,"formTitle":"[873]最长的斐波那契子序列的长度","frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"articleLive":2,"formTitle":"[874]模拟行走机器人","frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"articleLive":2,"formTitle":"[875]爱吃香蕉的珂珂","frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"articleLive":2,"formTitle":"[876]链表的中间结点","frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"articleLive":2,"formTitle":"[877]石子游戏","frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","title":"石子游戏","titleSlug":"stone-game"},{"articleLive":2,"formTitle":"[878]第 N 个神奇数字","frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"articleLive":2,"formTitle":"[879]盈利计划","frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","title":"盈利计划","titleSlug":"profitable-schemes"},{"articleLive":2,"formTitle":"[880]索引处的解码字符串","frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"articleLive":2,"formTitle":"[881]救生艇","frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","title":"救生艇","titleSlug":"boats-to-save-people"},{"articleLive":2,"formTitle":"[882]细分图中的可到达结点","frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"articleLive":2,"formTitle":"[883]三维形体投影面积","frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"articleLive":2,"formTitle":"[884]两句话中的不常见单词","frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"articleLive":2,"formTitle":"[885]螺旋矩阵 III","frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"articleLive":2,"formTitle":"[886]可能的二分法","frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","title":"可能的二分法","titleSlug":"possible-bipartition"},{"articleLive":2,"formTitle":"[887]鸡蛋掉落","frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"articleLive":2,"formTitle":"[888]公平的糖果棒交换","frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"articleLive":2,"formTitle":"[889]根据前序和后序遍历构造二叉树","frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"articleLive":2,"formTitle":"[890]查找和替换模式","frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"articleLive":2,"formTitle":"[891]子序列宽度之和","frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"articleLive":2,"formTitle":"[892]三维形体的表面积","frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"articleLive":2,"formTitle":"[893]特殊等价字符串组","frontendQuestionId":"893","leaf":true,"level":1,"nodeType":"def","questionId":"929","status":"","title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"articleLive":2,"formTitle":"[894]所有可能的满二叉树","frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"articleLive":2,"formTitle":"[895]最大频率栈","frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"articleLive":2,"formTitle":"[896]单调数列","frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","title":"单调数列","titleSlug":"monotonic-array"},{"articleLive":2,"formTitle":"[897]递增顺序搜索树","frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"articleLive":2,"formTitle":"[898]子数组按位或操作","frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"articleLive":2,"formTitle":"[899]有序队列","frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","title":"有序队列","titleSlug":"orderly-queue"},{"articleLive":2,"formTitle":"[900]RLE 迭代器","frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","title":"RLE 迭代器","titleSlug":"rle-iterator"},{"articleLive":2,"formTitle":"[901]股票价格跨度","frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","title":"股票价格跨度","titleSlug":"online-stock-span"},{"articleLive":2,"formTitle":"[902]最大为 N 的数字组合","frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"articleLive":2,"formTitle":"[903]DI 序列的有效排列","frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"articleLive":2,"formTitle":"[904]水果成篮","frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","title":"水果成篮","titleSlug":"fruit-into-baskets"},{"articleLive":2,"formTitle":"[905]按奇偶排序数组","frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"articleLive":2,"formTitle":"[906]超级回文数","frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","title":"超级回文数","titleSlug":"super-palindromes"},{"articleLive":2,"formTitle":"[907]子数组的最小值之和","frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"articleLive":2,"formTitle":"[908]最小差值 I","frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","title":"最小差值 I","titleSlug":"smallest-range-i"},{"articleLive":2,"formTitle":"[909]蛇梯棋","frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"articleLive":2,"formTitle":"[910]最小差值 II","frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","title":"最小差值 II","titleSlug":"smallest-range-ii"},{"articleLive":2,"formTitle":"[911]在线选举","frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","title":"在线选举","titleSlug":"online-election"},{"articleLive":2,"formTitle":"[912]排序数组","frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","title":"排序数组","titleSlug":"sort-an-array"},{"articleLive":2,"formTitle":"[913]猫和老鼠","frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"articleLive":2,"formTitle":"[914]卡牌分组","frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"","title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"articleLive":2,"formTitle":"[915]分割数组","frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"articleLive":2,"formTitle":"[916]单词子集","frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","title":"单词子集","titleSlug":"word-subsets"},{"articleLive":2,"formTitle":"[917]仅仅反转字母","frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"articleLive":2,"formTitle":"[918]环形子数组的最大和","frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"articleLive":2,"formTitle":"[919]完全二叉树插入器","frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"articleLive":2,"formTitle":"[920]播放列表的数量","frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"articleLive":2,"formTitle":"[921]使括号有效的最少添加","frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"articleLive":2,"formTitle":"[922]按奇偶排序数组 II","frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"articleLive":2,"formTitle":"[923]三数之和的多种可能","frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"articleLive":2,"formTitle":"[924]尽量减少恶意软件的传播","frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"articleLive":2,"formTitle":"[925]长按键入","frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","title":"长按键入","titleSlug":"long-pressed-name"},{"articleLive":2,"formTitle":"[926]将字符串翻转到单调递增","frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"articleLive":2,"formTitle":"[927]三等分","frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","title":"三等分","titleSlug":"three-equal-parts"},{"articleLive":2,"formTitle":"[928]尽量减少恶意软件的传播 II","frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"articleLive":2,"formTitle":"[929]独特的电子邮件地址","frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"articleLive":2,"formTitle":"[930]和相同的二元子数组","frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"articleLive":2,"formTitle":"[931]下降路径最小和","frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"articleLive":2,"formTitle":"[932]漂亮数组","frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","title":"漂亮数组","titleSlug":"beautiful-array"},{"articleLive":2,"formTitle":"[933]最近的请求次数","frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"articleLive":2,"formTitle":"[934]最短的桥","frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","title":"最短的桥","titleSlug":"shortest-bridge"},{"articleLive":2,"formTitle":"[935]骑士拨号器","frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","title":"骑士拨号器","titleSlug":"knight-dialer"},{"articleLive":2,"formTitle":"[936]戳印序列","frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","title":"戳印序列","titleSlug":"stamping-the-sequence"},{"articleLive":2,"formTitle":"[937]重新排列日志文件","frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"articleLive":2,"formTitle":"[938]二叉搜索树的范围和","frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"articleLive":2,"formTitle":"[939]最小面积矩形","frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"articleLive":2,"formTitle":"[940]不同的子序列 II","frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"articleLive":2,"formTitle":"[941]有效的山脉数组","frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"articleLive":2,"formTitle":"[942]增减字符串匹配","frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","title":"增减字符串匹配","titleSlug":"di-string-match"},{"articleLive":2,"formTitle":"[943]最短超级串","frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"articleLive":2,"formTitle":"[944]删列造序","frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"articleLive":2,"formTitle":"[945]使数组唯一的最小增量","frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"articleLive":2,"formTitle":"[946]验证栈序列","frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"articleLive":2,"formTitle":"[947]移除最多的同行或同列石头","frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"articleLive":2,"formTitle":"[948]令牌放置","frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","title":"令牌放置","titleSlug":"bag-of-tokens"},{"articleLive":2,"formTitle":"[949]给定数字能组成的最大时间","frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"articleLive":2,"formTitle":"[950]按递增顺序显示卡牌","frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"articleLive":2,"formTitle":"[951]翻转等价二叉树","frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"articleLive":2,"formTitle":"[952]按公因数计算最大组件大小","frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"articleLive":2,"formTitle":"[953]验证外星语词典","frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"articleLive":2,"formTitle":"[954]二倍数对数组","frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"articleLive":2,"formTitle":"[955]删列造序 II","frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"articleLive":2,"formTitle":"[956]最高的广告牌","frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","title":"最高的广告牌","titleSlug":"tallest-billboard"},{"articleLive":2,"formTitle":"[957]N 天后的牢房","frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"articleLive":2,"formTitle":"[958]二叉树的完全性检验","frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"articleLive":2,"formTitle":"[959]由斜杠划分区域","frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"articleLive":2,"formTitle":"[960]删列造序 III","frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"articleLive":2,"formTitle":"[961]重复 N 次的元素","frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"articleLive":2,"formTitle":"[962]最大宽度坡","frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"articleLive":2,"formTitle":"[963]最小面积矩形 II","frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"articleLive":2,"formTitle":"[964]表示数字的最少运算符","frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"articleLive":2,"formTitle":"[965]单值二叉树","frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"articleLive":2,"formTitle":"[966]元音拼写检查器","frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"articleLive":2,"formTitle":"[967]连续差相同的数字","frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"articleLive":2,"formTitle":"[968]监控二叉树","frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"articleLive":2,"formTitle":"[969]煎饼排序","frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","title":"煎饼排序","titleSlug":"pancake-sorting"},{"articleLive":2,"formTitle":"[970]强整数","frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","title":"强整数","titleSlug":"powerful-integers"},{"articleLive":2,"formTitle":"[971]翻转二叉树以匹配先序遍历","frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"articleLive":2,"formTitle":"[972]相等的有理数","frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"articleLive":2,"formTitle":"[973]最接近原点的 K 个点","frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"articleLive":2,"formTitle":"[974]和可被 K 整除的子数组","frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"articleLive":2,"formTitle":"[975]奇偶跳","frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","title":"奇偶跳","titleSlug":"odd-even-jump"},{"articleLive":2,"formTitle":"[976]三角形的最大周长","frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"articleLive":2,"formTitle":"[977]有序数组的平方","frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"articleLive":2,"formTitle":"[978]最长湍流子数组","frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"articleLive":2,"formTitle":"[979]在二叉树中分配硬币","frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"articleLive":2,"formTitle":"[980]不同路径 III","frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","title":"不同路径 III","titleSlug":"unique-paths-iii"},{"articleLive":2,"formTitle":"[981]基于时间的键值存储","frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"articleLive":2,"formTitle":"[982]按位与为零的三元组","frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"articleLive":2,"formTitle":"[983]最低票价","frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"articleLive":2,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"articleLive":2,"formTitle":"[985]查询后的偶数和","frontendQuestionId":"985","leaf":true,"level":1,"nodeType":"def","questionId":"1027","status":"","title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"articleLive":2,"formTitle":"[986]区间列表的交集","frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"articleLive":2,"formTitle":"[987]二叉树的垂序遍历","frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"","title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"articleLive":2,"formTitle":"[988]从叶结点开始的最小字符串","frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"articleLive":2,"formTitle":"[989]数组形式的整数加法","frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"articleLive":2,"formTitle":"[990]等式方程的可满足性","frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"articleLive":2,"formTitle":"[991]坏了的计算器","frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","title":"坏了的计算器","titleSlug":"broken-calculator"},{"articleLive":2,"formTitle":"[992]K 个不同整数的子数组","frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"articleLive":2,"formTitle":"[993]二叉树的堂兄弟节点","frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"articleLive":2,"formTitle":"[994]腐烂的橘子","frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"articleLive":2,"formTitle":"[995]K 连续位的最小翻转次数","frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"articleLive":2,"formTitle":"[996]正方形数组的数目","frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"articleLive":2,"formTitle":"[997]找到小镇的法官","frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"articleLive":2,"formTitle":"[998]最大二叉树 II","frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"articleLive":2,"formTitle":"[999]可以被一步捕获的棋子数","frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"articleLive":2,"formTitle":"[1000]合并石头的最低成本","frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"articleLive":2,"formTitle":"[1001]网格照明","frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","title":"网格照明","titleSlug":"grid-illumination"},{"articleLive":2,"formTitle":"[1002]查找常用字符","frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","title":"查找常用字符","titleSlug":"find-common-characters"},{"articleLive":2,"formTitle":"[1003]检查替换后的词是否有效","frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"articleLive":2,"formTitle":"[1004]最大连续1的个数 III","frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"articleLive":2,"formTitle":"[1005]K 次取反后最大化的数组和","frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"articleLive":2,"formTitle":"[1006]笨阶乘","frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","title":"笨阶乘","titleSlug":"clumsy-factorial"},{"articleLive":2,"formTitle":"[1007]行相等的最少多米诺旋转","frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"articleLive":2,"formTitle":"[1008]前序遍历构造二叉搜索树","frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"articleLive":2,"formTitle":"[1009]十进制整数的反码","frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"articleLive":2,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"articleLive":2,"formTitle":"[1011]在 D 天内送达包裹的能力","frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"articleLive":2,"formTitle":"[1012]至少有 1 位重复的数字","frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"articleLive":2,"formTitle":"[1013]将数组分成和相等的三个部分","frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"articleLive":2,"formTitle":"[1014]最佳观光组合","frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"articleLive":2,"formTitle":"[1015]可被 K 整除的最小整数","frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"articleLive":2,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"articleLive":2,"formTitle":"[1017]负二进制转换","frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","title":"负二进制转换","titleSlug":"convert-to-base-2"},{"articleLive":2,"formTitle":"[1018]可被 5 整除的二进制前缀","frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"articleLive":2,"formTitle":"[1019]链表中的下一个更大节点","frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"articleLive":2,"formTitle":"[1020]飞地的数量","frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","title":"飞地的数量","titleSlug":"number-of-enclaves"},{"articleLive":2,"formTitle":"[1021]删除最外层的括号","frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"articleLive":2,"formTitle":"[1022]从根到叶的二进制数之和","frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"articleLive":2,"formTitle":"[1023]驼峰式匹配","frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"articleLive":2,"formTitle":"[1024]视频拼接","frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","title":"视频拼接","titleSlug":"video-stitching"},{"articleLive":2,"formTitle":"[1025]除数博弈","frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","title":"除数博弈","titleSlug":"divisor-game"},{"articleLive":2,"formTitle":"[1026]节点与其祖先之间的最大差值","frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"articleLive":2,"formTitle":"[1027]最长等差数列","frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"articleLive":2,"formTitle":"[1028]从先序遍历还原二叉树","frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"articleLive":2,"formTitle":"[1029]两地调度","frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","title":"两地调度","titleSlug":"two-city-scheduling"},{"articleLive":2,"formTitle":"[1030]距离顺序排列矩阵单元格","frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"articleLive":2,"formTitle":"[1031]两个非重叠子数组的最大和","frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"articleLive":2,"formTitle":"[1032]字符流","frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","title":"字符流","titleSlug":"stream-of-characters"},{"articleLive":2,"formTitle":"[1033]移动石子直到连续","frontendQuestionId":"1033","leaf":true,"level":1,"nodeType":"def","questionId":"1103","status":"","title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"articleLive":2,"formTitle":"[1034]边框着色","frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","title":"边框着色","titleSlug":"coloring-a-border"},{"articleLive":2,"formTitle":"[1035]不相交的线","frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","title":"不相交的线","titleSlug":"uncrossed-lines"},{"articleLive":2,"formTitle":"[1036]逃离大迷宫","frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"articleLive":2,"formTitle":"[1037]有效的回旋镖","frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"articleLive":2,"formTitle":"[1038]把二叉搜索树转换为累加树","frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"articleLive":2,"formTitle":"[1039]多边形三角剖分的最低得分","frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"articleLive":2,"formTitle":"[1040]移动石子直到连续 II","frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"articleLive":2,"formTitle":"[1041]困于环中的机器人","frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"articleLive":2,"formTitle":"[1042]不邻接植花","frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"articleLive":2,"formTitle":"[1043]分隔数组以得到最大和","frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"articleLive":2,"formTitle":"[1044]最长重复子串","frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"articleLive":2,"formTitle":"[1045]买下所有产品的客户","frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"articleLive":2,"formTitle":"[1046]最后一块石头的重量","frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"articleLive":2,"formTitle":"[1047]删除字符串中的所有相邻重复项","frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"articleLive":2,"formTitle":"[1048]最长字符串链","frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","title":"最长字符串链","titleSlug":"longest-string-chain"},{"articleLive":2,"formTitle":"[1049]最后一块石头的重量 II","frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"articleLive":2,"formTitle":"[1050]合作过至少三次的演员和导演","frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"articleLive":2,"formTitle":"[1051]高度检查器","frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","title":"高度检查器","titleSlug":"height-checker"},{"articleLive":2,"formTitle":"[1052]爱生气的书店老板","frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"articleLive":2,"formTitle":"[1053]交换一次的先前排列","frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"articleLive":2,"formTitle":"[1054]距离相等的条形码","frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"articleLive":2,"formTitle":"[1055]形成字符串的最短路径","frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"articleLive":2,"formTitle":"[1056]易混淆数","frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","title":"易混淆数","titleSlug":"confusing-number"},{"articleLive":2,"formTitle":"[1057]校园自行车分配","frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","title":"校园自行车分配","titleSlug":"campus-bikes"},{"articleLive":2,"formTitle":"[1058]最小化舍入误差以满足目标","frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"articleLive":2,"formTitle":"[1059]从始点到终点的所有路径","frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"articleLive":2,"formTitle":"[1060]有序数组中的缺失元素","frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"articleLive":2,"formTitle":"[1061]按字典序排列最小的等效字符串","frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"articleLive":2,"formTitle":"[1062]最长重复子串","frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"articleLive":2,"formTitle":"[1063]有效子数组的数目","frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"articleLive":2,"formTitle":"[1064]不动点","frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","title":"不动点","titleSlug":"fixed-point"},{"articleLive":2,"formTitle":"[1065]字符串的索引对","frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"articleLive":2,"formTitle":"[1066]校园自行车分配 II","frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"articleLive":2,"formTitle":"[1067]范围内的数字计数","frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"articleLive":2,"formTitle":"[1068]产品销售分析 I","frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"articleLive":2,"formTitle":"[1069]产品销售分析 II","frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"articleLive":2,"formTitle":"[1070]产品销售分析 III","frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"articleLive":2,"formTitle":"[1071]字符串的最大公因子","frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"articleLive":2,"formTitle":"[1072]按列翻转得到最大值等行数","frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"articleLive":2,"formTitle":"[1073]负二进制数相加","frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"articleLive":2,"formTitle":"[1074]元素和为目标值的子矩阵数量","frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"articleLive":2,"formTitle":"[1075]项目员工 I","frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","title":"项目员工 I","titleSlug":"project-employees-i"},{"articleLive":2,"formTitle":"[1076]项目员工II","frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","title":"项目员工II","titleSlug":"project-employees-ii"},{"articleLive":2,"formTitle":"[1077]项目员工 III","frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","title":"项目员工 III","titleSlug":"project-employees-iii"},{"articleLive":2,"formTitle":"[1078]Bigram 分词","frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"articleLive":2,"formTitle":"[1079]活字印刷","frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"articleLive":2,"formTitle":"[1080]根到叶路径上的不足节点","frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"articleLive":2,"formTitle":"[1081]不同字符的最小子序列","frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"articleLive":2,"formTitle":"[1082]销售分析 I ","frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"articleLive":2,"formTitle":"[1083]销售分析 II","frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"articleLive":2,"formTitle":"[1084]销售分析III","frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","title":"销售分析III","titleSlug":"sales-analysis-iii"},{"articleLive":2,"formTitle":"[1085]最小元素各数位之和","frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"articleLive":2,"formTitle":"[1086]前五科的均分","frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","title":"前五科的均分","titleSlug":"high-five"},{"articleLive":2,"formTitle":"[1087]花括号展开","frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","title":"花括号展开","titleSlug":"brace-expansion"},{"articleLive":2,"formTitle":"[1088]易混淆数 II","frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"articleLive":2,"formTitle":"[1089]复写零","frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","title":"复写零","titleSlug":"duplicate-zeros"},{"articleLive":2,"formTitle":"[1090]受标签影响的最大值","frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"articleLive":2,"formTitle":"[1091]二进制矩阵中的最短路径","frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"articleLive":2,"formTitle":"[1092]最短公共超序列","frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"articleLive":2,"formTitle":"[1093]大样本统计","frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"articleLive":2,"formTitle":"[1094]拼车","frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","title":"拼车","titleSlug":"car-pooling"},{"articleLive":2,"formTitle":"[1095]山脉数组中查找目标值","frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"articleLive":2,"formTitle":"[1096]花括号展开 II","frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"articleLive":2,"formTitle":"[1097]游戏玩法分析 V","frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"articleLive":2,"formTitle":"[1098]小众书籍","frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","title":"小众书籍","titleSlug":"unpopular-books"},{"articleLive":2,"formTitle":"[1099]小于 K 的两数之和","frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"articleLive":2,"formTitle":"[1100]长度为 K 的无重复字符子串","frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"articleLive":2,"formTitle":"[1101]彼此熟识的最早时间","frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"articleLive":2,"formTitle":"[1102]得分最高的路径","frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"articleLive":2,"formTitle":"[1103]分糖果 II","frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"articleLive":2,"formTitle":"[1104]二叉树寻路","frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"articleLive":2,"formTitle":"[1105]填充书架","frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"articleLive":2,"formTitle":"[1106]解析布尔表达式","frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"articleLive":2,"formTitle":"[1107]每日新用户统计","frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"articleLive":2,"formTitle":"[1108]IP 地址无效化","frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"articleLive":2,"formTitle":"[1109]航班预订统计","frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"articleLive":2,"formTitle":"[1110]删点成林","frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"articleLive":2,"formTitle":"[1111]有效括号的嵌套深度","frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"articleLive":2,"formTitle":"[1112]每位学生的最高成绩","frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"articleLive":2,"formTitle":"[1113]报告的记录","frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","title":"报告的记录","titleSlug":"reported-posts"},{"articleLive":2,"formTitle":"[1114]按序打印","frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","title":"按序打印","titleSlug":"print-in-order"},{"articleLive":2,"formTitle":"[1115]交替打印FooBar","frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"articleLive":2,"formTitle":"[1116]打印零与奇偶数","frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"articleLive":2,"formTitle":"[1117]H2O 生成","frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","title":"H2O 生成","titleSlug":"building-h2o"},{"articleLive":2,"formTitle":"[1118]一月有多少天","frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"articleLive":2,"formTitle":"[1119]删去字符串中的元音","frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"articleLive":2,"formTitle":"[1120]子树的最大平均值","frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"articleLive":2,"formTitle":"[1121]将数组分成几个递增序列","frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"articleLive":2,"formTitle":"[1122]数组的相对排序","frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","title":"数组的相对排序","titleSlug":"relative-sort-array"},{"articleLive":2,"formTitle":"[1123]最深叶节点的最近公共祖先","frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"articleLive":2,"formTitle":"[1124]表现良好的最长时间段","frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"articleLive":2,"formTitle":"[1125]最小的必要团队","frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"articleLive":2,"formTitle":"[1126]查询活跃业务","frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","title":"查询活跃业务","titleSlug":"active-businesses"},{"articleLive":2,"formTitle":"[1127]用户购买平台","frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","title":"用户购买平台","titleSlug":"user-purchase-platform"},{"articleLive":2,"formTitle":"[1128]等价多米诺骨牌对的数量","frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"articleLive":2,"formTitle":"[1129]颜色交替的最短路径","frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"articleLive":2,"formTitle":"[1130]叶值的最小代价生成树","frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"articleLive":2,"formTitle":"[1131]绝对值表达式的最大值","frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"articleLive":2,"formTitle":"[1132]报告的记录 II","frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"articleLive":2,"formTitle":"[1133]最大唯一数","frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","title":"最大唯一数","titleSlug":"largest-unique-number"},{"articleLive":2,"formTitle":"[1134]阿姆斯特朗数","frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"articleLive":2,"formTitle":"[1135]最低成本联通所有城市","frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"articleLive":2,"formTitle":"[1136]平行课程","frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","title":"平行课程","titleSlug":"parallel-courses"},{"articleLive":2,"formTitle":"[1137]第 N 个泰波那契数","frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"articleLive":2,"formTitle":"[1138]字母板上的路径","frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"articleLive":2,"formTitle":"[1139]最大的以 1 为边界的正方形","frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"articleLive":2,"formTitle":"[1140]石子游戏 II","frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","title":"石子游戏 II","titleSlug":"stone-game-ii"},{"articleLive":2,"formTitle":"[1141]查询近30天活跃用户数","frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"articleLive":2,"formTitle":"[1142]过去30天的用户活动 II","frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"articleLive":2,"formTitle":"[1143]最长公共子序列","frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"articleLive":2,"formTitle":"[1144]递减元素使数组呈锯齿状","frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"articleLive":2,"formTitle":"[1145]二叉树着色游戏","frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"articleLive":2,"formTitle":"[1146]快照数组","frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","title":"快照数组","titleSlug":"snapshot-array"},{"articleLive":2,"formTitle":"[1147]段式回文","frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"articleLive":2,"formTitle":"[1148]文章浏览 I","frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","title":"文章浏览 I","titleSlug":"article-views-i"},{"articleLive":2,"formTitle":"[1149]文章浏览 II","frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","title":"文章浏览 II","titleSlug":"article-views-ii"},{"articleLive":2,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"articleLive":2,"formTitle":"[1151]最少交换次数来组合所有的 1","frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"articleLive":2,"formTitle":"[1152]用户网站访问行为分析","frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"articleLive":2,"formTitle":"[1153]字符串转化","frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"articleLive":2,"formTitle":"[1154]一年中的第几天","frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","title":"一年中的第几天","titleSlug":"day-of-the-year"},{"articleLive":2,"formTitle":"[1155]掷骰子的N种方法","frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"articleLive":2,"formTitle":"[1156]单字符重复子串的最大长度","frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"articleLive":2,"formTitle":"[1157]子数组中占绝大多数的元素","frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"articleLive":2,"formTitle":"[1158]市场分析 I","frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","title":"市场分析 I","titleSlug":"market-analysis-i"},{"articleLive":2,"formTitle":"[1159]市场分析 II","frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","title":"市场分析 II","titleSlug":"market-analysis-ii"},{"articleLive":2,"formTitle":"[1160]拼写单词","frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"articleLive":2,"formTitle":"[1161]最大层内元素和","frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"articleLive":2,"formTitle":"[1162]地图分析","frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"articleLive":2,"formTitle":"[1163]按字典序排在最后的子串","frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"articleLive":2,"formTitle":"[1164]指定日期的产品价格","frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"articleLive":2,"formTitle":"[1165]单行键盘","frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","title":"单行键盘","titleSlug":"single-row-keyboard"},{"articleLive":2,"formTitle":"[1166]设计文件系统","frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","title":"设计文件系统","titleSlug":"design-file-system"},{"articleLive":2,"formTitle":"[1167]连接棒材的最低费用","frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"articleLive":2,"formTitle":"[1168]水资源分配优化","frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"articleLive":2,"formTitle":"[1169]查询无效交易","frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","title":"查询无效交易","titleSlug":"invalid-transactions"},{"articleLive":2,"formTitle":"[1170]比较字符串最小字母出现频次","frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"articleLive":2,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"articleLive":2,"formTitle":"[1172]餐盘栈","frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"articleLive":2,"formTitle":"[1173]即时食物配送 I","frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"articleLive":2,"formTitle":"[1174]即时食物配送 II","frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"articleLive":2,"formTitle":"[1175]质数排列","frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","title":"质数排列","titleSlug":"prime-arrangements"},{"articleLive":2,"formTitle":"[1176]健身计划评估","frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","title":"健身计划评估","titleSlug":"diet-plan-performance"},{"articleLive":2,"formTitle":"[1177]构建回文串检测","frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"articleLive":2,"formTitle":"[1178]猜字谜","frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"articleLive":2,"formTitle":"[1179]重新格式化部门表","frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"articleLive":2,"formTitle":"[1180]统计只含单一字母的子串","frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"articleLive":2,"formTitle":"[1181]前后拼接","frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"articleLive":2,"formTitle":"[1182]与目标颜色间的最短距离","frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"articleLive":2,"formTitle":"[1183]矩阵中 1 的最大数量","frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"articleLive":2,"formTitle":"[1184]公交站间的距离","frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"articleLive":2,"formTitle":"[1185]一周中的第几天","frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","title":"一周中的第几天","titleSlug":"day-of-the-week"},{"articleLive":2,"formTitle":"[1186]删除一次得到子数组最大和","frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"articleLive":2,"formTitle":"[1187]使数组严格递增","frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"articleLive":2,"formTitle":"[1188]设计有限阻塞队列","frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"articleLive":2,"formTitle":"[1189]“气球” 的最大数量","frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"articleLive":2,"formTitle":"[1190]反转每对括号间的子串","frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"articleLive":2,"formTitle":"[1191]K 次串联后最大子数组之和","frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"articleLive":2,"formTitle":"[1192]查找集群内的「关键连接」","frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"articleLive":2,"formTitle":"[1193]每月交易 I","frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"articleLive":2,"formTitle":"[1194]锦标赛优胜者","frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"articleLive":2,"formTitle":"[1195]交替打印字符串","frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"articleLive":2,"formTitle":"[1196]最多可以买到的苹果数量","frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"articleLive":2,"formTitle":"[1197]进击的骑士","frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"articleLive":2,"formTitle":"[1198]找出所有行中最小公共元素","frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"articleLive":2,"formTitle":"[1199]建造街区的最短时间","frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"articleLive":2,"formTitle":"[1200]最小绝对差","frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"articleLive":2,"formTitle":"[1201]丑数 III","frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","title":"丑数 III","titleSlug":"ugly-number-iii"},{"articleLive":2,"formTitle":"[1202]交换字符串中的元素","frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"articleLive":2,"formTitle":"[1203]项目管理","frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"articleLive":2,"formTitle":"[1204]最后一个能进入电梯的人","frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-elevator"},{"articleLive":2,"formTitle":"[1205]每月交易II","frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"articleLive":2,"formTitle":"[1206]设计跳表","frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","title":"设计跳表","titleSlug":"design-skiplist"},{"articleLive":2,"formTitle":"[1207]独一无二的出现次数","frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"articleLive":2,"formTitle":"[1208]尽可能使字符串相等","frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"articleLive":2,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"articleLive":2,"formTitle":"[1210]穿过迷宫的最少移动次数","frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"articleLive":2,"formTitle":"[1211]查询结果的质量和占比","frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"articleLive":2,"formTitle":"[1212]查询球队积分","frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"articleLive":2,"formTitle":"[1213]三个有序数组的交集","frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"articleLive":2,"formTitle":"[1214]查找两棵二叉搜索树之和","frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"articleLive":2,"formTitle":"[1215]步进数","frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","title":"步进数","titleSlug":"stepping-numbers"},{"articleLive":2,"formTitle":"[1216]验证回文字符串 III","frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"articleLive":2,"formTitle":"[1217]玩筹码","frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"articleLive":2,"formTitle":"[1218]最长定差子序列","frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"articleLive":2,"formTitle":"[1219]黄金矿工","frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"articleLive":2,"formTitle":"[1220]统计元音字母序列的数目","frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"articleLive":2,"formTitle":"[1221]分割平衡字符串","frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"articleLive":2,"formTitle":"[1222]可以攻击国王的皇后","frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"articleLive":2,"formTitle":"[1223]掷骰子模拟","frontendQuestionId":"1223","leaf":true,"level":2,"nodeType":"def","questionId":"1343","status":"","title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"articleLive":2,"formTitle":"[1224]最大相等频率","frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"articleLive":2,"formTitle":"[1225]报告系统状态的连续日期","frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"articleLive":2,"formTitle":"[1226]哲学家进餐","frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"articleLive":2,"formTitle":"[1227]飞机座位分配概率","frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"articleLive":2,"formTitle":"[1228]等差数列中缺失的数字","frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"articleLive":2,"formTitle":"[1229]安排会议日程","frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","title":"安排会议日程","titleSlug":"meeting-scheduler"},{"articleLive":2,"formTitle":"[1230]抛掷硬币","frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"articleLive":2,"formTitle":"[1231]分享巧克力","frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","title":"分享巧克力","titleSlug":"divide-chocolate"},{"articleLive":2,"formTitle":"[1232]缀点成线","frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"articleLive":2,"formTitle":"[1233]删除子文件夹","frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"articleLive":2,"formTitle":"[1234]替换子串得到平衡字符串","frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"articleLive":2,"formTitle":"[1235]规划兼职工作","frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"articleLive":2,"formTitle":"[1236]网络爬虫","frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","title":"网络爬虫","titleSlug":"web-crawler"},{"articleLive":2,"formTitle":"[1237]找出给定方程的正整数解","frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"articleLive":2,"formTitle":"[1238]循环码排列","frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"articleLive":2,"formTitle":"[1239]串联字符串的最大长度","frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"articleLive":2,"formTitle":"[1240]铺瓷砖","frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"articleLive":2,"formTitle":"[1241]每个帖子的评论数","frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"articleLive":2,"formTitle":"[1242]多线程网页爬虫","frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"articleLive":2,"formTitle":"[1243]数组变换","frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","title":"数组变换","titleSlug":"array-transformation"},{"articleLive":2,"formTitle":"[1244]力扣排行榜","frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"articleLive":2,"formTitle":"[1245]树的直径","frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","title":"树的直径","titleSlug":"tree-diameter"},{"articleLive":2,"formTitle":"[1246]删除回文子数组","frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","title":"删除回文子数组","titleSlug":"palindrome-removal"},{"articleLive":2,"formTitle":"[1247]交换字符使得字符串相同","frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"articleLive":2,"formTitle":"[1248]统计「优美子数组」","frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"articleLive":2,"formTitle":"[1249]移除无效的括号","frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"","title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"articleLive":2,"formTitle":"[1250]检查「好数组」","frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"articleLive":2,"formTitle":"[1251]平均售价","frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","title":"平均售价","titleSlug":"average-selling-price"},{"articleLive":2,"formTitle":"[1252]奇数值单元格的数目","frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"articleLive":2,"formTitle":"[1253]重构 2 行二进制矩阵","frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"articleLive":2,"formTitle":"[1254]统计封闭岛屿的数目","frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"","title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"articleLive":2,"formTitle":"[1255]得分最高的单词集合","frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"articleLive":2,"formTitle":"[1256]加密数字","frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","title":"加密数字","titleSlug":"encode-number"},{"articleLive":2,"formTitle":"[1257]最小公共区域","frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","title":"最小公共区域","titleSlug":"smallest-common-region"},{"articleLive":2,"formTitle":"[1258]近义词句子","frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","title":"近义词句子","titleSlug":"synonymous-sentences"},{"articleLive":2,"formTitle":"[1259]不相交的握手","frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"articleLive":2,"formTitle":"[1260]二维网格迁移","frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"articleLive":2,"formTitle":"[1261]在受污染的二叉树中查找元素","frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"articleLive":2,"formTitle":"[1262]可被三整除的最大和","frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"articleLive":2,"formTitle":"[1263]推箱子","frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"articleLive":2,"formTitle":"[1264]页面推荐","frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","title":"页面推荐","titleSlug":"page-recommendations"},{"articleLive":2,"formTitle":"[1265]逆序打印不可变链表","frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"articleLive":2,"formTitle":"[1266]访问所有点的最小时间","frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"articleLive":2,"formTitle":"[1267]统计参与通信的服务器","frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"articleLive":2,"formTitle":"[1268]搜索推荐系统","frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"articleLive":2,"formTitle":"[1269]停在原地的方案数","frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"","title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"articleLive":2,"formTitle":"[1270]向公司CEO汇报工作的所有人","frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"articleLive":2,"formTitle":"[1271]十六进制魔术数字","frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","title":"十六进制魔术数字","titleSlug":"hexspeak"},{"articleLive":2,"formTitle":"[1272]删除区间","frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","title":"删除区间","titleSlug":"remove-interval"},{"articleLive":2,"formTitle":"[1273]删除树节点","frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","title":"删除树节点","titleSlug":"delete-tree-nodes"},{"articleLive":2,"formTitle":"[1274]矩形内船只的数目","frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"articleLive":2,"formTitle":"[1275]找出井字棋的获胜者","frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"articleLive":2,"formTitle":"[1276]不浪费原料的汉堡制作方案","frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"articleLive":2,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"articleLive":2,"formTitle":"[1278]分割回文串 III","frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"articleLive":2,"formTitle":"[1279]红绿灯路口","frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"articleLive":2,"formTitle":"[1280]学生们参加各科测试的次数","frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"articleLive":2,"formTitle":"[1281]整数的各位积和之差","frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"articleLive":2,"formTitle":"[1282]用户分组","frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"articleLive":2,"formTitle":"[1283]使结果不超过阈值的最小除数","frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"articleLive":2,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"articleLive":2,"formTitle":"[1285]找到连续区间的开始和结束数字","frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"articleLive":2,"formTitle":"[1286]字母组合迭代器","frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"articleLive":2,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"articleLive":2,"formTitle":"[1288]删除被覆盖区间","frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"articleLive":2,"formTitle":"[1289]下降路径最小和  II","frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"articleLive":2,"formTitle":"[1290]二进制链表转整数","frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"articleLive":2,"formTitle":"[1291]顺次数","frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","title":"顺次数","titleSlug":"sequential-digits"},{"articleLive":2,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"articleLive":2,"formTitle":"[1293]网格中的最短路径","frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"articleLive":2,"formTitle":"[1294]不同国家的天气类型","frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"articleLive":2,"formTitle":"[1295]统计位数为偶数的数字","frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"articleLive":2,"formTitle":"[1296]划分数组为连续数字的集合","frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"articleLive":2,"formTitle":"[1297]子串的最大出现次数","frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"articleLive":2,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"articleLive":2,"formTitle":"[1299]将每个元素替换为右侧最大元素","frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"articleLive":2,"formTitle":"[1300]转变数组后最接近目标值的数组和","frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"articleLive":2,"formTitle":"[1301]最大得分的路径数目","frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"articleLive":2,"formTitle":"[1302]层数最深叶子节点的和","frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"articleLive":2,"formTitle":"[1303]求团队人数","frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","title":"求团队人数","titleSlug":"find-the-team-size"},{"articleLive":2,"formTitle":"[1304]和为零的N个唯一整数","frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"articleLive":2,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"articleLive":2,"formTitle":"[1306]跳跃游戏 III","frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"articleLive":2,"formTitle":"[1307]口算难题","frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"articleLive":2,"formTitle":"[1308]不同性别每日分数总计","frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"articleLive":2,"formTitle":"[1309]解码字母到整数映射","frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"articleLive":2,"formTitle":"[1310]子数组异或查询","frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"","title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"articleLive":2,"formTitle":"[1311]获取你好友已观看的视频","frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"articleLive":2,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"articleLive":2,"formTitle":"[1313]解压缩编码列表","frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"articleLive":2,"formTitle":"[1314]矩阵区域和","frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"articleLive":2,"formTitle":"[1315]祖父节点值为偶数的节点和","frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"articleLive":2,"formTitle":"[1316]不同的循环子字符串","frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"articleLive":2,"formTitle":"[1317]将整数转换为两个无零整数的和","frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"articleLive":2,"formTitle":"[1318]或运算的最小翻转次数","frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"articleLive":2,"formTitle":"[1319]连通网络的操作次数","frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"articleLive":2,"formTitle":"[1320]二指输入的的最小距离","frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"articleLive":2,"formTitle":"[1321]餐馆营业额变化增长","frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"articleLive":2,"formTitle":"[1322]广告效果","frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","title":"广告效果","titleSlug":"ads-performance"},{"articleLive":2,"formTitle":"[1323]6 和 9 组成的最大数字","frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"articleLive":2,"formTitle":"[1324]竖直打印单词","frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","title":"竖直打印单词","titleSlug":"print-words-vertically"},{"articleLive":2,"formTitle":"[1325]删除给定值的叶子节点","frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"articleLive":2,"formTitle":"[1326]灌溉花园的最少水龙头数目","frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"articleLive":2,"formTitle":"[1327]列出指定时间段内所有的下单产品","frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"articleLive":2,"formTitle":"[1328]破坏回文串","frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","title":"破坏回文串","titleSlug":"break-a-palindrome"},{"articleLive":2,"formTitle":"[1329]将矩阵按对角线排序","frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"articleLive":2,"formTitle":"[1330]翻转子数组得到最大的数组值","frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"articleLive":2,"formTitle":"[1331]数组序号转换","frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"articleLive":2,"formTitle":"[1332]删除回文子序列","frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"articleLive":2,"formTitle":"[1333]餐厅过滤器","frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"articleLive":2,"formTitle":"[1334]阈值距离内邻居最少的城市","frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"articleLive":2,"formTitle":"[1335]工作计划的最低难度","frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"articleLive":2,"formTitle":"[1336]每次访问的交易次数","frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"articleLive":2,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"","title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"articleLive":2,"formTitle":"[1338]数组大小减半","frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"","title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"articleLive":2,"formTitle":"[1339]分裂二叉树的最大乘积","frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"articleLive":2,"formTitle":"[1340]跳跃游戏 V","frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"articleLive":2,"formTitle":"[1341]电影评分","frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","title":"电影评分","titleSlug":"movie-rating"},{"articleLive":2,"formTitle":"[1342]将数字变成 0 的操作次数","frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"articleLive":2,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"articleLive":2,"formTitle":"[1344]时钟指针的夹角","frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"articleLive":2,"formTitle":"[1345]跳跃游戏 IV","frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"articleLive":2,"formTitle":"[1346]检查整数及其两倍数是否存在","frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"articleLive":2,"formTitle":"[1347]制造字母异位词的最小步骤数","frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"articleLive":2,"formTitle":"[1348]推文计数","frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"articleLive":2,"formTitle":"[1349]参加考试的最大学生数","frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"articleLive":2,"formTitle":"[1350]院系无效的学生","frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"articleLive":2,"formTitle":"[1351]统计有序矩阵中的负数","frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"articleLive":2,"formTitle":"[1352]最后 K 个数的乘积","frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"articleLive":2,"formTitle":"[1353]最多可以参加的会议数目","frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"articleLive":2,"formTitle":"[1354]多次求和构造目标数组","frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"articleLive":2,"formTitle":"[1355]活动参与者","frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","title":"活动参与者","titleSlug":"activity-participants"},{"articleLive":2,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"articleLive":2,"formTitle":"[1357]每隔 n 个顾客打折","frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"articleLive":2,"formTitle":"[1358]包含所有三种字符的子字符串数目","frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"articleLive":2,"formTitle":"[1359]有效的快递序列数目","frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"articleLive":2,"formTitle":"[1360]日期之间隔几天","frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"articleLive":2,"formTitle":"[1361]验证二叉树","frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"articleLive":2,"formTitle":"[1362]最接近的因数","frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","title":"最接近的因数","titleSlug":"closest-divisors"},{"articleLive":2,"formTitle":"[1363]形成三的最大倍数","frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"articleLive":2,"formTitle":"[1364]顾客的可信联系人数量","frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"articleLive":2,"formTitle":"[1365]有多少小于当前数字的数字","frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"articleLive":2,"formTitle":"[1366]通过投票对团队排名","frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"articleLive":2,"formTitle":"[1367]二叉树中的列表","frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"articleLive":2,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"articleLive":2,"formTitle":"[1369]获取最近第二次的活动","frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"articleLive":2,"formTitle":"[1370]上升下降字符串","frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"articleLive":2,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"articleLive":2,"formTitle":"[1372]二叉树中的最长交错路径","frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1373]二叉搜索子树的最大键值和","frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"articleLive":2,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"articleLive":2,"formTitle":"[1375]灯泡开关 III","frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"articleLive":2,"formTitle":"[1376]通知所有员工所需的时间","frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"articleLive":2,"formTitle":"[1377]T 秒后青蛙的位置","frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"articleLive":2,"formTitle":"[1378]使用唯一标识码替换员工ID","frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"articleLive":2,"formTitle":"[1379]找出克隆二叉树中的相同节点","frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"articleLive":2,"formTitle":"[1380]矩阵中的幸运数","frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"articleLive":2,"formTitle":"[1381]设计一个支持增量操作的栈","frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"","title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"articleLive":2,"formTitle":"[1382]将二叉搜索树变平衡","frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"articleLive":2,"formTitle":"[1383]最大的团队表现值","frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"articleLive":2,"formTitle":"[1384]按年度列出销售总额","frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"articleLive":2,"formTitle":"[1385]两个数组间的距离值","frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"articleLive":2,"formTitle":"[1386]安排电影院座位","frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"articleLive":2,"formTitle":"[1387]将整数按权重排序","frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"articleLive":2,"formTitle":"[1388]3n 块披萨","frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"articleLive":2,"formTitle":"[1389]按既定顺序创建目标数组","frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"articleLive":2,"formTitle":"[1390]四因数","frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","title":"四因数","titleSlug":"four-divisors"},{"articleLive":2,"formTitle":"[1391]检查网格中是否存在有效路径","frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"articleLive":2,"formTitle":"[1392]最长快乐前缀","frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"articleLive":2,"formTitle":"[1393]股票的资本损益","frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","title":"股票的资本损益","titleSlug":"capital-gainloss"},{"articleLive":2,"formTitle":"[1394]找出数组中的幸运数","frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"articleLive":2,"formTitle":"[1395]统计作战单位数","frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"articleLive":2,"formTitle":"[1396]设计地铁系统","frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","title":"设计地铁系统","titleSlug":"design-underground-system"},{"articleLive":2,"formTitle":"[1397]找到所有好字符串","frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"articleLive":2,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"articleLive":2,"formTitle":"[1399]统计最大组的数目","frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","title":"统计最大组的数目","titleSlug":"count-largest-group"},{"articleLive":2,"formTitle":"[1400]构造 K 个回文字符串","frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"articleLive":2,"formTitle":"[1401]圆和矩形是否有重叠","frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"articleLive":2,"formTitle":"[1402]做菜顺序","frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","title":"做菜顺序","titleSlug":"reducing-dishes"},{"articleLive":2,"formTitle":"[1403]非递增顺序的最小子序列","frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"articleLive":2,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"articleLive":2,"formTitle":"[1405]最长快乐字符串","frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"articleLive":2,"formTitle":"[1406]石子游戏 III","frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","title":"石子游戏 III","titleSlug":"stone-game-iii"},{"articleLive":2,"formTitle":"[1407]排名靠前的旅行者","frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"articleLive":2,"formTitle":"[1408]数组中的字符串匹配","frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"articleLive":2,"formTitle":"[1409]查询带键的排列","frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"articleLive":2,"formTitle":"[1410]HTML 实体解析器","frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"","title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"articleLive":2,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"articleLive":2,"formTitle":"[1412]查找成绩处于中游的学生","frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"articleLive":2,"formTitle":"[1413]逐步求和得到正数的最小值","frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"articleLive":2,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"articleLive":2,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"articleLive":2,"formTitle":"[1416]恢复数组","frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","title":"恢复数组","titleSlug":"restore-the-array"},{"articleLive":2,"formTitle":"[1417]重新格式化字符串","frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"articleLive":2,"formTitle":"[1418]点菜展示表","frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"","title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"articleLive":2,"formTitle":"[1419]数青蛙","frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"articleLive":2,"formTitle":"[1420]生成数组","frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"articleLive":2,"formTitle":"[1421]净现值查询","frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","title":"净现值查询","titleSlug":"npv-queries"},{"articleLive":2,"formTitle":"[1422]分割字符串的最大得分","frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"articleLive":2,"formTitle":"[1423]可获得的最大点数","frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"","title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"articleLive":2,"formTitle":"[1424]对角线遍历 II","frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"articleLive":2,"formTitle":"[1425]带限制的子序列和","frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"articleLive":2,"formTitle":"[1426]数元素","frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","title":"数元素","titleSlug":"counting-elements"},{"articleLive":2,"formTitle":"[1427]字符串的左右移","frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"articleLive":2,"formTitle":"[1428]至少有一个 1 的最左端列","frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"articleLive":2,"formTitle":"[1429]第一个唯一数字","frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","title":"第一个唯一数字","titleSlug":"first-unique-number"},{"articleLive":2,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1431]拥有最多糖果的孩子","frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"articleLive":2,"formTitle":"[1432]改变一个整数能得到的最大差值","frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"articleLive":2,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"articleLive":2,"formTitle":"[1434]每个人戴不同帽子的方案数","frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"articleLive":2,"formTitle":"[1435]制作会话柱状图","frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"articleLive":2,"formTitle":"[1436]旅行终点站","frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","title":"旅行终点站","titleSlug":"destination-city"},{"articleLive":2,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"articleLive":2,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"articleLive":2,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"articleLive":2,"formTitle":"[1440]计算布尔表达式的值","frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"articleLive":2,"formTitle":"[1441]用栈操作构建数组","frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"articleLive":2,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"","title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"articleLive":2,"formTitle":"[1443]收集树上所有苹果的最少时间","frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"articleLive":2,"formTitle":"[1444]切披萨的方案数","frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"articleLive":2,"formTitle":"[1445]苹果和桔子","frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","title":"苹果和桔子","titleSlug":"apples-oranges"},{"articleLive":2,"formTitle":"[1446]连续字符","frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","title":"连续字符","titleSlug":"consecutive-characters"},{"articleLive":2,"formTitle":"[1447]最简分数","frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","title":"最简分数","titleSlug":"simplified-fractions"},{"articleLive":2,"formTitle":"[1448]统计二叉树中好节点的数目","frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"articleLive":2,"formTitle":"[1449]数位成本和为目标值的最大数字","frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"","title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"articleLive":2,"formTitle":"[1450]在既定时间做作业的学生人数","frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"articleLive":2,"formTitle":"[1451]重新排列句子中的单词","frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"articleLive":2,"formTitle":"[1452]收藏清单","frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"articleLive":2,"formTitle":"[1453]圆形靶内的最大飞镖数量","frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"articleLive":2,"formTitle":"[1454]活跃用户","frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","title":"活跃用户","titleSlug":"active-users"},{"articleLive":2,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"articleLive":2,"formTitle":"[1456]定长子串中元音的最大数目","frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"articleLive":2,"formTitle":"[1457]二叉树中的伪回文路径","frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1458]两个子序列的最大点积","frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"articleLive":2,"formTitle":"[1459]矩形面积","frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","title":"矩形面积","titleSlug":"rectangles-area"},{"articleLive":2,"formTitle":"[1460]通过翻转子数组使两个数组相等","frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"","title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"articleLive":2,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"articleLive":2,"formTitle":"[1462]课程表 IV","frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","title":"课程表 IV","titleSlug":"course-schedule-iv"},{"articleLive":2,"formTitle":"[1463]摘樱桃 II","frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"articleLive":2,"formTitle":"[1464]数组中两元素的最大乘积","frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"articleLive":2,"formTitle":"[1465]切割后面积最大的蛋糕","frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"articleLive":2,"formTitle":"[1466]重新规划路线","frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"articleLive":2,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"articleLive":2,"formTitle":"[1468]计算税后工资","frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","title":"计算税后工资","titleSlug":"calculate-salaries"},{"articleLive":2,"formTitle":"[1469]寻找所有的独生节点","frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"articleLive":2,"formTitle":"[1470]重新排列数组","frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","title":"重新排列数组","titleSlug":"shuffle-the-array"},{"articleLive":2,"formTitle":"[1471]数组中的 k 个最强值","frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"articleLive":2,"formTitle":"[1472]设计浏览器历史记录","frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"articleLive":2,"formTitle":"[1473]粉刷房子 III","frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"articleLive":2,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"articleLive":2,"formTitle":"[1475]商品折扣后的最终价格","frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"articleLive":2,"formTitle":"[1476]子矩形查询","frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","title":"子矩形查询","titleSlug":"subrectangle-queries"},{"articleLive":2,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"articleLive":2,"formTitle":"[1478]安排邮筒","frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"articleLive":2,"formTitle":"[1479]周内每天的销售情况","frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"articleLive":2,"formTitle":"[1480]一维数组的动态和","frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"articleLive":2,"formTitle":"[1481]不同整数的最少数目","frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"articleLive":2,"formTitle":"[1482]制作 m 束花所需的最少天数","frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"","title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"articleLive":2,"formTitle":"[1483]树节点的第 K 个祖先","frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"articleLive":2,"formTitle":"[1484]克隆含随机指针的二叉树","frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"articleLive":2,"formTitle":"[1485]按日期分组销售产品","frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"articleLive":2,"formTitle":"[1486]数组异或操作","frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"","title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"articleLive":2,"formTitle":"[1487]保证文件名唯一","frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"articleLive":2,"formTitle":"[1488]避免洪水泛滥","frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"articleLive":2,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"articleLive":2,"formTitle":"[1490]克隆 N 叉树","frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"articleLive":2,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"articleLive":2,"formTitle":"[1492]n 的第 k 个因子","frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"articleLive":2,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"articleLive":2,"formTitle":"[1494]并行课程 II","frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"articleLive":2,"formTitle":"[1495]上月播放的儿童适宜电影","frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"articleLive":2,"formTitle":"[1496]判断路径是否相交","frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","title":"判断路径是否相交","titleSlug":"path-crossing"},{"articleLive":2,"formTitle":"[1497]检查数组对是否可以被 k 整除","frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"articleLive":2,"formTitle":"[1498]满足条件的子序列数目","frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"articleLive":2,"formTitle":"[1499]满足不等式的最大值","frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"articleLive":2,"formTitle":"[1500]设计文件分享系统","frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"articleLive":2,"formTitle":"[1501]可以放心投资的国家","frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"articleLive":2,"formTitle":"[1502]判断能否形成等差数列","frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"articleLive":2,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"articleLive":2,"formTitle":"[1504]统计全 1 子矩形","frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"articleLive":2,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"articleLive":2,"formTitle":"[1506]找到 N 叉树的根节点","frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1507]转变日期格式","frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","title":"转变日期格式","titleSlug":"reformat-date"},{"articleLive":2,"formTitle":"[1508]子数组和排序后的区间和","frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"articleLive":2,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"articleLive":2,"formTitle":"[1510]石子游戏 IV","frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"articleLive":2,"formTitle":"[1511]消费者下单频率","frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"articleLive":2,"formTitle":"[1512]好数对的数目","frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"articleLive":2,"formTitle":"[1513]仅含 1 的子串数","frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"articleLive":2,"formTitle":"[1514]概率最大的路径","frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"articleLive":2,"formTitle":"[1515]服务中心的最佳位置","frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"articleLive":2,"formTitle":"[1516]移动 N 叉树的子树","frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1517]查找拥有有效邮箱的用户","frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"articleLive":2,"formTitle":"[1518]换酒问题","frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","title":"换酒问题","titleSlug":"water-bottles"},{"articleLive":2,"formTitle":"[1519]子树中标签相同的节点数","frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"articleLive":2,"formTitle":"[1520]最多的不重叠子字符串","frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"articleLive":2,"formTitle":"[1521]找到最接近目标值的函数值","frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"articleLive":2,"formTitle":"[1522]N 叉树的直径","frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1523]在区间范围内统计奇数数目","frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"articleLive":2,"formTitle":"[1524]和为奇数的子数组数目","frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"articleLive":2,"formTitle":"[1525]字符串的好分割数目","frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"articleLive":2,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"articleLive":2,"formTitle":"[1527]患某种疾病的患者","frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"articleLive":2,"formTitle":"[1528]重新排列字符串","frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","title":"重新排列字符串","titleSlug":"shuffle-string"},{"articleLive":2,"formTitle":"[1529]灯泡开关 IV","frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"articleLive":2,"formTitle":"[1530]好叶子节点对的数量","frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"articleLive":2,"formTitle":"[1531]压缩字符串 II","frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"articleLive":2,"formTitle":"[1532]最近的三笔订单","frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"articleLive":2,"formTitle":"[1533]找到最大整数的索引","frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"articleLive":2,"formTitle":"[1534]统计好三元组","frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","title":"统计好三元组","titleSlug":"count-good-triplets"},{"articleLive":2,"formTitle":"[1535]找出数组游戏的赢家","frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"articleLive":2,"formTitle":"[1536]排布二进制网格的最少交换次数","frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"articleLive":2,"formTitle":"[1537]最大得分","frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","title":"最大得分","titleSlug":"get-the-maximum-score"},{"articleLive":2,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"articleLive":2,"formTitle":"[1539]第 k 个缺失的正整数","frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"articleLive":2,"formTitle":"[1540]K 次操作转变字符串","frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"articleLive":2,"formTitle":"[1541]平衡括号字符串的最少插入次数","frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"","title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"articleLive":2,"formTitle":"[1542]找出最长的超赞子字符串","frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"articleLive":2,"formTitle":"[1543]产品名称格式修复","frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"articleLive":2,"formTitle":"[1544]整理字符串","frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","title":"整理字符串","titleSlug":"make-the-string-great"},{"articleLive":2,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"articleLive":2,"formTitle":"[1546]和为目标值的最大数目不重叠非空子数组数目","frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","title":"和为目标值的最大数目不重叠非空子数组数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"articleLive":2,"formTitle":"[1547]切棍子的最小成本","frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"articleLive":2,"formTitle":"[1548]图中最相似的路径","frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"articleLive":2,"formTitle":"[1549]每件商品的最新订单","frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"articleLive":2,"formTitle":"[1550]存在连续三个奇数的数组","frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"articleLive":2,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"articleLive":2,"formTitle":"[1552]两球之间的磁力","frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"articleLive":2,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"articleLive":2,"formTitle":"[1554]只有一个不同字符的字符串","frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"articleLive":2,"formTitle":"[1555]银行账户概要","frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","title":"银行账户概要","titleSlug":"bank-account-summary"},{"articleLive":2,"formTitle":"[1556]千位分隔数","frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","title":"千位分隔数","titleSlug":"thousand-separator"},{"articleLive":2,"formTitle":"[1557]可以到达所有点的最少点数目","frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"articleLive":2,"formTitle":"[1558]得到目标数组的最少函数调用次数","frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"articleLive":2,"formTitle":"[1559]二维网格图中探测环","frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"articleLive":2,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"articleLive":2,"formTitle":"[1561]你可以获得的最大硬币数目","frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"articleLive":2,"formTitle":"[1562]查找大小为 M 的最新分组","frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"articleLive":2,"formTitle":"[1563]石子游戏 V","frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","title":"石子游戏 V","titleSlug":"stone-game-v"},{"articleLive":2,"formTitle":"[1564]把箱子放进仓库里 I","frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"articleLive":2,"formTitle":"[1565]按月统计订单数与顾客数","frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"articleLive":2,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"articleLive":2,"formTitle":"[1567]乘积为正数的最长子数组长度","frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"articleLive":2,"formTitle":"[1568]使陆地分离的最少天数","frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"articleLive":2,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"articleLive":2,"formTitle":"[1570]两个稀疏向量的点积","frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"articleLive":2,"formTitle":"[1571]仓库经理","frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","title":"仓库经理","titleSlug":"warehouse-manager"},{"articleLive":2,"formTitle":"[1572]矩阵对角线元素的和","frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"articleLive":2,"formTitle":"[1573]分割字符串的方案数","frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"articleLive":2,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"articleLive":2,"formTitle":"[1575]统计所有可行路径","frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"articleLive":2,"formTitle":"[1576]替换所有的问号","frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"articleLive":2,"formTitle":"[1577]数的平方等于两数乘积的方法数","frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"articleLive":2,"formTitle":"[1578]避免重复字母的最小删除成本","frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"articleLive":2,"formTitle":"[1579]保证图可完全遍历","frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"articleLive":2,"formTitle":"[1580]把箱子放进仓库里 II","frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"articleLive":2,"formTitle":"[1581]进店却未进行过交易的顾客","frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"articleLive":2,"formTitle":"[1582]二进制矩阵中的特殊位置","frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"articleLive":2,"formTitle":"[1583]统计不开心的朋友","frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"articleLive":2,"formTitle":"[1584]连接所有点的最小费用","frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"articleLive":2,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"articleLive":2,"formTitle":"[1586]二叉搜索树迭代器 II","frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"articleLive":2,"formTitle":"[1587]银行账户概要 II","frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"articleLive":2,"formTitle":"[1588]所有奇数长度子数组的和","frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"articleLive":2,"formTitle":"[1589]所有排列中的最大和","frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"articleLive":2,"formTitle":"[1590]使数组和能被 P 整除","frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"articleLive":2,"formTitle":"[1591]奇怪的打印机 II","frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"articleLive":2,"formTitle":"[1592]重新排列单词间的空格","frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"articleLive":2,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"articleLive":2,"formTitle":"[1594]矩阵的最大非负积","frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"articleLive":2,"formTitle":"[1595]连通两组点的最小成本","frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"articleLive":2,"formTitle":"[1596]每位顾客最经常订购的商品","frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"articleLive":2,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"articleLive":2,"formTitle":"[1598]文件夹操作日志搜集器","frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"articleLive":2,"formTitle":"[1599]经营摩天轮的最大利润","frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"articleLive":2,"formTitle":"[1600]皇位继承顺序","frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"articleLive":2,"formTitle":"[1601]最多可达成的换楼请求数目","frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"articleLive":2,"formTitle":"[1602]找到二叉树中最近的右侧节点","frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"articleLive":2,"formTitle":"[1603]设计停车系统","frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","title":"设计停车系统","titleSlug":"design-parking-system"},{"articleLive":2,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"articleLive":2,"formTitle":"[1605]给定行和列的和求可行矩阵","frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"articleLive":2,"formTitle":"[1606]找到处理最多请求的服务器","frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"articleLive":2,"formTitle":"[1607]没有卖出的卖家","frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"articleLive":2,"formTitle":"[1608]特殊数组的特征值","frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"articleLive":2,"formTitle":"[1609]奇偶树","frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","title":"奇偶树","titleSlug":"even-odd-tree"},{"articleLive":2,"formTitle":"[1610]可见点的最大数目","frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"articleLive":2,"formTitle":"[1611]使整数变为 0 的最少操作次数","frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"articleLive":2,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"articleLive":2,"formTitle":"[1613]找到遗失的ID","frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"articleLive":2,"formTitle":"[1614]括号的最大嵌套深度","frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"articleLive":2,"formTitle":"[1615]最大网络秩","frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","title":"最大网络秩","titleSlug":"maximal-network-rank"},{"articleLive":2,"formTitle":"[1616]分割两个字符串得到回文串","frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"articleLive":2,"formTitle":"[1617]统计子树中城市之间最大距离","frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"articleLive":2,"formTitle":"[1618]找出适应屏幕的最大字号","frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"articleLive":2,"formTitle":"[1619]删除某些元素后的数组均值","frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"articleLive":2,"formTitle":"[1620]网络信号最好的坐标","frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"articleLive":2,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"articleLive":2,"formTitle":"[1622]奇妙序列","frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","title":"奇妙序列","titleSlug":"fancy-sequence"},{"articleLive":2,"formTitle":"[1623]三人国家代表队","frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"articleLive":2,"formTitle":"[1624]两个相同字符之间的最长子字符串","frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"articleLive":2,"formTitle":"[1625]执行操作后字典序最小的字符串","frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"articleLive":2,"formTitle":"[1626]无矛盾的最佳球队","frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"articleLive":2,"formTitle":"[1627]带阈值的图连通性","frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"articleLive":2,"formTitle":"[1628]设计带解析函数的表达式树","frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"articleLive":2,"formTitle":"[1629]按键持续时间最长的键","frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"articleLive":2,"formTitle":"[1630]等差子数组","frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"articleLive":2,"formTitle":"[1631]最小体力消耗路径","frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"articleLive":2,"formTitle":"[1632]矩阵转换后的秩","frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"articleLive":2,"formTitle":"[1633]各赛事的用户注册率","frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"articleLive":2,"formTitle":"[1634]求两个多项式链表的和","frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"articleLive":2,"formTitle":"[1635]Hopper 公司查询 I","frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"articleLive":2,"formTitle":"[1636]按照频率将数组升序排序","frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"articleLive":2,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"articleLive":2,"formTitle":"[1638]统计只差一个字符的子串数目","frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"articleLive":2,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"articleLive":2,"formTitle":"[1640]能否连接形成数组","frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"articleLive":2,"formTitle":"[1641]统计字典序元音字符串的数目","frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"articleLive":2,"formTitle":"[1642]可以到达的最远建筑","frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"articleLive":2,"formTitle":"[1643]第 K 条最小指令","frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"articleLive":2,"formTitle":"[1644]二叉树的最近公共祖先 II","frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"articleLive":2,"formTitle":"[1645]Hopper Company Queries II","frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"articleLive":2,"formTitle":"[1646]获取生成数组中的最大值","frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"articleLive":2,"formTitle":"[1647]字符频次唯一的最小删除次数","frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"articleLive":2,"formTitle":"[1648]销售价值减少的颜色球","frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"articleLive":2,"formTitle":"[1649]通过指令创建有序数组","frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"articleLive":2,"formTitle":"[1650]二叉树的最近公共祖先 III","frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"articleLive":2,"formTitle":"[1651]Hopper Company Queries III","frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"articleLive":2,"formTitle":"[1652]拆炸弹","frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"articleLive":2,"formTitle":"[1653]使字符串平衡的最少删除次数","frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"articleLive":2,"formTitle":"[1654]到家的最少跳跃次数","frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"articleLive":2,"formTitle":"[1655]分配重复整数","frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"articleLive":2,"formTitle":"[1656]设计有序流","frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"articleLive":2,"formTitle":"[1657]确定两个字符串是否接近","frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"articleLive":2,"formTitle":"[1658]将 x 减到 0 的最小操作数","frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"articleLive":2,"formTitle":"[1659]最大化网格幸福感","frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"articleLive":2,"formTitle":"[1660]纠正二叉树","frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"articleLive":2,"formTitle":"[1661]每台机器的进程平均运行时间","frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"articleLive":2,"formTitle":"[1662]检查两个字符串数组是否相等","frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"articleLive":2,"formTitle":"[1663]具有给定数值的最小字符串","frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"articleLive":2,"formTitle":"[1664]生成平衡数组的方案数","frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"articleLive":2,"formTitle":"[1665]完成所有任务的最少初始能量","frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"articleLive":2,"formTitle":"[1666]改变二叉树的根节点","frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"articleLive":2,"formTitle":"[1667]修复表中的名字","frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"articleLive":2,"formTitle":"[1668]最大重复子字符串","frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"articleLive":2,"formTitle":"[1669]合并两个链表","frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"articleLive":2,"formTitle":"[1670]设计前中后队列","frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"articleLive":2,"formTitle":"[1671]得到山形数组的最少删除次数","frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"articleLive":2,"formTitle":"[1672]最富有客户的资产总量","frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"articleLive":2,"formTitle":"[1673]找出最具竞争力的子序列","frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"","title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"articleLive":2,"formTitle":"[1674]使数组互补的最少操作次数","frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"articleLive":2,"formTitle":"[1675]数组的最小偏移量","frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"articleLive":2,"formTitle":"[1676]二叉树的最近公共祖先 IV","frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"articleLive":2,"formTitle":"[1677]发票中的产品金额","frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"articleLive":2,"formTitle":"[1678]设计 Goal 解析器","frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"articleLive":2,"formTitle":"[1679]K 和数对的最大数目","frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"articleLive":2,"formTitle":"[1680]连接连续二进制数字","frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"articleLive":2,"formTitle":"[1681]最小不兼容性","frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"articleLive":2,"formTitle":"[1682]最长回文子序列 II","frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"articleLive":2,"formTitle":"[1683]无效的推文","frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","title":"无效的推文","titleSlug":"invalid-tweets"},{"articleLive":2,"formTitle":"[1684]统计一致字符串的数目","frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"articleLive":2,"formTitle":"[1685]有序数组中差绝对值之和","frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"articleLive":2,"formTitle":"[1686]石子游戏 VI","frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"articleLive":2,"formTitle":"[1687]从仓库到码头运输箱子","frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"articleLive":2,"formTitle":"[1688]比赛中的配对次数","frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"articleLive":2,"formTitle":"[1689]十-二进制数的最少数目","frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"articleLive":2,"formTitle":"[1690]石子游戏 VII","frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"articleLive":2,"formTitle":"[1691]堆叠长方体的最大高度","frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"articleLive":2,"formTitle":"[1692]计算分配糖果的不同方式","frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"articleLive":2,"formTitle":"[1693]每天的领导和合伙人","frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"articleLive":2,"formTitle":"[1694]重新格式化电话号码","frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"articleLive":2,"formTitle":"[1695]删除子数组的最大得分","frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"articleLive":2,"formTitle":"[1696]跳跃游戏 VI","frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"articleLive":2,"formTitle":"[1697]检查边长度限制的路径是否存在","frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"articleLive":2,"formTitle":"[1698]字符串的不同子字符串个数","frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"articleLive":2,"formTitle":"[1699]两人之间的通话次数","frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"articleLive":2,"formTitle":"[1700]无法吃午餐的学生数量","frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"articleLive":2,"formTitle":"[1701]平均等待时间","frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","title":"平均等待时间","titleSlug":"average-waiting-time"},{"articleLive":2,"formTitle":"[1702]修改后的最大二进制字符串","frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"articleLive":2,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"articleLive":2,"formTitle":"[1704]判断字符串的两半是否相似","frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"articleLive":2,"formTitle":"[1705]吃苹果的最大数目","frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"articleLive":2,"formTitle":"[1706]球会落何处","frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"articleLive":2,"formTitle":"[1707]与数组中元素的最大异或值","frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"articleLive":2,"formTitle":"[1708]长度为 K 的最大子数组","frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"articleLive":2,"formTitle":"[1709]访问日期之间最大的空档期","frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"articleLive":2,"formTitle":"[1710]卡车上的最大单元数","frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"articleLive":2,"formTitle":"[1711]大餐计数","frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"","title":"大餐计数","titleSlug":"count-good-meals"},{"articleLive":2,"formTitle":"[1712]将数组分成三个子数组的方案数","frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"articleLive":2,"formTitle":"[1713]得到子序列的最少操作次数","frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"","title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"articleLive":2,"formTitle":"[1714]数组中特殊等间距元素的和","frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"articleLive":2,"formTitle":"[1715]苹果和橘子的个数","frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"articleLive":2,"formTitle":"[1716]计算力扣银行的钱","frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"articleLive":2,"formTitle":"[1717]删除子字符串的最大得分","frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"articleLive":2,"formTitle":"[1718]构建字典序最大的可行序列","frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"articleLive":2,"formTitle":"[1719]重构一棵树的方案数","frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"articleLive":2,"formTitle":"[1720]解码异或后的数组","frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"","title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"articleLive":2,"formTitle":"[1721]交换链表中的节点","frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"articleLive":2,"formTitle":"[1722]执行交换操作后的最小汉明距离","frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"articleLive":2,"formTitle":"[1723]完成所有工作的最短时间","frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"","title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"articleLive":2,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"articleLive":2,"formTitle":"[1725]可以形成最大正方形的矩形数目","frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"articleLive":2,"formTitle":"[1726]同积元组","frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","title":"同积元组","titleSlug":"tuple-with-same-product"},{"articleLive":2,"formTitle":"[1727]重新排列后的最大子矩阵","frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"articleLive":2,"formTitle":"[1728]猫和老鼠 II","frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"articleLive":2,"formTitle":"[1729]求关注者的数量","frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","title":"求关注者的数量","titleSlug":"find-followers-count"},{"articleLive":2,"formTitle":"[1730]获取食物的最短路径","frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"articleLive":2,"formTitle":"[1731]每位经理的下属员工数量","frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"articleLive":2,"formTitle":"[1732]找到最高海拔","frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"articleLive":2,"formTitle":"[1733]需要教语言的最少人数","frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"articleLive":2,"formTitle":"[1734]解码异或后的排列","frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"","title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"articleLive":2,"formTitle":"[1735]生成乘积数组的方案数","frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"articleLive":2,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"","title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"articleLive":2,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"articleLive":2,"formTitle":"[1738]找出第 K 大的异或坐标值","frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"","title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"articleLive":2,"formTitle":"[1739]放置盒子","frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","title":"放置盒子","titleSlug":"building-boxes"},{"articleLive":2,"formTitle":"[1740]找到二叉树中的距离","frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1741]查找每个员工花费的总时间","frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"articleLive":2,"formTitle":"[1742]盒子中小球的最大数量","frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"articleLive":2,"formTitle":"[1743]从相邻元素对还原数组","frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"","title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"articleLive":2,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"","title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"articleLive":2,"formTitle":"[1745]回文串分割 IV","frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"articleLive":2,"formTitle":"[1746]经过一次操作后的最大子数组和","frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"articleLive":2,"formTitle":"[1747]应该被禁止的Leetflex账户","frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"articleLive":2,"formTitle":"[1748]唯一元素的和","frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"articleLive":2,"formTitle":"[1749]任意子数组和的绝对值的最大值","frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"articleLive":2,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"articleLive":2,"formTitle":"[1751]最多可以参加的会议数目 II","frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"articleLive":2,"formTitle":"[1752]检查数组是否经排序和轮转得到","frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"articleLive":2,"formTitle":"[1753]移除石子的最大得分","frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"articleLive":2,"formTitle":"[1754]构造字典序最大的合并字符串","frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"articleLive":2,"formTitle":"[1755]最接近目标值的子序列和","frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"articleLive":2,"formTitle":"[1756]设计最近使用（MRU）队列","frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"articleLive":2,"formTitle":"[1757]可回收且低脂的产品","frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"articleLive":2,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"articleLive":2,"formTitle":"[1759]统计同构子字符串的数目","frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"articleLive":2,"formTitle":"[1760]袋子里最少数目的球","frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"articleLive":2,"formTitle":"[1761]一个图中连通三元组的最小度数","frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"articleLive":2,"formTitle":"[1762]能看到海景的建筑物","frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"articleLive":2,"formTitle":"[1763]最长的美好子字符串","frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"articleLive":2,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"articleLive":2,"formTitle":"[1765]地图中的最高点","frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"articleLive":2,"formTitle":"[1766]互质树","frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","title":"互质树","titleSlug":"tree-of-coprimes"},{"articleLive":2,"formTitle":"[1767]Find the Subtasks That Did Not Execute","frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"},{"articleLive":2,"formTitle":"[1768]交替合并字符串","frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"articleLive":2,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"articleLive":2,"formTitle":"[1770]执行乘法运算的最大分数","frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"articleLive":2,"formTitle":"[1771]由子序列构造的最长回文串的长度","frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"articleLive":2,"formTitle":"[1772]按受欢迎程度排列功能","frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"articleLive":2,"formTitle":"[1773]统计匹配检索规则的物品数量","frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"articleLive":2,"formTitle":"[1774]最接近目标价格的甜点成本","frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"articleLive":2,"formTitle":"[1775]通过最少操作次数使数组的和相等","frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"articleLive":2,"formTitle":"[1776]车队 II","frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","title":"车队 II","titleSlug":"car-fleet-ii"},{"articleLive":2,"formTitle":"[1777]每家商店的产品价格","frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"articleLive":2,"formTitle":"[1778]Shortest Path in a Hidden Grid","frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"},{"articleLive":2,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"articleLive":2,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"articleLive":2,"formTitle":"[1781]所有子字符串美丽值之和","frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"articleLive":2,"formTitle":"[1782]统计点对的数目","frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"articleLive":2,"formTitle":"[1783]大满贯数量","frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","title":"大满贯数量","titleSlug":"grand-slam-titles"},{"articleLive":2,"formTitle":"[1784]检查二进制字符串字段","frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"articleLive":2,"formTitle":"[1785]构成特定和需要添加的最少元素","frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"articleLive":2,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"articleLive":2,"formTitle":"[1787]使所有区间的异或结果为零","frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"","title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"articleLive":2,"formTitle":"[1788]Maximize the Beauty of the Garden","frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"},{"articleLive":2,"formTitle":"[1789]Primary Department for Each Employee","frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"},{"articleLive":2,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"articleLive":2,"formTitle":"[1791]找出星型图的中心节点","frontendQuestionId":"1791","leaf":true,"level":2,"nodeType":"def","questionId":"1916","status":"","title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"articleLive":2,"formTitle":"[1792]最大平均通过率","frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"articleLive":2,"formTitle":"[1793]好子数组的最大分数","frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"articleLive":2,"formTitle":"[1794]Count Pairs of Equal Substrings With Minimum Difference","frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"articleLive":2,"formTitle":"[1795]Rearrange Products Table","frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","title":"Rearrange Products Table","titleSlug":"rearrange-products-table"},{"articleLive":2,"formTitle":"[1796]字符串中第二大的数字","frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"articleLive":2,"formTitle":"[1797]设计一个验证系统","frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"articleLive":2,"formTitle":"[1798]你能构造出连续值的最大数目","frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"articleLive":2,"formTitle":"[1799]N 次操作后的最大分数和","frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"articleLive":2,"formTitle":"[1800]最大升序子数组和","frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"articleLive":2,"formTitle":"[1801]积压订单中的订单总数","frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"articleLive":2,"formTitle":"[1802]有界数组中指定下标处的最大值","frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"articleLive":2,"formTitle":"[1803]统计异或值在范围内的数对有多少","frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"","title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"articleLive":2,"formTitle":"[1804]实现 Trie （前缀树） II","frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"articleLive":2,"formTitle":"[1805]字符串中不同整数的数目","frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"articleLive":2,"formTitle":"[1806]还原排列的最少操作步数","frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"articleLive":2,"formTitle":"[1807]替换字符串中的括号内容","frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"articleLive":2,"formTitle":"[1808]好因子的最大数目","frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"articleLive":2,"formTitle":"[1809]Ad-Free Sessions","frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"},{"articleLive":2,"formTitle":"[1810]Minimum Path Cost in a Hidden Grid","frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"articleLive":2,"formTitle":"[1811]Find Interview Candidates","frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","title":"Find Interview Candidates","titleSlug":"find-interview-candidates"},{"articleLive":2,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"articleLive":2,"formTitle":"[1813]句子相似性 III","frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"articleLive":2,"formTitle":"[1814]统计一个数组中好对子的数目","frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"articleLive":2,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"articleLive":2,"formTitle":"[1816]截断句子","frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","title":"截断句子","titleSlug":"truncate-sentence"},{"articleLive":2,"formTitle":"[1817]查找用户活跃分钟数","frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"articleLive":2,"formTitle":"[1818]绝对差值和","frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"notac","title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"articleLive":2,"formTitle":"[1819]序列中不同最大公约数的数目","frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"articleLive":2,"formTitle":"[1820]Maximum Number of Accepted Invitations","frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"},{"articleLive":2,"formTitle":"[1821]Find Customers With Positive Revenue this Year","frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"},{"articleLive":2,"formTitle":"[1822]数组元素积的符号","frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"articleLive":2,"formTitle":"[1823]找出游戏的获胜者","frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"articleLive":2,"formTitle":"[1824]最少侧跳次数","frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"articleLive":2,"formTitle":"[1825]求出 MK 平均值","frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"articleLive":2,"formTitle":"[1826]Faulty Sensor","frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"articleLive":2,"formTitle":"[1827]最少操作使数组递增","frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"articleLive":2,"formTitle":"[1828]统计一个圆中点的数目","frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"articleLive":2,"formTitle":"[1829]每个查询的最大异或值","frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"articleLive":2,"formTitle":"[1830]使字符串有序的最少操作次数","frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"articleLive":2,"formTitle":"[1831]Maximum Transaction Each Day","frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"},{"articleLive":2,"formTitle":"[1832]判断句子是否为全字母句","frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"articleLive":2,"formTitle":"[1833]雪糕的最大数量","frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"articleLive":2,"formTitle":"[1834]单线程 CPU","frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"articleLive":2,"formTitle":"[1835]所有数对按位与结果的异或和","frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"articleLive":2,"formTitle":"[1836]Remove Duplicates From an Unsorted Linked List","frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"articleLive":2,"formTitle":"[1837]K 进制表示下的各位数字总和","frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"articleLive":2,"formTitle":"[1838]最高频元素的频数","frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"articleLive":2,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"articleLive":2,"formTitle":"[1840]最高建筑高度","frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","title":"最高建筑高度","titleSlug":"maximum-building-height"},{"articleLive":2,"formTitle":"[1841]League Statistics","frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","title":"League Statistics","titleSlug":"league-statistics"},{"articleLive":2,"formTitle":"[1842]Next Palindrome Using Same Digits","frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"},{"articleLive":2,"formTitle":"[LCP 01]猜数字","frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","title":"猜数字","titleSlug":"guess-numbers"},{"articleLive":2,"formTitle":"[LCP 02]分式化简","frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","title":"分式化简","titleSlug":"deep-dark-fraction"},{"articleLive":2,"formTitle":"[LCP 03]机器人大冒险","frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","title":"机器人大冒险","titleSlug":"programmable-robot"},{"articleLive":2,"formTitle":"[LCP 04]覆盖","frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","title":"覆盖","titleSlug":"broken-board-dominoes"},{"articleLive":2,"formTitle":"[LCP 05]发 LeetCoin","frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","title":"发 LeetCoin","titleSlug":"coin-bonus"},{"articleLive":2,"formTitle":"[LCP 06]拿硬币","frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","title":"拿硬币","titleSlug":"na-ying-bi"},{"articleLive":2,"formTitle":"[LCP 07]传递信息","frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"","title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"articleLive":2,"formTitle":"[LCP 08]剧情触发时间","frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"articleLive":2,"formTitle":"[LCP 09]最小跳跃次数","frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"articleLive":2,"formTitle":"[LCP 10]二叉树任务调度","frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"articleLive":2,"formTitle":"[LCP 11]期望个数统计","frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"articleLive":2,"formTitle":"[LCP 12]小张刷题计划","frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"articleLive":2,"formTitle":"[LCP 13]寻宝","frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","title":"寻宝","titleSlug":"xun-bao"},{"articleLive":2,"formTitle":"[LCP 14]切分数组","frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"articleLive":2,"formTitle":"[LCP 15]游乐园的迷宫","frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"articleLive":2,"formTitle":"[LCP 16]游乐园的游览计划","frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"articleLive":2,"formTitle":"[LCP 17]速算机器人","frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","title":"速算机器人","titleSlug":"nGK0Fy"},{"articleLive":2,"formTitle":"[LCP 18]早餐组合","frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"","title":"早餐组合","titleSlug":"2vYnGI"},{"articleLive":2,"formTitle":"[LCP 19]秋叶收藏集","frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","title":"秋叶收藏集","titleSlug":"UlBDOe"},{"articleLive":2,"formTitle":"[LCP 20]快速公交","frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","title":"快速公交","titleSlug":"meChtZ"},{"articleLive":2,"formTitle":"[LCP 21]追逐游戏","frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","title":"追逐游戏","titleSlug":"Za25hA"},{"articleLive":2,"formTitle":"[LCP 22]黑白方格画","frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"","title":"黑白方格画","titleSlug":"ccw6C7"},{"articleLive":2,"formTitle":"[LCP 23]魔术排列","frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","title":"魔术排列","titleSlug":"er94lq"},{"articleLive":2,"formTitle":"[LCP 24]数字游戏","frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","title":"数字游戏","titleSlug":"5TxKeK"},{"articleLive":2,"formTitle":"[LCP 25]古董键盘","frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","title":"古董键盘","titleSlug":"Uh984O"},{"articleLive":2,"formTitle":"[LCP 26]导航装置","frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","title":"导航装置","titleSlug":"hSRGyL"},{"articleLive":2,"formTitle":"[LCP 27]黑盒光线反射","frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"articleLive":2,"formTitle":"[LCP 28]采购方案","frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","title":"采购方案","titleSlug":"4xy4Wx"},{"articleLive":2,"formTitle":"[LCP 29]乐团站位","frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","title":"乐团站位","titleSlug":"SNJvJP"},{"articleLive":2,"formTitle":"[LCP 30]魔塔游戏","frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"notac","title":"魔塔游戏","titleSlug":"p0NxJO"},{"articleLive":2,"formTitle":"[LCP 31]变换的迷宫","frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","title":"变换的迷宫","titleSlug":"Db3wC1"},{"articleLive":2,"formTitle":"[LCP 32]批量处理任务","frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","title":"批量处理任务","titleSlug":"t3fKg1"},{"articleLive":2,"formTitle":"[LCP 33]蓄水","frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","title":"蓄水","titleSlug":"o8SXZn"},{"articleLive":2,"formTitle":"[LCP 34]二叉树染色","frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"articleLive":2,"formTitle":"[LCP 35]电动车游城市","frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","title":"电动车游城市","titleSlug":"DFPeFJ"},{"articleLive":2,"formTitle":"[LCP 36]最多牌组数","frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","title":"最多牌组数","titleSlug":"Up5XYM"},{"articleLive":2,"formTitle":"[LCP 37]最小矩形面积","frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"articleLive":2,"formTitle":"[LCP 38]守卫城堡","frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","title":"守卫城堡","titleSlug":"7rLGCR"},{"articleLive":2,"formTitle":"[剑指 Offer 03]数组中重复的数字","frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 04]二维数组中的查找","frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 05]替换空格","frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 07]重建二叉树","frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 12]矩阵中的路径","frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 13]机器人的运动范围","frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 14- I]剪绳子","frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 15]二进制中1的个数","frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"","title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 16]数值的整数次方","frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 18]删除链表的节点","frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 19]正则表达式匹配","frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 20]表示数值的字符串","frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 24]反转链表","frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 26]树的子结构","frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 27]二叉树的镜像","frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 28]对称的二叉树","frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 30]包含min函数的栈","frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 35]复杂链表的复制","frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 37]序列化二叉树","frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"","title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 38]字符串的排列","frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"","title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"","title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 40]最小的k个数","frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 41]数据流中的中位数","frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"","title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 47]礼物的最大价值","frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 49]丑数","frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","title":"丑数","titleSlug":"chou-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 51]数组中的逆序对","frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"","title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 57]和为s的两个数字","frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"","title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 60]n个骰子的点数","frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 63]股票的最大利润","frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 64]求1+2+…+n","frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 66]构建乘积数组","frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"articleLive":2,"formTitle":"[面试题 01.01]判定字符是否唯一","frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"articleLive":2,"formTitle":"[面试题 01.02]判定是否互为字符重排","frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"articleLive":2,"formTitle":"[面试题 01.03]URL化","frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","title":"URL化","titleSlug":"string-to-url-lcci"},{"articleLive":2,"formTitle":"[面试题 01.04]回文排列","frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"articleLive":2,"formTitle":"[面试题 01.05]一次编辑","frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","title":"一次编辑","titleSlug":"one-away-lcci"},{"articleLive":2,"formTitle":"[面试题 01.06]字符串压缩","frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","title":"字符串压缩","titleSlug":"compress-string-lcci"},{"articleLive":2,"formTitle":"[面试题 01.07]旋转矩阵","frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"articleLive":2,"formTitle":"[面试题 01.08]零矩阵","frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"articleLive":2,"formTitle":"[面试题 01.09]字符串轮转","frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"articleLive":2,"formTitle":"[面试题 02.01]移除重复节点","frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"articleLive":2,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.03]删除中间节点","frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"articleLive":2,"formTitle":"[面试题 02.04]分割链表","frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","title":"分割链表","titleSlug":"partition-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.05]链表求和","frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","title":"链表求和","titleSlug":"sum-lists-lcci"},{"articleLive":2,"formTitle":"[面试题 02.06]回文链表","frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.07]链表相交","frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"articleLive":2,"formTitle":"[面试题 02.08]环路检测","frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"articleLive":2,"formTitle":"[面试题 03.01]三合一","frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","title":"三合一","titleSlug":"three-in-one-lcci"},{"articleLive":2,"formTitle":"[面试题 03.02]栈的最小值","frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","title":"栈的最小值","titleSlug":"min-stack-lcci"},{"articleLive":2,"formTitle":"[面试题 03.03]堆盘子","frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"articleLive":2,"formTitle":"[面试题 03.04]化栈为队","frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"articleLive":2,"formTitle":"[面试题 03.05]栈排序","frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"articleLive":2,"formTitle":"[面试题 03.06]动物收容所","frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"articleLive":2,"formTitle":"[面试题 04.01]节点间通路","frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"articleLive":2,"formTitle":"[面试题 04.02]最小高度树","frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.03]特定深度节点链表","frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"articleLive":2,"formTitle":"[面试题 04.04]检查平衡性","frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","title":"检查平衡性","titleSlug":"check-balance-lcci"},{"articleLive":2,"formTitle":"[面试题 04.05]合法二叉搜索树","frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.06]后继者","frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","title":"后继者","titleSlug":"successor-lcci"},{"articleLive":2,"formTitle":"[面试题 04.08]首个共同祖先","frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"articleLive":2,"formTitle":"[面试题 04.09]二叉搜索树序列","frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"articleLive":2,"formTitle":"[面试题 04.10]检查子树","frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","title":"检查子树","titleSlug":"check-subtree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.12]求和路径","frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"articleLive":2,"formTitle":"[面试题 05.01]插入","frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","title":"插入","titleSlug":"insert-into-bits-lcci"},{"articleLive":2,"formTitle":"[面试题 05.02]二进制数转字符串","frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"articleLive":2,"formTitle":"[面试题 05.03]翻转数位","frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"articleLive":2,"formTitle":"[面试题 05.04]下一个数","frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","title":"下一个数","titleSlug":"closed-number-lcci"},{"articleLive":2,"formTitle":"[面试题 05.06]整数转换","frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","title":"整数转换","titleSlug":"convert-integer-lcci"},{"articleLive":2,"formTitle":"[面试题 05.07]配对交换","frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","title":"配对交换","titleSlug":"exchange-lcci"},{"articleLive":2,"formTitle":"[面试题 05.08]绘制直线","frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","title":"绘制直线","titleSlug":"draw-line-lcci"},{"articleLive":2,"formTitle":"[面试题 08.01]三步问题","frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"articleLive":2,"formTitle":"[面试题 08.02]迷路的机器人","frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"articleLive":2,"formTitle":"[面试题 08.03]魔术索引","frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","title":"魔术索引","titleSlug":"magic-index-lcci"},{"articleLive":2,"formTitle":"[面试题 08.04]幂集","frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","title":"幂集","titleSlug":"power-set-lcci"},{"articleLive":2,"formTitle":"[面试题 08.05]递归乘法","frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"articleLive":2,"formTitle":"[面试题 08.06]汉诺塔问题","frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"articleLive":2,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"articleLive":2,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"articleLive":2,"formTitle":"[面试题 08.09]括号","frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","title":"括号","titleSlug":"bracket-lcci"},{"articleLive":2,"formTitle":"[面试题 08.10]颜色填充","frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","title":"颜色填充","titleSlug":"color-fill-lcci"},{"articleLive":2,"formTitle":"[面试题 08.11]硬币","frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","title":"硬币","titleSlug":"coin-lcci"},{"articleLive":2,"formTitle":"[面试题 08.12]八皇后","frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","title":"八皇后","titleSlug":"eight-queens-lcci"},{"articleLive":2,"formTitle":"[面试题 08.13]堆箱子","frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","title":"堆箱子","titleSlug":"pile-box-lcci"},{"articleLive":2,"formTitle":"[面试题 08.14]布尔运算","frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"","title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"articleLive":2,"formTitle":"[面试题 10.01]合并排序的数组","frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"articleLive":2,"formTitle":"[面试题 10.02]变位词组","frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"","title":"变位词组","titleSlug":"group-anagrams-lcci"},{"articleLive":2,"formTitle":"[面试题 10.03]搜索旋转数组","frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"articleLive":2,"formTitle":"[面试题 10.05]稀疏数组搜索","frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"articleLive":2,"formTitle":"[面试题 10.09]排序矩阵查找","frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"articleLive":2,"formTitle":"[面试题 10.10]数字流的秩","frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"articleLive":2,"formTitle":"[面试题 10.11]峰与谷","frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"articleLive":2,"formTitle":"[面试题 16.01]交换数字","frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","title":"交换数字","titleSlug":"swap-numbers-lcci"},{"articleLive":2,"formTitle":"[面试题 16.02]单词频率","frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","title":"单词频率","titleSlug":"words-frequency-lcci"},{"articleLive":2,"formTitle":"[面试题 16.03]交点","frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","title":"交点","titleSlug":"intersection-lcci"},{"articleLive":2,"formTitle":"[面试题 16.04]井字游戏","frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"articleLive":2,"formTitle":"[面试题 16.05]阶乘尾数","frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"articleLive":2,"formTitle":"[面试题 16.06]最小差","frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","title":"最小差","titleSlug":"smallest-difference-lcci"},{"articleLive":2,"formTitle":"[面试题 16.07]最大数值","frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","title":"最大数值","titleSlug":"maximum-lcci"},{"articleLive":2,"formTitle":"[面试题 16.08]整数的英语表示","frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","title":"整数的英语表示","titleSlug":"english-int-lcci"},{"articleLive":2,"formTitle":"[面试题 16.09]运算","frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","title":"运算","titleSlug":"operations-lcci"},{"articleLive":2,"formTitle":"[面试题 16.10]生存人数","frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","title":"生存人数","titleSlug":"living-people-lcci"},{"articleLive":2,"formTitle":"[面试题 16.11]跳水板","frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","title":"跳水板","titleSlug":"diving-board-lcci"},{"articleLive":2,"formTitle":"[面试题 16.13]平分正方形","frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"articleLive":2,"formTitle":"[面试题 16.14]最佳直线","frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","title":"最佳直线","titleSlug":"best-line-lcci"},{"articleLive":2,"formTitle":"[面试题 16.15]珠玑妙算","frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"articleLive":2,"formTitle":"[面试题 16.16]部分排序","frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","title":"部分排序","titleSlug":"sub-sort-lcci"},{"articleLive":2,"formTitle":"[面试题 16.17]连续数列","frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"articleLive":2,"formTitle":"[面试题 16.18]模式匹配","frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"articleLive":2,"formTitle":"[面试题 16.19]水域大小","frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","title":"水域大小","titleSlug":"pond-sizes-lcci"},{"articleLive":2,"formTitle":"[面试题 16.20]T9键盘","frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","title":"T9键盘","titleSlug":"t9-lcci"},{"articleLive":2,"formTitle":"[面试题 16.21]交换和","frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","title":"交换和","titleSlug":"sum-swap-lcci"},{"articleLive":2,"formTitle":"[面试题 16.22]兰顿蚂蚁","frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"articleLive":2,"formTitle":"[面试题 16.24]数对和","frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"articleLive":2,"formTitle":"[面试题 16.25]LRU 缓存","frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"articleLive":2,"formTitle":"[面试题 16.26]计算器","frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","title":"计算器","titleSlug":"calculator-lcci"},{"articleLive":2,"formTitle":"[面试题 17.01]不用加号的加法","frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"articleLive":2,"formTitle":"[面试题 17.04]消失的数字","frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","title":"消失的数字","titleSlug":"missing-number-lcci"},{"articleLive":2,"formTitle":"[面试题 17.05] 字母与数字","frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"articleLive":2,"formTitle":"[面试题 17.06]2出现的次数","frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"articleLive":2,"formTitle":"[面试题 17.07]婴儿名字","frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","title":"婴儿名字","titleSlug":"baby-names-lcci"},{"articleLive":2,"formTitle":"[面试题 17.08]马戏团人塔","frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"articleLive":2,"formTitle":"[面试题 17.09]第 k 个数","frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"articleLive":2,"formTitle":"[面试题 17.10]主要元素","frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"","title":"主要元素","titleSlug":"find-majority-element-lcci"},{"articleLive":2,"formTitle":"[面试题 17.11]单词距离","frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","title":"单词距离","titleSlug":"find-closest-lcci"},{"articleLive":2,"formTitle":"[面试题 17.12]BiNode","frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","title":"BiNode","titleSlug":"binode-lcci"},{"articleLive":2,"formTitle":"[面试题 17.13]恢复空格","frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","title":"恢复空格","titleSlug":"re-space-lcci"},{"articleLive":2,"formTitle":"[面试题 17.14]最小K个数","frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","title":"最小K个数","titleSlug":"smallest-k-lcci"},{"articleLive":2,"formTitle":"[面试题 17.15]最长单词","frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","title":"最长单词","titleSlug":"longest-word-lcci"},{"articleLive":2,"formTitle":"[面试题 17.16]按摩师","frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","title":"按摩师","titleSlug":"the-masseuse-lcci"},{"articleLive":2,"formTitle":"[面试题 17.17]多次搜索","frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","title":"多次搜索","titleSlug":"multi-search-lcci"},{"articleLive":2,"formTitle":"[面试题 17.18]最短超串","frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"articleLive":2,"formTitle":"[面试题 17.19]消失的两个数字","frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"articleLive":2,"formTitle":"[面试题 17.20]连续中值","frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","title":"连续中值","titleSlug":"continuous-median-lcci"},{"articleLive":2,"formTitle":"[面试题 17.21]直方图的水量","frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"articleLive":2,"formTitle":"[面试题 17.22]单词转换","frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","title":"单词转换","titleSlug":"word-transformer-lcci"},{"articleLive":2,"formTitle":"[面试题 17.23]最大黑方阵","frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"articleLive":2,"formTitle":"[面试题 17.24]最大子矩阵","frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"articleLive":2,"formTitle":"[面试题 17.25]单词矩阵","frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"articleLive":2,"formTitle":"[面试题 17.26]稀疏相似度","frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file