diff --git a/src/main/java/leetcode/editor/cn/ValidParenthesisString.java b/src/main/java/leetcode/editor/cn/ValidParenthesisString.java
new file mode 100644
index 0000000..badbe2a
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/ValidParenthesisString.java
@@ -0,0 +1,80 @@
+//给定一个只包含三种字符的字符串：（ ，） 和 *，写一个函数来检验这个字符串是否为有效字符串。有效字符串具有如下规则：
+//
+//
+// 任何左括号 ( 必须有相应的右括号 )。
+// 任何右括号 ) 必须有相应的左括号 ( 。
+// 左括号 ( 必须在对应的右括号之前 )。
+// * 可以被视为单个右括号 ) ，或单个左括号 ( ，或一个空字符串。
+// 一个空字符串也被视为有效字符串。
+//
+//
+// 示例 1:
+//
+//
+//输入: "()"
+//输出: True
+//
+//
+// 示例 2:
+//
+//
+//输入: "(*)"
+//输出: True
+//
+//
+// 示例 3:
+//
+//
+//输入: "(*))"
+//输出: True
+//
+//
+// 注意:
+//
+//
+// 字符串大小将在 [1，100] 范围内。
+//
+// Related Topics 栈 贪心 字符串 动态规划 👍 359 👎 0
+
+package leetcode.editor.cn;
+
+//678:有效的括号字符串
+class ValidParenthesisString {
+ public static void main(String[] args) {
+ //测试代码
+ Solution solution = new ValidParenthesisString().new Solution();
+ }
+
+ //力扣代码
+ //leetcode submit region begin(Prohibit modification and deletion)
+ class Solution {
+ public boolean checkValidString(String s) {
+ int n = s.length();
+ boolean[][] dp = new boolean[n][n];
+ for (int i = 0; i < n; i++) {
+ if (s.charAt(i) == '*') {
+ dp[i][i] = true;
+ }
+ }
+ for (int i = 1; i < n; i++) {
+ char c1 = s.charAt(i - 1), c2 = s.charAt(i);
+ dp[i - 1][i] = (c1 == '(' || c1 == '*') && (c2 == ')' || c2 == '*');
+ }
+ for (int i = n - 3; i >= 0; i--) {
+ char c1 = s.charAt(i);
+ for (int j = i + 2; j < n; j++) {
+ char c2 = s.charAt(j);
+ if ((c1 == '(' || c1 == '*') && (c2 == ')' || c2 == '*')) {
+ dp[i][j] = dp[i + 1][j - 1];
+ }
+ for (int k = i; k < j && !dp[i][j]; k++) {
+ dp[i][j] = dp[i][k] && dp[k + 1][j];
+ }
+ }
+ }
+ return dp[0][n - 1];
+ }
+ }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json
index 704ddbe..15cdc66 100644
--- a/src/main/java/leetcode/editor/cn/doc/all.json
+++ b/src/main/java/leetcode/editor/cn/doc/all.json
@@ -1 +1 @@
-[{"acceptance":0.43495424367486096,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[600]不含连续1的非负整数","frequency":23.32421688025942,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5197529913348617,"acs":0,"articleLive":2,"columnArticles":14014,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4083544246072463,"acs":0,"articleLive":2,"columnArticles":7028,"formTitle":"[2]两数相加","frequency":99.23342973434173,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3796258655087431,"acs":0,"articleLive":2,"columnArticles":7252,"formTitle":"[3]无重复字符的最长子串","frequency":96.25537431302625,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.407913381239392,"acs":0,"articleLive":2,"columnArticles":3738,"formTitle":"[4]寻找两个正序数组的中位数","frequency":95.98949482163226,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3535843952025606,"acs":0,"articleLive":2,"columnArticles":3904,"formTitle":"[5]最长回文子串","frequency":98.08503469701962,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5065189947817376,"acs":0,"articleLive":2,"columnArticles":2399,"formTitle":"[6]Z 字形变换","frequency":79.83311546061877,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3534347286837752,"acs":0,"articleLive":2,"columnArticles":5174,"formTitle":"[7]整数反转","frequency":98.8516049626779,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.217124331573811,"acs":0,"articleLive":2,"columnArticles":2636,"formTitle":"[8]字符串转换整数 (atoi)","frequency":73.05347585502979,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5850802921969773,"acs":0,"articleLive":2,"columnArticles":4838,"formTitle":"[9]回文数","frequency":83.22142215222567,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.316396297661001,"acs":0,"articleLive":2,"columnArticles":1222,"formTitle":"[10]正则表达式匹配","frequency":87.2540180593427,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6301869026429634,"acs":0,"articleLive":2,"columnArticles":2949,"formTitle":"[11]盛最多水的容器","frequency":88.39576051721629,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6653257885260708,"acs":0,"articleLive":2,"columnArticles":1737,"formTitle":"[12]整数转罗马数字","frequency":77.52585507962877,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.632770818835537,"acs":0,"articleLive":2,"columnArticles":3809,"formTitle":"[13]罗马数字转整数","frequency":83.96664724222634,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4080317875419588,"acs":0,"articleLive":2,"columnArticles":3800,"formTitle":"[14]最长公共前缀","frequency":90.87863968332361,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33424646078177717,"acs":0,"articleLive":2,"columnArticles":2997,"formTitle":"[15]三数之和","frequency":95.13632881547677,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4594924608614097,"acs":0,"articleLive":2,"columnArticles":1400,"formTitle":"[16]最接近的三数之和","frequency":85.10047038604756,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5721636041127287,"acs":0,"articleLive":2,"columnArticles":2993,"formTitle":"[17]电话号码的字母组合","frequency":75.62577092373456,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40059689444558616,"acs":0,"articleLive":2,"columnArticles":1478,"formTitle":"[18]四数之和","frequency":68.23046316409282,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42851379755140356,"acs":0,"articleLive":2,"columnArticles":3756,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":77.21534487145287,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44484163383447917,"acs":0,"articleLive":2,"columnArticles":5445,"formTitle":"[20]有效的括号","frequency":93.57547918168206,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672246712958961,"acs":0,"articleLive":2,"columnArticles":3386,"formTitle":"[21]合并两个有序链表","frequency":87.07099501358329,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724337896138,"acs":0,"articleLive":2,"columnArticles":2572,"formTitle":"[22]括号生成","frequency":91.16939842440358,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5590028656523055,"acs":0,"articleLive":2,"columnArticles":2057,"formTitle":"[23]合并K个升序链表","frequency":83.68623391204147,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7030993324444728,"acs":0,"articleLive":2,"columnArticles":2455,"formTitle":"[24]两两交换链表中的节点","frequency":61.43036519653394,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6567618286848729,"acs":0,"articleLive":2,"columnArticles":2131,"formTitle":"[25]K 个一组翻转链表","frequency":90.11206941766534,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5400091570792863,"acs":0,"articleLive":2,"columnArticles":4431,"formTitle":"[26]删除有序数组中的重复项","frequency":81.76572046901232,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5981264069484922,"acs":0,"articleLive":2,"columnArticles":3986,"formTitle":"[27]移除元素","frequency":76.16905767799389,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4067595004749905,"acs":0,"articleLive":2,"columnArticles":3162,"formTitle":"[28]实现 strStr()","frequency":74.32873072260038,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20762396367410083,"acs":0,"articleLive":2,"columnArticles":874,"formTitle":"[29]两数相除","frequency":66.50358243498066,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3568717859401784,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[30]串联所有单词的子串","frequency":53.85325667179753,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3732368987258215,"acs":0,"articleLive":2,"columnArticles":1699,"formTitle":"[31]下一个排列","frequency":81.94976681239248,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3562757844012273,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[32]最长有效括号","frequency":76.57670391119724,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4264978741012156,"acs":0,"articleLive":2,"columnArticles":2353,"formTitle":"[33]搜索旋转排序数组","frequency":72.15270224848179,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42419798538132386,"acs":0,"articleLive":2,"columnArticles":3185,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.9141699894745,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4650024752875087,"acs":0,"articleLive":2,"columnArticles":3826,"formTitle":"[35]搜索插入位置","frequency":77.13919464715238,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6281664459831992,"acs":0,"articleLive":2,"columnArticles":1139,"formTitle":"[36]有效的数独","frequency":54.63157507891411,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6703869453692081,"acs":0,"articleLive":2,"columnArticles":831,"formTitle":"[37]解数独","frequency":63.54355616189983,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5800915487773958,"acs":0,"articleLive":2,"columnArticles":2241,"formTitle":"[38]外观数列","frequency":64.46778834752071,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7273501852401207,"acs":0,"articleLive":2,"columnArticles":1899,"formTitle":"[39]组合总和","frequency":73.62291435639182,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.626188628916945,"acs":0,"articleLive":2,"columnArticles":1357,"formTitle":"[40]组合总和 II","frequency":72.45246819501374,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4193083273473042,"acs":0,"articleLive":2,"columnArticles":1391,"formTitle":"[41]缺失的第一个正数","frequency":89.52060639325109,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5774557614091889,"acs":0,"articleLive":2,"columnArticles":2374,"formTitle":"[42]接雨水","frequency":95.22060490839617,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4490652720701894,"acs":0,"articleLive":2,"columnArticles":1120,"formTitle":"[43]字符串相乘","frequency":83.07437128261593,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32810219699816096,"acs":0,"articleLive":2,"columnArticles":542,"formTitle":"[44]通配符匹配","frequency":62.57693291443721,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42707172117012776,"acs":0,"articleLive":2,"columnArticles":1560,"formTitle":"[45]跳跃游戏 II","frequency":96.55189416570308,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7826237247480052,"acs":0,"articleLive":2,"columnArticles":2621,"formTitle":"[46]全排列","frequency":94.40051465237784,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6371314178623149,"acs":0,"articleLive":2,"columnArticles":1442,"formTitle":"[47]全排列 II","frequency":67.6298310293044,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352978218617142,"acs":0,"articleLive":2,"columnArticles":1834,"formTitle":"[48]旋转图像","frequency":73.0357032071298,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6643095870408131,"acs":0,"articleLive":2,"columnArticles":1286,"formTitle":"[49]字母异位词分组","frequency":70.06413705655982,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767806028248898,"acs":0,"articleLive":2,"columnArticles":1262,"formTitle":"[50]Pow(x, n)","frequency":71.31017779353444,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7392004015708507,"acs":0,"articleLive":2,"columnArticles":1510,"formTitle":"[51]N 皇后","frequency":67.55317864959,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8229930310435334,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[52]N皇后 II","frequency":32.65721719716918,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5518626867130004,"acs":0,"articleLive":2,"columnArticles":3680,"formTitle":"[53]最大子序和","frequency":80.53670947439873,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4801191528635835,"acs":0,"articleLive":2,"columnArticles":1965,"formTitle":"[54]螺旋矩阵","frequency":88.22173399667825,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43237648148479957,"acs":0,"articleLive":2,"columnArticles":2423,"formTitle":"[55]跳跃游戏","frequency":73.62291435639182,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46761927557044836,"acs":0,"articleLive":2,"columnArticles":2257,"formTitle":"[56]合并区间","frequency":84.52056148139484,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4109485697705346,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[57]插入区间","frequency":38.76426187161191,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3552803468867178,"acs":0,"articleLive":2,"columnArticles":2354,"formTitle":"[58]最后一个单词的长度","frequency":55.68547306344613,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7925794507867941,"acs":0,"articleLive":2,"columnArticles":1528,"formTitle":"[59]螺旋矩阵 II","frequency":80.24181170201334,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5236615566037736,"acs":0,"articleLive":2,"columnArticles":936,"formTitle":"[60]排列序列","frequency":44.475628174278235,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4178881509538387,"acs":0,"articleLive":2,"columnArticles":1961,"formTitle":"[61]旋转链表","frequency":69.49453246678047,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6609375437930789,"acs":0,"articleLive":2,"columnArticles":2375,"formTitle":"[62]不同路径","frequency":67.0742279831335,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39041592555613597,"acs":0,"articleLive":2,"columnArticles":1676,"formTitle":"[63]不同路径 II","frequency":69.42223729657904,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6881728304650311,"acs":0,"articleLive":2,"columnArticles":2044,"formTitle":"[64]最小路径和","frequency":75.16616030669667,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26917388423493777,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[65]有效数字","frequency":43.84961624160956,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4582598345405901,"acs":0,"articleLive":2,"columnArticles":3107,"formTitle":"[66]加一","frequency":62.82975827171578,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5436774535446263,"acs":0,"articleLive":2,"columnArticles":1748,"formTitle":"[67]二进制求和","frequency":56.86664251132696,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5256928860365061,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[68]文本左右对齐","frequency":43.920839013075856,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39270710000686676,"acs":0,"articleLive":2,"columnArticles":1893,"formTitle":"[69]x 的平方根","frequency":79.86787701534256,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5288010189071044,"acs":0,"articleLive":2,"columnArticles":3491,"formTitle":"[70]爬楼梯","frequency":92.52691695437044,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42136154520227836,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[71]简化路径","frequency":57.53787205241439,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6134738791506955,"acs":0,"articleLive":2,"columnArticles":1212,"formTitle":"[72]编辑距离","frequency":92.41945631294917,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6027603852959991,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[73]矩阵置零","frequency":53.85325667179753,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45953547374834125,"acs":0,"articleLive":2,"columnArticles":1665,"formTitle":"[74]搜索二维矩阵","frequency":77.13011079186461,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5948279782096638,"acs":0,"articleLive":2,"columnArticles":1815,"formTitle":"[75]颜色分类","frequency":51.92730508270639,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42521359389568625,"acs":0,"articleLive":2,"columnArticles":1228,"formTitle":"[76]最小覆盖子串","frequency":78.54809400076039,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700081865667857,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[77]组合","frequency":75.02459546686822,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8009119538979989,"acs":0,"articleLive":2,"columnArticles":1995,"formTitle":"[78]子集","frequency":73.14653719454209,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4579336694932747,"acs":0,"articleLive":2,"columnArticles":1364,"formTitle":"[79]单词搜索","frequency":74.49529309986298,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6163931656423578,"acs":0,"articleLive":2,"columnArticles":1310,"formTitle":"[80]删除有序数组中的重复项 II","frequency":69.29570855863423,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.415676943425556,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[81]搜索旋转排序数组 II","frequency":72.50372383538675,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5297537475172509,"acs":0,"articleLive":2,"columnArticles":1652,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":81.06781942338786,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.53880989277936,"acs":0,"articleLive":2,"columnArticles":1896,"formTitle":"[83]删除排序链表中的重复元素","frequency":71.63606014632028,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43298270576079406,"acs":0,"articleLive":2,"columnArticles":1129,"formTitle":"[84]柱状图中最大的矩形","frequency":76.83588621406673,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5158187513501836,"acs":0,"articleLive":2,"columnArticles":671,"formTitle":"[85]最大矩形","frequency":61.278879696624436,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6322521969831506,"acs":0,"articleLive":2,"columnArticles":1078,"formTitle":"[86]分隔链表","frequency":57.40221474827965,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4881313370605515,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[87]扰乱字符串","frequency":68.23046316409282,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5159305662249261,"acs":0,"articleLive":2,"columnArticles":3156,"formTitle":"[88]合并两个有序数组","frequency":97.31846443136135,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7097638359073121,"acs":0,"articleLive":2,"columnArticles":466,"formTitle":"[89]格雷编码","frequency":44.475628174278235,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6335829300359551,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[90]子集 II","frequency":72.31470865475474,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3058845698810886,"acs":0,"articleLive":2,"columnArticles":1486,"formTitle":"[91]解码方法","frequency":71.25894955862486,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5478115535494722,"acs":0,"articleLive":2,"columnArticles":1986,"formTitle":"[92]反转链表 II","frequency":88.30173654032744,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5387369144262236,"acs":0,"articleLive":2,"columnArticles":1296,"formTitle":"[93]复原 IP 地址","frequency":83.4220385893372,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559933936652836,"acs":0,"articleLive":2,"columnArticles":2242,"formTitle":"[94]二叉树的中序遍历","frequency":63.16803930431979,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.700651254360123,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[95]不同的二叉搜索树 II","frequency":61.56384225169311,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6991205724032519,"acs":0,"articleLive":2,"columnArticles":1251,"formTitle":"[96]不同的二叉搜索树","frequency":67.0742279831335,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45721810497948184,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[97]交错字符串","frequency":45.79071316982024,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34914808066522485,"acs":0,"articleLive":2,"columnArticles":1882,"formTitle":"[98]验证二叉搜索树","frequency":75.02459546686822,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6126291943933173,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[99]恢复二叉搜索树","frequency":58.19490905042552,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6034729406639969,"acs":0,"articleLive":2,"columnArticles":1848,"formTitle":"[100]相同的树","frequency":57.2033233012875,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5621016200666904,"acs":0,"articleLive":2,"columnArticles":2204,"formTitle":"[101]对称二叉树","frequency":75.43758053992892,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6419793111015791,"acs":0,"articleLive":2,"columnArticles":2441,"formTitle":"[102]二叉树的层序遍历","frequency":88.02058832500097,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716123657593561,"acs":0,"articleLive":2,"columnArticles":1549,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":81.37562375430069,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661420121773542,"acs":0,"articleLive":2,"columnArticles":2494,"formTitle":"[104]二叉树的最大深度","frequency":77.96732803676385,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7040484135381181,"acs":0,"articleLive":2,"columnArticles":1394,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":84.3730566165973,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7213838956195509,"acs":0,"articleLive":2,"columnArticles":859,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":73.55226688725125,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.695862027095006,"acs":0,"articleLive":2,"columnArticles":1283,"formTitle":"[107]二叉树的层序遍历 II","frequency":63.54355616189983,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7601177515296751,"acs":0,"articleLive":2,"columnArticles":1163,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":52.739360790393285,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7634263587698469,"acs":0,"articleLive":2,"columnArticles":709,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.61884932896053,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5630586723922633,"acs":0,"articleLive":2,"columnArticles":1427,"formTitle":"[110]平衡二叉树","frequency":62.24461704246536,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48489392710172646,"acs":0,"articleLive":2,"columnArticles":1745,"formTitle":"[111]二叉树的最小深度","frequency":45.94825021973207,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5256845513226787,"acs":0,"articleLive":2,"columnArticles":1627,"formTitle":"[112]路径总和","frequency":61.989828987234304,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6266063916528968,"acs":0,"articleLive":2,"columnArticles":1218,"formTitle":"[113]路径总和 II","frequency":64.05269952983858,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7255195498776292,"acs":0,"articleLive":2,"columnArticles":1290,"formTitle":"[114]二叉树展开为链表","frequency":45.79071316982024,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5229799657354638,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[115]不同的子序列","frequency":63.6780964741693,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7028825038291904,"acs":0,"articleLive":2,"columnArticles":1145,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":46.83786685122897,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6114740409646839,"acs":0,"articleLive":2,"columnArticles":733,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":28.268325494170988,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7275928743944492,"acs":0,"articleLive":2,"columnArticles":1692,"formTitle":"[118]杨辉三角","frequency":75.23544758598116,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6644326928111419,"acs":0,"articleLive":2,"columnArticles":1182,"formTitle":"[119]杨辉三角 II","frequency":57.46616224942513,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6796790817521667,"acs":0,"articleLive":2,"columnArticles":1540,"formTitle":"[120]三角形最小路径和","frequency":52.739360790393285,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.573392958480878,"acs":0,"articleLive":2,"columnArticles":3310,"formTitle":"[121]买卖股票的最佳时机","frequency":88.63061408282232,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6881837722395939,"acs":0,"articleLive":2,"columnArticles":2587,"formTitle":"[122]买卖股票的最佳时机 II","frequency":67.90223543000293,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5348397131972518,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[123]买卖股票的最佳时机 III","frequency":65.60940458949982,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44367846403889205,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[124]二叉树中的最大路径和","frequency":85.3429481452568,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47363897697300184,"acs":0,"articleLive":2,"columnArticles":1804,"formTitle":"[125]验证回文串","frequency":68.36714971506007,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39401677035434135,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[126]单词接龙 II","frequency":35.3127571390813,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46745036512349597,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[127]单词接龙","frequency":51.36999789495283,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432874102059453,"acs":0,"articleLive":2,"columnArticles":1072,"formTitle":"[128]最长连续序列","frequency":80.747959580549,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6809408051612005,"acs":0,"articleLive":2,"columnArticles":1093,"formTitle":"[129]求根节点到叶节点数字之和","frequency":62.52339850553006,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4435396250721083,"acs":0,"articleLive":2,"columnArticles":1148,"formTitle":"[130]被围绕的区域","frequency":53.98844414879454,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.72314244361757,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[131]分割回文串","frequency":75.62577092373456,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4921539936424643,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[132]分割回文串 II","frequency":45.79071316982024,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6753163118418062,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[133]克隆图","frequency":16.342026351333764,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5766023406139872,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[134]加油站","frequency":75.0681098488801,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48638024302611926,"acs":0,"articleLive":2,"columnArticles":769,"formTitle":"[135]分发糖果","frequency":86.54773458721591,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7195097939067703,"acs":0,"articleLive":2,"columnArticles":2210,"formTitle":"[136]只出现一次的数字","frequency":77.66802381898191,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7196544433914122,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[137]只出现一次的数字 II","frequency":74.49529309986298,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6598618259822279,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[138]复制带随机指针的链表","frequency":70.06413705655982,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5134821735247648,"acs":0,"articleLive":2,"columnArticles":1172,"formTitle":"[139]单词拆分","frequency":77.64998983541477,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48547440374470613,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[140]单词拆分 II","frequency":36.92371046062444,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5123694195205991,"acs":0,"articleLive":2,"columnArticles":2666,"formTitle":"[141]环形链表","frequency":77.7678040074898,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.551918787795176,"acs":0,"articleLive":2,"columnArticles":1675,"formTitle":"[142]环形链表 II","frequency":72.54416349854125,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6184658391026511,"acs":0,"articleLive":2,"columnArticles":1057,"formTitle":"[143]重排链表","frequency":90.97461780693041,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7027613076311257,"acs":0,"articleLive":2,"columnArticles":1793,"formTitle":"[144]二叉树的前序遍历","frequency":50.357783103369336,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7495289578465469,"acs":0,"articleLive":2,"columnArticles":1512,"formTitle":"[145]二叉树的后序遍历","frequency":71.1669030274154,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5266612244138531,"acs":0,"articleLive":2,"columnArticles":1352,"formTitle":"[146]LRU 缓存机制","frequency":91.37985346956357,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6808767176445316,"acs":0,"articleLive":2,"columnArticles":776,"formTitle":"[147]对链表进行插入排序","frequency":46.74034940150884,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6669332631079293,"acs":0,"articleLive":2,"columnArticles":1219,"formTitle":"[148]排序链表","frequency":77.1688962868558,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33808678938419456,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[149]直线上最多的点数","frequency":66.88572414086065,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362873588847872,"acs":0,"articleLive":2,"columnArticles":1023,"formTitle":"[150]逆波兰表达式求值","frequency":69.42223729657904,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4810397794867748,"acs":0,"articleLive":2,"columnArticles":1395,"formTitle":"[151]翻转字符串里的单词","frequency":55.22489335860783,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4206902901825239,"acs":0,"articleLive":2,"columnArticles":1200,"formTitle":"[152]乘积最大子数组","frequency":76.69869255633603,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5661784507158363,"acs":0,"articleLive":2,"columnArticles":1451,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":56.28433036418967,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319146901300689,"acs":0,"articleLive":2,"columnArticles":882,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":65.14989944447338,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5731736653904648,"acs":0,"articleLive":2,"columnArticles":1568,"formTitle":"[155]最小栈","frequency":72.35817458173517,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7238883143743536,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[156]上下翻转二叉树","frequency":24.602213602553157,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5309859154929577,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5911699779249449,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.482152669761118,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5439283916888346,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":39.70164884207949,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6127725628651924,"acs":0,"articleLive":2,"columnArticles":1922,"formTitle":"[160]相交链表","frequency":68.62011973781549,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33654416799817394,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":5.880903715586605,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4946689729833378,"acs":0,"articleLive":2,"columnArticles":719,"formTitle":"[162]寻找峰值","frequency":60.43885942198446,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3240186538390923,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[163]缺失的区间","frequency":17.61219123288114,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106441402729159,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[164]最大间距","frequency":59.0472269564352,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5184305291587477,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[165]比较版本号","frequency":56.62040826119586,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29858084829678977,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[166]分数到小数","frequency":52.65617524037881,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5864803467967155,"acs":0,"articleLive":2,"columnArticles":1847,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":65.44931298971203,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43254400670578375,"acs":0,"articleLive":2,"columnArticles":741,"formTitle":"[168]Excel表列名称","frequency":59.37873271460321,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.66475613846181,"acs":0,"articleLive":2,"columnArticles":2136,"formTitle":"[169]多数元素","frequency":69.75957920368407,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4167001003009027,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":4.7534500031620315,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7175489929232444,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[171]Excel 表列序号","frequency":49.72626914792858,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43835987433647494,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[172]阶乘后的零","frequency":45.386900835872545,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8035479274752286,"acs":0,"articleLive":2,"columnArticles":615,"formTitle":"[173]二叉搜索树迭代器","frequency":49.72626914792858,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.47957016758347193,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[174]地下城游戏","frequency":63.96288577104379,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7398826534546097,"acs":0,"articleLive":2,"columnArticles":1443,"formTitle":"[175]组合两个表","frequency":93.63394438671958,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3560979551084775,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[176]第二高的薪水","frequency":91.65288604729089,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46249653002683444,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[177]第N高的薪水","frequency":76.69869255633603,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6028996197560621,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[178]分数排名","frequency":68.69894248045817,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4098261333185617,"acs":0,"articleLive":2,"columnArticles":945,"formTitle":"[179]最大数","frequency":83.22142215222567,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48709608953288935,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[180]连续出现的数字","frequency":68.5640016581416,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7027954576573632,"acs":0,"articleLive":2,"columnArticles":656,"formTitle":"[181]超过经理收入的员工","frequency":69.52766621222332,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7975062974566401,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[182]查找重复的电子邮箱","frequency":61.36106945669272,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.67736356826442,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[183]从不订购的客户","frequency":46.74034940150884,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47500678710402605,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[184]部门工资最高的员工","frequency":74.27640889868242,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4941192540511007,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[185]部门工资前三高的所有员工","frequency":75.20407467170244,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7540765049738488,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[186]翻转字符串里的单词 II","frequency":5.880903715586605,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4835294389606787,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[187]重复的DNA序列","frequency":31.458443017503292,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39019176443811726,"acs":0,"articleLive":2,"columnArticles":675,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":53.103858186445876,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4521310702757211,"acs":0,"articleLive":2,"columnArticles":1639,"formTitle":"[189]旋转数组","frequency":63.94181014995786,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6966210776022782,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[190]颠倒二进制位","frequency":49.99447939811127,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.747914334212142,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[191]位1的个数","frequency":60.43885942198446,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3558764607679466,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[192]统计词频","frequency":56.985138237023314,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32424640906332186,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[193]有效电话号码","frequency":36.92371046062444,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34503302240076256,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":23.951595310336085,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4361593335328744,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":53.33148846736433,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6651586443908954,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[196]删除重复的电子邮箱","frequency":58.08391748671503,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339070708009855,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[197]上升的温度","frequency":57.53787205241439,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5133061304780808,"acs":0,"articleLive":2,"columnArticles":2597,"formTitle":"[198]打家劫舍","frequency":81.69333592273813,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6522369816561321,"acs":0,"articleLive":2,"columnArticles":1549,"formTitle":"[199]二叉树的右视图","frequency":84.52585775117171,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5536708148333438,"acs":0,"articleLive":2,"columnArticles":2072,"formTitle":"[200]岛屿数量","frequency":90.11206941766534,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5230024733842349,"acs":0,"articleLive":2,"columnArticles":317,"formTitle":"[201]数字范围按位与","frequency":37.58143493562092,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6183547384580822,"acs":0,"articleLive":2,"columnArticles":1348,"formTitle":"[202]快乐数","frequency":63.16803930431979,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5143821513696579,"acs":0,"articleLive":2,"columnArticles":1613,"formTitle":"[203]移除链表元素","frequency":55.22489335860783,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37876669222231124,"acs":0,"articleLive":2,"columnArticles":723,"formTitle":"[204]计数质数","frequency":53.103858186445876,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5008734075467801,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[205]同构字符串","frequency":51.00987756419432,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7227902116354836,"acs":0,"articleLive":2,"columnArticles":7260,"formTitle":"[206]反转链表","frequency":90.99205523277648,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5446369402631828,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[207]课程表","frequency":73.00953970746882,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7163843140472137,"acs":0,"articleLive":2,"columnArticles":940,"formTitle":"[208]实现 Trie (前缀树)","frequency":70.68706534420068,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4704601777528016,"acs":0,"articleLive":2,"columnArticles":1323,"formTitle":"[209]长度最小的子数组","frequency":54.63157507891411,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5416747196019875,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[210]课程表 II","frequency":49.02157160070437,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48164351969612185,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":31.604133113411436,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4496567756650657,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[212]单词搜索 II","frequency":41.372493009105014,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329007735070446,"acs":0,"articleLive":2,"columnArticles":1481,"formTitle":"[213]打家劫舍 II","frequency":73.23234028933547,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3710175709596447,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[214]最短回文串","frequency":58.463786465802684,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646833490042531,"acs":0,"articleLive":2,"columnArticles":2239,"formTitle":"[215]数组中的第K个最大元素","frequency":89.93636660123657,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7382320052693657,"acs":0,"articleLive":2,"columnArticles":995,"formTitle":"[216]组合总和 III","frequency":66.50358243498066,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5604809906819267,"acs":0,"articleLive":2,"columnArticles":1627,"formTitle":"[217]存在重复元素","frequency":76.80968412004651,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5427967966206108,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[218]天际线问题","frequency":64.69265029610953,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4250949793540225,"acs":0,"articleLive":2,"columnArticles":863,"formTitle":"[219]存在重复元素 II","frequency":47.94343534792997,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28672954753766755,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":63.54355616189983,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4745173501134201,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[221]最大正方形","frequency":74.49529309986298,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7803482929515418,"acs":0,"articleLive":2,"columnArticles":863,"formTitle":"[222]完全二叉树的节点个数","frequency":41.372493009105014,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4618131551664555,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[223]矩形面积","frequency":44.08204068457754,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41789774784560796,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[224]基本计算器","frequency":73.0760739372378,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.675477615611676,"acs":0,"articleLive":2,"columnArticles":4733,"formTitle":"[225]用队列实现栈","frequency":46.920757984678424,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.787562615449314,"acs":0,"articleLive":2,"columnArticles":1821,"formTitle":"[226]翻转二叉树","frequency":76.16905767799389,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4369088452343831,"acs":0,"articleLive":2,"columnArticles":693,"formTitle":"[227]基本计算器 II","frequency":71.34975303146909,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5814386067004739,"acs":0,"articleLive":2,"columnArticles":629,"formTitle":"[228]汇总区间","frequency":16.342026351333764,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.463433888522214,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[229]求众数 II","frequency":40.024497229838104,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7406305474293109,"acs":0,"articleLive":2,"columnArticles":836,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":41.45992980914596,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5036253776435046,"acs":0,"articleLive":2,"columnArticles":1182,"formTitle":"[231]2 的幂","frequency":44.22282640139149,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6914217988282123,"acs":0,"articleLive":2,"columnArticles":1236,"formTitle":"[232]用栈实现队列","frequency":57.74463433097357,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47644444444444445,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[233]数字 1 的个数","frequency":39.92707593225423,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49433475257581877,"acs":0,"articleLive":2,"columnArticles":1935,"formTitle":"[234]回文链表","frequency":79.0148964490172,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6661382396976757,"acs":0,"articleLive":2,"columnArticles":949,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":55.71828240801202,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6801961407195628,"acs":0,"articleLive":2,"columnArticles":1346,"formTitle":"[236]二叉树的最近公共祖先","frequency":74.63996325707069,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481507661908718,"acs":0,"articleLive":2,"columnArticles":1005,"formTitle":"[237]删除链表中的节点","frequency":52.931507601015426,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7227814774663156,"acs":0,"articleLive":2,"columnArticles":845,"formTitle":"[238]除自身以外数组的乘积","frequency":55.10382261127017,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.496308812957751,"acs":0,"articleLive":2,"columnArticles":1287,"formTitle":"[239]滑动窗口最大值","frequency":66.88572414086065,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47555273839569207,"acs":0,"articleLive":2,"columnArticles":729,"formTitle":"[240]搜索二维矩阵 II","frequency":62.973540269616954,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7372699939867708,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[241]为运算表达式设计优先级","frequency":56.985138237023314,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6443623342114566,"acs":0,"articleLive":2,"columnArticles":1626,"formTitle":"[242]有效的字母异位词","frequency":58.58523390457117,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6557954371459195,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5476923076923077,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6075691411935954,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4747535362194599,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5224222245343877,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46332737030411447,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.638322387371817,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6331482022800351,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[250]统计同值子树","frequency":5.305271024461289,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5432213930348259,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":16.342026351333764,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5616077953714982,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[252]会议室","frequency":5.880903715586605,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.498581226792924,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[253]会议室 II","frequency":54.859574696851865,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5678730448681356,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[254]因子的组合","frequency":17.61219123288114,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47259953161592505,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6350249207068419,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[256]粉刷房子","frequency":6.482152669761118,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6811608431428375,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[257]二叉树的所有路径","frequency":63.43210979679439,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6918858271250337,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[258]各位相加","frequency":47.94343534792997,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5652928058148179,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":4.7534500031620315,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253125178377762,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[260]只出现一次的数字 III","frequency":51.00987756419432,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4954310448479019,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[261]以图判树","frequency":23.951595310336085,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4371784678701712,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[262]行程和用户","frequency":62.61222941479897,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515183112795132,"acs":0,"articleLive":2,"columnArticles":826,"formTitle":"[263]丑数","frequency":57.61884932896053,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.579191128506197,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[264]丑数 II","frequency":65.60940458949982,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5831973898858075,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[265]粉刷房子 II","frequency":5.305271024461289,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6716169903416762,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44635654745899433,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":5.880903715586605,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6238487680185966,"acs":0,"articleLive":2,"columnArticles":1071,"formTitle":"[268]丢失的数字","frequency":30.886868973535446,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.338620841595065,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5519211707772141,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.964770586115876,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5518654302350657,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6455990694067468,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":7.7697809816036845,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3092073123698352,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[273]整数转换英文表示","frequency":30.196392590007427,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.440372164244936,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[274]H 指数","frequency":57.61884932896053,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4626195732155997,"acs":0,"articleLive":2,"columnArticles":413,"formTitle":"[275]H 指数 II","frequency":33.938192048265044,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4869546772254826,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[276]栅栏涂色","frequency":25.277715518506767,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5691781366854961,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[277]搜寻名人","frequency":5.880903715586605,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4547402790776823,"acs":0,"articleLive":2,"columnArticles":982,"formTitle":"[278]第一个错误的版本","frequency":69.83529858160124,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.631051091719794,"acs":0,"articleLive":2,"columnArticles":1170,"formTitle":"[279]完全平方数","frequency":74.3982917360336,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6869005552751136,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.964770586115876,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7575,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3882011393514461,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6388729084132433,"acs":0,"articleLive":2,"columnArticles":3254,"formTitle":"[283]移动零","frequency":76.47494055705654,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7337576821773486,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[284]顶端迭代器","frequency":16.964770586115876,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6350400785211844,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5072240590606458,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[286]墙与门","frequency":5.880903715586605,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6614872573686637,"acs":0,"articleLive":2,"columnArticles":1200,"formTitle":"[287]寻找重复数","frequency":62.24461704246536,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4281901372648704,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7532886679634032,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[289]生命游戏","frequency":16.342026351333764,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45709295864094623,"acs":0,"articleLive":2,"columnArticles":1069,"formTitle":"[290]单词规律","frequency":28.888686901970388,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5334491746307559,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6961737449542328,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[292]Nim 游戏","frequency":40.024497229838104,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7110153114315445,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":5.305271024461289,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5853862912686442,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5232997323594887,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[295]数据流的中位数","frequency":39.97247820278098,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6217847769028871,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":18.988552069728925,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5586836192250781,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[297]二叉树的序列化与反序列化","frequency":58.72103104454365,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5782112624217888,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5038955748306825,"acs":0,"articleLive":2,"columnArticles":353,"formTitle":"[299]猜数字游戏","frequency":23.32421688025942,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5129175470032895,"acs":0,"articleLive":2,"columnArticles":1936,"formTitle":"[300]最长递增子序列","frequency":79.97377528539025,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5219542667389983,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[301]删除无效的括号","frequency":52.38134854650668,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6644917582417582,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.724824561901142,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":48.63755006325966,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.542840551146462,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":39.384102023544834,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3786318499448327,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":5.880903715586605,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33727774245811204,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[306]累加数","frequency":39.70164884207949,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5429585963609358,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[307]区域和检索 - 数组可修改","frequency":20.48835658403759,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.605771924908938,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6059715528388386,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":71.73102016844436,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37985809028025386,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[310]最小高度树","frequency":46.30736548493709,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7618835081455032,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":16.964770586115876,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6827996465595559,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[312]戳气球","frequency":52.65617524037881,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6414378959493184,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[313]超级丑数","frequency":57.61884932896053,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5435002529084472,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41849154571048064,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":55.60694690701775,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4765912791749593,"acs":0,"articleLive":2,"columnArticles":516,"formTitle":"[316]去除重复字母","frequency":57.46616224942513,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4846008054963279,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6836569579288025,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[318]最大单词长度乘积","frequency":5.305271024461289,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5172224005870751,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[319]灯泡开关","frequency":16.964770586115876,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6742229492872166,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4254812751971245,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[321]拼接最大数","frequency":31.604133113411436,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44380439037610286,"acs":0,"articleLive":2,"columnArticles":1780,"formTitle":"[322]零钱兑换","frequency":81.82985427016675,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6307484496837968,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[323]无向图中连通分量的数目","frequency":34.6129730750139,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3782017014647259,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":39.70164884207949,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5386932892249527,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":34.6129730750139,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4895984717379359,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[326]3的幂","frequency":30.196392590007427,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4229651921303947,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[327]区间和的个数","frequency":40.463508395446425,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6564529463454709,"acs":0,"articleLive":2,"columnArticles":1045,"formTitle":"[328]奇偶链表","frequency":62.547820762468746,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48370371028029086,"acs":0,"articleLive":2,"columnArticles":480,"formTitle":"[329]矩阵中的最长递增路径","frequency":54.859574696851865,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5339469348332481,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[330]按要求补齐数组","frequency":33.28676940277036,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47999482485364037,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[331]验证二叉树的前序序列化","frequency":30.886868973535446,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4489579694958668,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[332]重新安排行程","frequency":49.35672323164898,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4680872966851966,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[333]最大 BST 子树","frequency":18.286109221180304,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.412843097091356,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[334]递增的三元子序列","frequency":23.951595310336085,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36780288522915866,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4011627906976744,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[336]回文对","frequency":36.039368418060455,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6084255698227431,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[337]打家劫舍 III","frequency":70.68706534420068,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869935883173884,"acs":0,"articleLive":2,"columnArticles":1342,"formTitle":"[338]比特位计数","frequency":59.0472269564352,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8079484902309059,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49380084395527907,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":30.886868973535446,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7269914255556037,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":70.68706534420068,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5155566270869749,"acs":0,"articleLive":2,"columnArticles":758,"formTitle":"[342]4的幂","frequency":46.623958387052,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6049947959026976,"acs":0,"articleLive":2,"columnArticles":1019,"formTitle":"[343]整数拆分","frequency":68.5640016581416,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.76641979362912,"acs":0,"articleLive":2,"columnArticles":1868,"formTitle":"[344]反转字符串","frequency":65.38855263758552,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5391336426023063,"acs":0,"articleLive":2,"columnArticles":1020,"formTitle":"[345]反转字符串中的元音字母","frequency":29.345084569315095,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7062066512537791,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6219149879640188,"acs":0,"articleLive":2,"columnArticles":1447,"formTitle":"[347]前 K 个高频元素","frequency":78.07896032374717,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6000766381402478,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7385696086064123,"acs":0,"articleLive":2,"columnArticles":1464,"formTitle":"[349]两个数组的交集","frequency":65.27874067178955,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5496879258809652,"acs":0,"articleLive":2,"columnArticles":1338,"formTitle":"[350]两个数组的交集 II","frequency":65.60940458949982,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5893075469600978,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":12.338880588903073,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5919548147127703,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4223804679552391,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":8.460936643878826,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4517123650222316,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[354]俄罗斯套娃信封问题","frequency":71.41953512248517,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4069445980316267,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[355]设计推特","frequency":35.3127571390813,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35098265895953756,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5197798196577352,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.727087191450074,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3507764477515367,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.725050916496945,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6078301260783012,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":7.111028644942187,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5611972207375735,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6924428822495606,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":5.880903715586605,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4906350688066488,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":56.28433036418967,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7201462225832657,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36444161852245693,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[365]水壶问题","frequency":45.995757191003214,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7631578947368421,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4394304863519787,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[367]有效的完全平方数","frequency":16.964770586115876,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4591277913136777,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[368]最大整除子集","frequency":69.19628097932656,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6163865546218488,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7190635451505016,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":16.964770586115876,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5800958127471679,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[371]两整数之和","frequency":49.224020960298624,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5093357137543703,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":7.111028644942187,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4225092650787803,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[373]查找和最小的K对数字","frequency":42.82082310063188,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5146889728459332,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[374]猜数字大小","frequency":33.938192048265044,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46902480640504,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":34.6129730750139,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4627729528141856,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[376]摆动序列","frequency":32.04818490852892,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5071014056306618,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[377]组合总和 Ⅳ","frequency":63.25819495570904,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6388268475195227,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":56.985138237023314,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6437887534744494,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5020359891014701,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":29.530880035468677,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44216536265595263,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6290660854546202,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.602213602553157,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5972678252666044,"acs":0,"articleLive":2,"columnArticles":717,"formTitle":"[383]赎金信","frequency":2.754003363458894,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5769928059215464,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[384]打乱数组","frequency":52.002795311524885,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4151106500691563,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.305271024461289,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7474405091311566,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[386]字典序排数","frequency":56.940621210274045,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5318045852529423,"acs":0,"articleLive":2,"columnArticles":1160,"formTitle":"[387]字符串中的第一个唯一字符","frequency":61.91761142786066,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5254176072234763,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":5.305271024461289,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6921191236622402,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[389]找不同","frequency":23.32421688025942,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46664406779661016,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":39.70164884207949,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35748830571632445,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5148117166880598,"acs":0,"articleLive":2,"columnArticles":1546,"formTitle":"[392]判断子序列","frequency":55.03227831897187,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3917025862068966,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":33.938192048265044,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5516507321739212,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[394]字符串解码","frequency":86.29944918681325,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5203701995510869,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.985138237023314,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42570862909845963,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37771444424827866,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[397]整数替换","frequency":23.32421688025942,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6549811197613165,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[398]随机数索引","frequency":38.2625397231158,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.59244355661584,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[399]除法求值","frequency":23.951595310336085,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41428698119900675,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":44.796266531662305,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.614044814044814,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[401]二进制手表","frequency":47.272734184261985,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.327667340100932,"acs":0,"articleLive":2,"columnArticles":577,"formTitle":"[402]移掉 K 位数字","frequency":68.5640016581416,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4561605394383542,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[403]青蛙过河","frequency":70.68706534420068,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5822020664939602,"acs":0,"articleLive":2,"columnArticles":1096,"formTitle":"[404]左叶子之和","frequency":54.43416451247048,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5221963303111599,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[405]数字转换为十六进制数","frequency":47.94343534792997,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7363333058997069,"acs":0,"articleLive":2,"columnArticles":776,"formTitle":"[406]根据身高重建队列","frequency":58.72103104454365,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.484259846747035,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":48.63755006325966,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3240547216416492,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5560239210073025,"acs":0,"articleLive":2,"columnArticles":1292,"formTitle":"[409]最长回文串","frequency":65.27874067178955,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5627696702843595,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[410]分割数组的最大值","frequency":74.87889530036796,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49743589743589745,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6734928176073626,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[412]Fizz Buzz","frequency":24.602213602553157,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6870580726231912,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[413]等差数列划分","frequency":54.3166378117824,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3643252360035916,"acs":0,"articleLive":2,"columnArticles":825,"formTitle":"[414]第三大的数","frequency":23.951595310336085,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5370919770570477,"acs":0,"articleLive":2,"columnArticles":1050,"formTitle":"[415]字符串相加","frequency":88.57814247383658,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5067777707254708,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[416]分割等和子集","frequency":75.34878455739938,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4783511483460927,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[417]太平洋大西洋水流问题","frequency":57.71101545377022,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3594636410520887,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7554195358326957,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[419]甲板上的战舰","frequency":4.7534500031620315,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20688333588839491,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[420]强密码检验器","frequency":20.48835658403759,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223480028110695,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":59.57628574703566,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42702104097452936,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5689320388349515,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5305801087572697,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[424]替换后的最长重复字符","frequency":64.69265029610953,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6109510086455331,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6680161943319838,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.530880035468677,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.613345521023766,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6495507060333762,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6983487320621191,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[429]N 叉树的层序遍历","frequency":33.28676940277036,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.542182369285173,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[430]扁平化多级双向链表","frequency":30.886868973535446,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7285587975243147,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37772199194348766,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":28.268325494170988,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5327060776920682,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":4.7534500031620315,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37393764922036965,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[434]字符串中的单词数","frequency":24.602213602553157,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5090839707321929,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[435]无重叠区间","frequency":61.62480293033097,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4858948577994829,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":4.7534500031620315,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668446717343028,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[437]路径总和 III","frequency":48.52017061939692,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5175080128205128,"acs":0,"articleLive":2,"columnArticles":774,"formTitle":"[438]找到字符串中所有字母异位词","frequency":47.42551348922385,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5896001657344107,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3799239724400095,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":69.24771045259132,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4256822364223161,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[441]排列硬币","frequency":15.742317076136757,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6971714635032878,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[442]数组中重复的数据","frequency":63.96288577104379,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4770510762432465,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[443]压缩字符串","frequency":42.75556800103742,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2503227766385661,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.988552069728925,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5880593530690555,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[445]两数相加 II","frequency":70.68706534420068,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5517381110885988,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":45.122210233165,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6045184781673787,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6479298823301535,"acs":0,"articleLive":2,"columnArticles":1047,"formTitle":"[448]找到所有数组中消失的数字","frequency":61.56384225169311,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5559157816284703,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48553311216562384,"acs":0,"articleLive":2,"columnArticles":594,"formTitle":"[450]删除二叉搜索树中的节点","frequency":45.995757191003214,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7113954525189479,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[451]根据字符出现频率排序","frequency":61.91761142786066,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093640297167116,"acs":0,"articleLive":2,"columnArticles":824,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.224020960298624,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5544606025251052,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.32421688025942,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6009077582760431,"acs":0,"articleLive":2,"columnArticles":474,"formTitle":"[454]四数相加 II","frequency":58.3205029342508,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5773869405745646,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[455]分发饼干","frequency":58.08391748671503,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625461254612546,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[456]132 模式","frequency":73.47558476265958,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43522814564449225,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":51.68390331154002,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6087719298245614,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":17.61219123288114,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115705151469162,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[459]重复的子字符串","frequency":54.0302231983097,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43938624395199016,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[460]LFU 缓存","frequency":61.88349189701954,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8120162793648315,"acs":0,"articleLive":2,"columnArticles":1328,"formTitle":"[461]汉明距离","frequency":57.40221474827965,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.602510460251046,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.2625397231158,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.714260187527626,"acs":0,"articleLive":2,"columnArticles":906,"formTitle":"[463]岛屿的周长","frequency":35.3127571390813,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3582716212642158,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":37.58143493562092,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.531667237247518,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3735637764184225,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":7.111028644942187,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.440964853253274,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.61219123288114,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24981507141889708,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[468]验证IP地址","frequency":51.68390331154002,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4336471302763438,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":25.979924332141945,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5462527859080046,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":45.271195580316196,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6157684630738522,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":15.164157979236952,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4025014212620807,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42056830193371886,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[473]火柴拼正方形","frequency":37.58143493562092,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6107079248298017,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[474]一和零","frequency":63.43210979679439,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33028854080791425,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":29.530880035468677,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.701178863319649,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[476]数字的补数","frequency":5.305271024461289,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.603969842958143,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":47.94343534792997,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4377216916780355,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.196392590007427,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41432545201668985,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":10.7188188657084,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44823771625234304,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":42.82082310063188,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5359509445158738,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.305271024461289,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42614968440036066,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[482]密钥格式化","frequency":15.164157979236952,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5900575534010584,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":34.6129730750139,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6404545454545455,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6065927840526856,"acs":0,"articleLive":2,"columnArticles":974,"formTitle":"[485]最大连续 1 的个数","frequency":50.357783103369336,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5870140601396976,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[486]预测赢家","frequency":45.53736445686645,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5766337059329321,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[487]最大连续1的个数 II","frequency":36.92371046062444,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.387030010348396,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7173308619091752,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48154449293586804,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[490]迷宫","frequency":17.61219123288114,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.547324214062875,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[491]递增子序列","frequency":51.00987756419432,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5513134750136971,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[492]构造矩形","frequency":5.880903715586605,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3445088991430455,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":36.794837723885436,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49556099146410304,"acs":0,"articleLive":2,"columnArticles":1009,"formTitle":"[494]目标和","frequency":75.68518427900547,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5422265254505216,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[495]提莫攻击","frequency":30.196392590007427,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.687443076345484,"acs":0,"articleLive":2,"columnArticles":1013,"formTitle":"[496]下一个更大元素 I","frequency":43.84961624160956,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4048291443095171,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4638172747596445,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[498]对角线遍历","frequency":52.28021915249599,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3705452984113353,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7087100591715977,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[500]键盘行","frequency":16.342026351333764,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5118379537079409,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[501]二叉搜索树中的众数","frequency":46.623958387052,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44069001762141774,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[502]IPO","frequency":29.75004872864654,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6346314325452017,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[503]下一个更大元素 II","frequency":47.94343534792997,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.504562660538056,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[504]七进制数","frequency":23.951595310336085,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4826826473957874,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":17.61219123288114,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.564515689321447,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[506]相对名次","frequency":4.7534500031620315,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41093499656672006,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[507]完美数","frequency":16.964770586115876,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6758083549681378,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.61219123288114,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6762673217287056,"acs":0,"articleLive":2,"columnArticles":1420,"formTitle":"[509]斐波那契数","frequency":63.84374258528263,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6082217973231357,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":7.111028644942187,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7339098553381421,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[511]游戏玩法分析 I","frequency":38.2625397231158,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5382303736290972,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[512]游戏玩法分析 II","frequency":5.305271024461289,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.73064226821217,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[513]找树左下角的值","frequency":4.7534500031620315,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5011786648706059,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[514]自由之路","frequency":50.592458864783474,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6439271078559595,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[515]在每个树行中找最大值","frequency":30.196392590007427,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6525723004805613,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[516]最长回文子序列","frequency":56.835574101014195,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4400330851943755,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6533752240753526,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[518]零钱兑换 II","frequency":70.14503601352364,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3947965512025412,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":20.48835658403759,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5634501038756358,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[520]检测大写字母","frequency":5.305271024461289,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7126469499871908,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.342026351333764,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3598741660790801,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.342026351333764,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27438540519530996,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[523]连续的子数组和","frequency":57.61884932896053,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4724176936357683,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":32.350215569193246,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5365667482492064,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[525]连续数组","frequency":68.69894248045817,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7348969917548471,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[526]优美的排列","frequency":35.67258764521989,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5770365997638724,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4767105487059697,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[528]按权重随机选择","frequency":24.482118931551536,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6460676949584984,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":33.938192048265044,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6207690872665039,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":5.305271024461289,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.661068429515812,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3732383875100557,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.964770586115876,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5222405271828665,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6754360035471475,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[534]游戏玩法分析 III","frequency":16.342026351333764,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8414065886432597,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[535]TinyURL 的加密与解密","frequency":23.951595310336085,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5345889170590366,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":9.952248600050137,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7124713462610743,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":4.223815124819899,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6975854351664075,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":37.016297621528906,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5960120424102273,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[539]最小时间差","frequency":33.938192048265044,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5803648591316918,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[540]有序数组中的单一元素","frequency":47.272734184261985,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6083186958666101,"acs":0,"articleLive":2,"columnArticles":781,"formTitle":"[541]反转字符串 II","frequency":28.73160478394646,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45867590389939206,"acs":0,"articleLive":2,"columnArticles":617,"formTitle":"[542]01 矩阵","frequency":45.122210233165,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5503564213014143,"acs":0,"articleLive":2,"columnArticles":1207,"formTitle":"[543]二叉树的直径","frequency":73.77032583611555,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.70825456836799,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41699801192842945,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6307178489896,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.979924332141945,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6183778495254867,"acs":0,"articleLive":2,"columnArticles":1105,"formTitle":"[547]省份数量","frequency":48.475208232125055,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3563636363636364,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":11.57231032324481,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.483451536643026,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43858630574404006,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":30.196392590007427,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5673254102116624,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[551]学生出勤记录 I","frequency":20.8850254064923,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5787794661991038,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.818705565574575,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.602510460251046,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":5.305271024461289,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.501868343327665,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[554]砖墙","frequency":61.88349189701954,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3422208281053952,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3257828114590273,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":47.94343534792997,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7456332670277177,"acs":0,"articleLive":2,"columnArticles":1247,"formTitle":"[557]反转字符串中的单词 III","frequency":60.70649073655298,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5036021788789317,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7275622254758419,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[559]N 叉树的最大深度","frequency":32.65721719716918,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4466794538120906,"acs":0,"articleLive":2,"columnArticles":889,"formTitle":"[560]和为 K 的子数组","frequency":82.3815897619363,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.774165916421198,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[561]数组拆分 I","frequency":15.164157979236952,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.462453531598513,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6050602961379942,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[563]二叉树的坡度","frequency":4.7534500031620315,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17924021330246787,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[564]寻找最近的回文数","frequency":25.277715518506767,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6115811160303336,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[565]数组嵌套","frequency":16.342026351333764,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6940640716791344,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[566]重塑矩阵","frequency":29.530880035468677,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4308576196709766,"acs":0,"articleLive":2,"columnArticles":1026,"formTitle":"[567]字符串的排列","frequency":56.90142242048116,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.503968253968254,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5636713118692936,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":30.196392590007427,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6629621598178467,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[570]至少有5名直接下属的经理","frequency":16.342026351333764,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4881032800420326,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":5.880903715586605,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4738170641923081,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[572]另一棵树的子树","frequency":49.72626914792858,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6605141727092947,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6480449919657204,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6847144326817775,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[575]分糖果","frequency":29.530880035468677,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4697869820295005,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":25.450688417306594,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7057458781715865,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[577]员工奖金","frequency":24.602213602553157,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49750354759026644,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[578]查询回答率最高的问题","frequency":5.305271024461289,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41261755485893414,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":26.71086994244475,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5244551792281934,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[580]统计各专业学生人数","frequency":16.342026351333764,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40437610782248085,"acs":0,"articleLive":2,"columnArticles":840,"formTitle":"[581]最短无序连续子数组","frequency":61.88349189701954,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40488962734393547,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5865627243819879,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[583]两个字符串的删除操作","frequency":45.79071316982024,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.774286895411327,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5948763777182008,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7490790899241604,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[586]订单最多的客户","frequency":24.602213602553157,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3821892393320965,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":9.187347576852503,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4267399267399267,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":9.187347576852503,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451847011075188,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[589]N 叉树的前序遍历","frequency":44.08204068457754,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7601343396413479,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[590]N 叉树的后序遍历","frequency":15.742317076136757,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3402465270984152,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.521348045094747,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4410960402537738,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[593]有效的正方形","frequency":24.602213602553157,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.516949616149091,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[594]最长和谐子序列","frequency":5.305271024461289,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7964836413566705,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[595]大的国家","frequency":40.024497229838104,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4207516079306862,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[596]超过5名学生的课","frequency":23.32421688025942,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4411500449236298,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.342026351333764,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5174776793068231,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[598]范围求和 II","frequency":16.342026351333764,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220491301037934,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[599]两个列表的最小索引总和","frequency":16.342026351333764,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.49872558728509503,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[601]体育馆的人流量","frequency":52.65617524037881,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6278692513585854,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.61219123288114,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6714285714285714,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[603]连续空余座位","frequency":25.277715518506767,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37215954234864135,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":5.880903715586605,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33458469760264953,"acs":0,"articleLive":2,"columnArticles":1240,"formTitle":"[605]种花问题","frequency":54.18315399439425,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5684073266640859,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[606]根据二叉树创建字符串","frequency":4.7534500031620315,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6638173369284608,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.305271024461289,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6576714801444044,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[608]树节点","frequency":5.305271024461289,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48405224787363305,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.66711140760507,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[610]判断三角形","frequency":5.880903715586605,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319448964095889,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[611]有效三角形的个数","frequency":77.71963588972615,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6680879287473943,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[612]平面上的最近距离","frequency":5.880903715586605,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8169858207864348,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":4.7534500031620315,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3463649752309546,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[614]二级关注者","frequency":16.964770586115876,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4246081636074093,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4598432184588079,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":34.6129730750139,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881163139694208,"acs":0,"articleLive":2,"columnArticles":1196,"formTitle":"[617]合并二叉树","frequency":63.87058545317088,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6195149306042338,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":16.964770586115876,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46580097711493956,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.880903715586605,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7729055258467024,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[620]有趣的电影","frequency":40.68679818649756,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5696370081213263,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[621]任务调度器","frequency":63.6780964741693,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4365492393915132,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[622]设计循环队列","frequency":47.94343534792997,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5453575782202357,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4164544564152791,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3406380027739251,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6830072952000372,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[626]换座位","frequency":42.727087191450074,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8075642935928943,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[627]变更性别","frequency":28.888686901970388,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5252279959704589,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[628]三个数的最大乘积","frequency":33.28676940277036,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4038985961014039,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":25.277715518506767,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36765855124737,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":6.482152669761118,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.284705243140451,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5969628039598885,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[632]最小区间","frequency":16.964770586115876,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39908842375790193,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[633]平方数之和","frequency":63.96288577104379,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44014430960970813,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5562808239048448,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.549789297465797,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":5.305271024461289,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6893963771270656,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[637]二叉树的层平均值","frequency":21.567320836015487,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5927257348276591,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":5.305271024461289,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3095273594751752,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[639]解码方法 II","frequency":29.530880035468677,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42407895788380084,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[640]求解方程","frequency":23.32421688025942,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5328240387063916,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[641]设计循环双端队列","frequency":15.164157979236952,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48933946488294316,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":8.460936643878826,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4515479450070262,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[643]子数组最大平均数 I","frequency":38.2625397231158,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.39855595667870036,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43528364792447233,"acs":0,"articleLive":2,"columnArticles":688,"formTitle":"[645]错误的集合","frequency":42.727087191450074,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5754860388831107,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[646]最长数对链","frequency":3.714897135977991,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.656416480848867,"acs":0,"articleLive":2,"columnArticles":889,"formTitle":"[647]回文子串","frequency":58.90678830538909,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5828008444757213,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[648]单词替换","frequency":5.880903715586605,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48163217662458935,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":4.7534500031620315,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5357896678210619,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[650]只有两个键的键盘","frequency":16.964770586115876,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.580327347846814,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.571096382012597,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[652]寻找重复的子树","frequency":54.18315399439425,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5960209709679375,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8098557692307692,"acs":0,"articleLive":2,"columnArticles":584,"formTitle":"[654]最大二叉树","frequency":45.122210233165,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5960956123961085,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.964770586115876,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30754716981132074,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834507211885882,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":5.305271024461289,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4537327091619443,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[658]找到 K 个最接近的元素","frequency":30.886868973535446,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5418145347940133,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[659]分割数组为连续子序列","frequency":4.7534500031620315,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6496565260058881,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":16.342026351333764,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5604160187968625,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[661]图片平滑器","frequency":5.305271024461289,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4071396697902722,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[662]二叉树最大宽度","frequency":52.89476650898569,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.462059620596206,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6552903071017274,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":54.859574696851865,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27026284256928335,"acs":0,"articleLive":2,"columnArticles":925,"formTitle":"[665]非递减数列","frequency":50.592458864783474,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6185535550808666,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242376237623762,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":15.742317076136757,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5079001602931074,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[668]乘法表中第k小的数","frequency":34.6129730750139,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6665269814663136,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[669]修剪二叉搜索树","frequency":23.32421688025942,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44974492970013685,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[670]最大交换","frequency":62.61222941479897,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48650893252620697,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[671]二叉树中第二小的节点","frequency":47.94343534792997,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5502008032128514,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[672]灯泡开关 Ⅱ","frequency":4.7534500031620315,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3917524375194934,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[673]最长递增子序列的个数","frequency":54.63157507891411,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49325367930981223,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[674]最长连续递增序列","frequency":35.076609036562516,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.39957416607523066,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":6.482152669761118,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5881840362495643,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6163414841952799,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.35218081628840947,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[678]有效的括号字符串","frequency":72.12740416675975,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5414304358058236,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[679]24 点游戏","frequency":70.68706534420068,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015927730892666,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":47.3327796873807,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5001000200040008,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6955972322818265,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":30.196392590007427,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43113530953821333,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658810402149656,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[684]冗余连接","frequency":28.888686901970388,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4321225382932166,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":30.196392590007427,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35514662879104353,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[686]重复叠加字符串匹配","frequency":4.7534500031620315,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44055399570582543,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[687]最长同值路径","frequency":51.68390331154002,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5114176045800534,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.964770586115876,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48503359804520463,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.794837723885436,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6469249360583804,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[690]员工的重要性","frequency":65.85544007885126,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4902238594502692,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":5.880903715586605,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.578980007162135,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[692]前K个高频单词","frequency":63.80761856759679,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097496957694052,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":5.305271024461289,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5307262569832403,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":5.880903715586605,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6632968511026022,"acs":0,"articleLive":2,"columnArticles":1222,"formTitle":"[695]岛屿的最大面积","frequency":66.98237856169015,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.631133462664805,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[696]计数二进制子串","frequency":23.951595310336085,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6056547207232139,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[697]数组的度","frequency":24.602213602553157,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4449001314883226,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[698]划分为k个相等的子集","frequency":57.61884932896053,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4759725400457666,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7592324827074134,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[700]二叉搜索树中的搜索","frequency":23.32421688025942,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7239769566944776,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[701]二叉搜索树中的插入操作","frequency":30.886868973535446,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7403914590747331,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5126572395245944,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[703]数据流中的第 K 大元素","frequency":33.28676940277036,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5598589068268341,"acs":0,"articleLive":2,"columnArticles":1320,"formTitle":"[704]二分查找","frequency":69.39080309197676,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6460493704768514,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[705]设计哈希集合","frequency":46.48262515564488,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6445504748261282,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[706]设计哈希映射","frequency":33.28676940277036,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3194576213369719,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[707]设计链表","frequency":60.76144099880775,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33514550687559963,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[708]循环有序列表的插入","frequency":6.482152669761118,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7593790987826954,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[709]转换成小写字母","frequency":5.305271024461289,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3501659721731761,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[710]黑名单中的随机数","frequency":25.277715518506767,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5721352019785655,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6717865429234339,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":34.6129730750139,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4080501371533069,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[713]乘积小于K的子数组","frequency":35.67258764521989,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7191249223492078,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":45.995757191003214,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40123859191655803,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":7.111028644942187,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46015767131594904,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[716]最大栈","frequency":18.286109221180304,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5111787121992706,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[717]1比特与2比特字符","frequency":16.964770586115876,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645198466191251,"acs":0,"articleLive":2,"columnArticles":569,"formTitle":"[718]最长重复子数组","frequency":69.34060773456103,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3683622135271101,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[719]找出第 k 小的距离对","frequency":16.964770586115876,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48588087061788177,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[720]词典中最长的单词","frequency":5.880903715586605,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46914109519019903,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[721]账户合并","frequency":37.58143493562092,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32253167898627244,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":38.968669594144814,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7214244686961516,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.45903684433004216,"acs":0,"articleLive":2,"columnArticles":840,"formTitle":"[724]寻找数组的中心下标","frequency":34.6129730750139,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5627183457652724,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[725]分隔链表","frequency":16.342026351333764,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5540387970850867,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":53.103858186445876,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4090909090909091,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[727]最小窗口子序列","frequency":31.604133113411436,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7594612367066507,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[728]自除数","frequency":5.305271024461289,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5098257565832569,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[729]我的日程安排表 I","frequency":25.277715518506767,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48928073068628697,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":39.70164884207949,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5100105374077977,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[731]我的日程安排表 II","frequency":5.305271024461289,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6109234234234234,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":18.286109221180304,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804582465442151,"acs":0,"articleLive":2,"columnArticles":518,"formTitle":"[733]图像渲染","frequency":45.995757191003214,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47853658536585364,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41136402201052047,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[735]行星碰撞","frequency":33.28676940277036,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45982545892266025,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46144400785854617,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5023123620996995,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[738]单调递增的数字","frequency":29.530880035468677,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6786892748297921,"acs":0,"articleLive":2,"columnArticles":1472,"formTitle":"[739]每日温度","frequency":85.87265780274791,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.629679233023484,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[740]删除并获得点数","frequency":63.907810595582234,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3658490566037736,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":24.602213602553157,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4922416639154837,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5187680914251344,"acs":0,"articleLive":2,"columnArticles":514,"formTitle":"[743]网络延迟时间","frequency":50.357783103369336,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45905293759408,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":25.979924332141945,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3923512747875354,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5833693106140633,"acs":0,"articleLive":2,"columnArticles":1233,"formTitle":"[746]使用最小花费爬楼梯","frequency":49.85098615079606,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4154182735093444,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.305271024461289,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5996254497067666,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5052467936261174,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7215759849906191,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":22.13336879219314,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5047410649161196,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5306346161374936,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[752]打开转盘锁","frequency":42.82082310063188,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5898887002452368,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":5.880903715586605,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42906460627979615,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5019685039370079,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5694180296690757,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[756]金字塔转换矩阵","frequency":7.7697809816036845,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4163165266106443,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":9.952248600050137,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45924744049993355,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":11.57231032324481,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.658284023668639,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":6.482152669761118,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8393782383419689,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5889623455015809,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":10.7188188657084,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6987547892720306,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7633213024411069,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[763]划分字母区间","frequency":67.2610609663242,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4947304663840097,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6657700067249496,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[765]情侣牵手","frequency":56.28433036418967,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080630695038411,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47793333979265573,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[767]重构字符串","frequency":36.794837723885436,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.4995840266222962,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[768]最多能完成排序的块 II","frequency":25.277715518506767,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5875321082789963,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5527065527065527,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8515704410038692,"acs":0,"articleLive":2,"columnArticles":1104,"formTitle":"[771]宝石与石头","frequency":42.727087191450074,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4906978701910935,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[772]基本计算器 III","frequency":18.988552069728925,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7136944954413915,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[773]滑动谜题","frequency":52.06132358581696,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5872125630959057,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":13.300651393426497,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46116774791473586,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[775]全局倒置与局部倒置","frequency":7.111028644942187,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5688700748941713,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32361601884570085,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.964770586115876,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5958284038886889,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[778]水位上升的泳池中游泳","frequency":6.482152669761118,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43587113618350504,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[779]第K个语法符号","frequency":34.6129730750139,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28458246061378745,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[780]到达终点","frequency":18.988552069728925,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6198149937062732,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[781]森林中的兔子","frequency":90.92282183748178,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4245676803816339,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":33.938192048265044,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958084091518997,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[783]二叉搜索树节点最小距离","frequency":33.938192048265044,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6851436155396438,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[784]字母大小写全排列","frequency":28.888686901970388,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5118279011158887,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[785]判断二分图","frequency":42.727087191450074,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4680004547004661,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39247603544944837,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[787]K 站中转内最便宜的航班","frequency":32.568986180268986,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6072472432576059,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[788]旋转数字","frequency":17.61219123288114,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923563486250749,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[789]逃脱阻碍者","frequency":21.408955258908303,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44847260192559135,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[790]多米诺和托米诺平铺","frequency":6.482152669761118,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6952380952380952,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[791]自定义字符串排序","frequency":34.6129730750139,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4512221269296741,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[792]匹配子序列的单词数","frequency":14.606201654946489,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3946130131429499,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.305271024461289,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3403912652171854,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[794]有效的井字游戏","frequency":5.880903715586605,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5354592720970537,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":19.721786318379326,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5265634416577812,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[796]旋转字符串","frequency":42.82082310063188,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7948633519920975,"acs":0,"articleLive":2,"columnArticles":512,"formTitle":"[797]所有可能的路径","frequency":24.844879793020507,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4538352272727273,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.406847773669828,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":52.06132358581696,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7050575863795694,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4179113323850166,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765703246619277,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[802]找到最终的安全状态","frequency":47.19959107817731,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4828969846251639,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7703357732990561,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[804]唯一摩尔斯密码词","frequency":23.951595310336085,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.28982376350198974,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[805]数组的均值分割","frequency":8.460936643878826,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6575184386132156,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[806]写字符串需要的行数","frequency":16.964770586115876,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8441917479526369,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[807]保持城市天际线","frequency":4.7534500031620315,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4796875,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":30.886868973535446,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.418941602615072,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[809]情感丰富的文字","frequency":16.964770586115876,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7360619766244234,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":41.372493009105014,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7038573773481671,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[811]子域名访问计数","frequency":16.342026351333764,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6300698882981901,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5480133801093253,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":5.305271024461289,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000814230239258,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[814]二叉树剪枝","frequency":4.223815124819899,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43481932898353925,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[815]公交路线","frequency":74.49529309986298,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5096916299559472,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":7.7697809816036845,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914160039098947,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":5.880903715586605,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43042424242424243,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4211164807191297,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[819]最常见的单词","frequency":16.342026351333764,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5066519262479389,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[820]单词的压缩编码","frequency":38.968669594144814,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6934988959307161,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[821]字符的最短距离","frequency":35.3127571390813,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5026225357207451,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.430788139499155,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":18.988552069728925,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6148515220388241,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[824]山羊拉丁文","frequency":5.305271024461289,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39135757130615745,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[825]适龄的朋友","frequency":5.305271024461289,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37212809813483483,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":16.964770586115876,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3914661824784385,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[827]最大人工岛","frequency":30.196392590007427,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49162545860583823,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3622067881011663,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[829]连续整数求和","frequency":29.530880035468677,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431247697731937,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4041974349008939,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955779928013836,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[832]翻转图像","frequency":49.224020960298624,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42592592592592593,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.305271024461289,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292521350466917,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":25.277715518506767,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5733242134062928,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4779571901699764,"acs":0,"articleLive":2,"columnArticles":649,"formTitle":"[836]矩形重叠","frequency":18.286109221180304,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39650169770552524,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[837]新21点","frequency":17.61219123288114,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5006876583423815,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[838]推多米诺","frequency":33.28676940277036,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748177399756986,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35893606716176946,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6569230024681798,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[841]钥匙和房间","frequency":25.979924332141945,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48934057895286864,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":43.39286252656413,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3776223776223776,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":6.482152669761118,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5146869781467376,"acs":0,"articleLive":2,"columnArticles":954,"formTitle":"[844]比较含退格的字符串","frequency":28.268325494170988,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42062430576020676,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[845]数组中的最长山脉","frequency":38.968669594144814,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5110373944511459,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6840367925228099,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":56.985138237023314,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4477207686017989,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42602765675317295,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4479048697621744,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":16.342026351333764,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47853608010127746,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[851]喧闹和富有","frequency":5.305271024461289,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7150392817059483,"acs":0,"articleLive":2,"columnArticles":713,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.76144099880775,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3829359712508211,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[853]车队","frequency":36.039368418060455,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36078827690752907,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.407313769751693,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[855]考场就座","frequency":16.964770586115876,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6259434515662273,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[856]括号的分数","frequency":44.08204068457754,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46554993678887485,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":26.71086994244475,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5555334394904459,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[858]镜面反射","frequency":30.886868973535446,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3016374320487708,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5872654803124245,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[860]柠檬水找零","frequency":28.888686901970388,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8091923086876633,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[861]翻转矩阵后的得分","frequency":4.223815124819899,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1898064453925326,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[862]和至少为 K 的最短子数组","frequency":51.31344809669288,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6037620297462817,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":58.463786465802684,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4532263044149429,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6551852958756724,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22411700449083627,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.988552069728925,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6704510635552904,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[867]转置矩阵","frequency":41.372493009105014,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6250340241863359,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5515135653842799,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.880903715586605,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42682234897124255,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[870]优势洗牌","frequency":5.305271024461289,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3406429477138808,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":40.463508395446425,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520972359812321,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":54.9514996535394,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5088874259381172,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":42.82082310063188,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.414429771415662,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[874]模拟行走机器人","frequency":37.58143493562092,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47840309021691807,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.995757191003214,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7062976700709023,"acs":0,"articleLive":2,"columnArticles":1574,"formTitle":"[876]链表的中间结点","frequency":44.31724673111212,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567079814764369,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[877]石子游戏","frequency":62.24461704246536,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28039444660698065,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5555497477981339,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":63.6780964741693,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2523344470144779,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[880]索引处的解码字符串","frequency":7.111028644942187,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5381084206468795,"acs":0,"articleLive":2,"columnArticles":565,"formTitle":"[881]救生艇","frequency":42.97696559145573,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4859948021946289,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.687270146461062,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6612578878025103,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[884]两句话中的不常见单词","frequency":5.880903715586605,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6892742059229707,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[885]螺旋矩阵 III","frequency":35.3127571390813,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4224031960663798,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[886]可能的二分法","frequency":5.305271024461289,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29172657699443416,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[887]鸡蛋掉落","frequency":63.80761856759679,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6397386397386398,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[888]公平的糖果棒交换","frequency":5.305271024461289,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6777473780209758,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":40.68679818649756,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7261296001341269,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3296845574387947,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387023313262313,"acs":0,"articleLive":2,"columnArticles":680,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7239858906525574,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[893]特殊等价字符串组","frequency":7.7697809816036845,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7744265847932094,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.543701171875,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[895]最大频率栈","frequency":25.277715518506767,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5870226495257662,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[896]单调数列","frequency":17.61219123288114,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7451930080116533,"acs":0,"articleLive":2,"columnArticles":698,"formTitle":"[897]递增顺序搜索树","frequency":56.28433036418967,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3357515591192567,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.979924332141945,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5389260863857162,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[899]有序队列","frequency":5.880903715586605,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.493111279333838,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5429830569037906,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3276522791448165,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.482152669761118,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5316176470588235,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":13.300651393426497,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45337862428727405,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[904]水果成篮","frequency":38.2625397231158,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7012934419791871,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[905]按奇偶排序数组","frequency":23.951595310336085,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27417064670194913,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[906]超级回文数","frequency":32.350215569193246,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3161483114773123,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[907]子数组的最小值之和","frequency":35.3127571390813,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986724297622723,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[908]最小差值 I","frequency":5.305271024461289,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4596615393396307,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":40.463508395446425,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31788893807486107,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4257816352697505,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5636520925515983,"acs":0,"articleLive":2,"columnArticles":1013,"formTitle":"[912]排序数组","frequency":83.99649461329088,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4054699370523117,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.187347576852503,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888036074066967,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[914]卡牌分组","frequency":16.342026351333764,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4675862068965517,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[915]分割数组","frequency":16.342026351333764,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44063027574563873,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5696945734901651,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[917]仅仅反转字母","frequency":24.602213602553157,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3579418344519016,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[918]环形子数组的最大和","frequency":36.039368418060455,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6281265326140265,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4810092961487384,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7357436378054935,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[921]使括号有效的最少添加","frequency":5.880903715586605,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7142445097866408,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[922]按奇偶排序数组 II","frequency":25.277715518506767,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3377340772247694,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.61219123288114,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3592513874129177,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3880079324960143,"acs":0,"articleLive":2,"columnArticles":669,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5186443419881905,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.61219123288114,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3386823482507724,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[927]三等分","frequency":37.58143493562092,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4203291384317522,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6430938663131597,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5450875931494313,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[930]和相同的二元子数组","frequency":54.75402435530934,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6598282276852464,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[931]下降路径最小和","frequency":23.32421688025942,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6281247581456544,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[932]漂亮数组","frequency":5.305271024461289,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7242778755564758,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[933]最近的请求次数","frequency":34.6129730750139,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47503919989829213,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[934]最短的桥","frequency":41.372493009105014,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4747983065740075,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":6.482152669761118,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37752305008721654,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5889434019523545,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.964770586115876,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8184905209630906,"acs":0,"articleLive":2,"columnArticles":785,"formTitle":"[938]二叉搜索树的范围和","frequency":47.94343534792997,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4504528039010798,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41941344406955616,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[940]不同的子序列 II","frequency":4.223815124819899,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39233890291045015,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[941]有效的山脉数组","frequency":5.305271024461289,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7294419246696904,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47443331576172904,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":12.338880588903073,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6898209112457203,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4863968607077225,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":24.602213602553157,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6224364716420725,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[946]验证栈序列","frequency":50.592458864783474,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6126378851274249,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39137296159915835,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3694518746883076,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":38.2625397231158,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7744427456345055,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.61219123288114,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6635243376463339,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":25.277715518506767,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3494331601322626,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5531441749371989,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[953]验证外星语词典","frequency":23.951595310336085,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2997131931166348,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":30.196392590007427,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3282099539941447,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":8.460936643878826,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4359766185066726,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":24.602213602553157,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3600321735294881,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[957]N 天后的牢房","frequency":25.277715518506767,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5367944694592259,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":28.268325494170988,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437940896091516,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.277715518506767,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5532341156267888,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6770667316670729,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[961]重复 N 次的元素","frequency":16.964770586115876,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4414785092491839,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[962]最大宽度坡","frequency":17.61219123288114,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5009081735620585,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4260265700483092,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[964]表示数字的最少运算符","frequency":14.067221659084762,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840425307037014,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[965]单值二叉树","frequency":5.880903715586605,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40276472956650117,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":7.7697809816036845,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4613916256157635,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4974855805743139,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[968]监控二叉树","frequency":39.384102023544834,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6529816413267318,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[969]煎饼排序","frequency":4.7534500031620315,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4145609301972109,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4418142033021683,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":6.482152669761118,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4099641810485184,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":14.067221659084762,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6393905956598331,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[973]最接近原点的 K 个点","frequency":4.7534500031620315,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4659671160130719,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[974]和可被 K 整除的子数组","frequency":53.33148846736433,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44570502431118314,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":6.482152669761118,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971087649716623,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[976]三角形的最大周长","frequency":24.602213602553157,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7147735220306908,"acs":0,"articleLive":2,"columnArticles":1232,"formTitle":"[977]有序数组的平方","frequency":50.681176362480265,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.473419317729304,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[978]最长湍流子数组","frequency":5.305271024461289,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122909843130495,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[979]在二叉树中分配硬币","frequency":25.979924332141945,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7332703015022587,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[980]不同路径 III","frequency":30.886868973535446,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5332707339356411,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[981]基于时间的键值存储","frequency":55.4410835528625,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5437980241492865,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6338352278362991,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[983]最低票价","frequency":46.48262515564488,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41662357199943584,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5995532390171259,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[985]查询后的偶数和","frequency":5.305271024461289,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6772988505747126,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[986]区间列表的交集","frequency":43.84961624160956,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5323224261771747,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[987]二叉树的垂序遍历","frequency":54.0302231983097,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49761983837041956,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[988]从叶结点开始的最小字符串","frequency":4.7534500031620315,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4722171599358507,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[989]数组形式的整数加法","frequency":17.61219123288114,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5015227804900445,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[990]等式方程的可满足性","frequency":5.305271024461289,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5172559941874546,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[991]坏了的计算器","frequency":16.964770586115876,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45169409486931267,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":17.61219123288114,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570514381878169,"acs":0,"articleLive":2,"columnArticles":793,"formTitle":"[993]二叉树的堂兄弟节点","frequency":52.38134854650668,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093313667649951,"acs":0,"articleLive":2,"columnArticles":1361,"formTitle":"[994]腐烂的橘子","frequency":33.28676940277036,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398703075130452,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":5.880903715586605,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4951798730308018,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":18.286109221180304,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5114464634021147,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[997]找到小镇的法官","frequency":15.164157979236952,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6146385198467683,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6908816604567171,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.305271024461289,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4079102715466352,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":35.3127571390813,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29238607415793944,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":9.952248600050137,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7374970372126096,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[1002]查找常用字符","frequency":39.384102023544834,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5761742223931542,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5976683843145854,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[1004]最大连续1的个数 III","frequency":52.65617524037881,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5344429542006552,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.567320836015487,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6276825866681847,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[1006]笨阶乘","frequency":51.31344809669288,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4643044030799133,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7264730218177068,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.68679818649756,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5929207024175132,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.305271024461289,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4506721461639393,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":5.880903715586605,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6271747081835819,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":71.32935632847772,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3308195630475768,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":18.988552069728925,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39773826543278573,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":33.938192048265044,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5481163321788841,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[1014]最佳观光组合","frequency":15.742317076136757,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3540151402701499,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":17.61219123288114,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.583019943019943,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5619954794962867,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5166124933514568,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5975690674387742,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.305271024461289,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5369340271547342,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1020]飞地的数量","frequency":25.277715518506767,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.783599120153973,"acs":0,"articleLive":2,"columnArticles":647,"formTitle":"[1021]删除最外层的括号","frequency":25.277715518506767,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7033227559543349,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.305271024461289,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5655825442568958,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5581498021769031,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[1024]视频拼接","frequency":16.342026351333764,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095427776401304,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[1025]除数博弈","frequency":39.384102023544834,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6688682490540075,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43343215200107804,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1027]最长等差数列","frequency":36.039368418060455,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7314993623610858,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[1028]从先序遍历还原二叉树","frequency":23.951595310336085,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.654610492845787,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1029]两地调度","frequency":4.7534500031620315,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.71140251661247,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5663399474061678,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":5.880903715586605,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39572021718300865,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39004238810259356,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.482152669761118,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4325483935342247,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6308145384038486,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1035]不相交的线","frequency":59.37873271460321,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.299121895949391,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43785020545386627,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7929681217229066,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":3.225363773674486,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5547971179370497,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5215899919289749,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4820844538120503,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":30.196392590007427,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5286633241888185,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1042]不邻接植花","frequency":16.964770586115876,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6916498068787934,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2095143631022775,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":56.985138237023314,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6434975799412839,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1045]买下所有产品的客户","frequency":5.880903715586605,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595751165838641,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[1046]最后一块石头的重量","frequency":28.268325494170988,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7254860284532109,"acs":0,"articleLive":2,"columnArticles":961,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":58.58523390457117,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45238913716053625,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":39.70164884207949,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6436671783465431,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[1049]最后一块石头的重量 II","frequency":61.05812720334316,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7574316290130797,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.305271024461289,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7529160948833562,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1051]高度检查器","frequency":5.880903715586605,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812193326790972,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[1052]爱生气的书店老板","frequency":25.979924332141945,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45819659321769024,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1053]交换一次的先前排列","frequency":17.61219123288114,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37644620131122253,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.964770586115876,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5830468130124306,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4081379481453914,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4647315855181024,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.33924843423799583,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35994050570153696,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5282947208507406,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":16.964770586115876,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6009863259358889,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5384117742196345,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6508638562543193,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5387931034482759,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4737841043890866,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42105263157894735,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8638222464558343,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.82,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1069]产品销售分析 II","frequency":5.305271024461289,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4837603519668737,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1070]产品销售分析 III","frequency":5.305271024461289,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5863722462074026,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1071]字符串的最大公因子","frequency":17.61219123288114,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5789285714285715,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":8.460936643878826,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3359773371104816,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6694902877172484,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":46.48262515564488,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6940925049610747,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4955864448051948,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7216825237856785,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6216639654240951,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7336139506915214,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[1079]活字印刷","frequency":5.305271024461289,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48990738541914036,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5712160205887084,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1081]不同字符的最小子序列","frequency":42.08322652910345,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7597815567537675,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":5.305271024461289,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5276712040784148,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.61219123288114,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5375565117925813,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7723823975720789,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6888397178813442,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5322095123419627,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44478662560492743,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854293955277114,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[1089]复写零","frequency":4.7534500031620315,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5428812843261512,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3780079108234448,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":43.39286252656413,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4873417721518987,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":19.721786318379326,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38134878819810325,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1093]大样本统计","frequency":7.7697809816036845,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6126625401852118,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1094]拼车","frequency":22.71859125636899,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37250139748260375,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5537162162162163,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5172751558325913,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1097]游戏玩法分析 V","frequency":36.794837723885436,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.471336293903916,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1098]小众书籍","frequency":16.964770586115876,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.579298418972332,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":5.880903715586605,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7013613159387407,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6682954872089681,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3676352192051526,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367040520984081,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[1103]分糖果 II","frequency":16.342026351333764,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610093217614915,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[1104]二叉树寻路","frequency":45.122210233165,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5566421272387649,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5732572700709615,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1106]解析布尔表达式","frequency":18.988552069728925,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4104661732242566,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1107]每日新用户统计","frequency":5.305271024461289,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8391966146655719,"acs":0,"articleLive":2,"columnArticles":676,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5753920629317735,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1109]航班预订统计","frequency":27.668445533082647,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6285465622280244,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1110]删点成林","frequency":24.602213602553157,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.771812512055552,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":25.277715518506767,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6433109777620897,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":17.61219123288114,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5405583463723956,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6530016037449612,"acs":0,"articleLive":2,"columnArticles":570,"formTitle":"[1114]按序打印","frequency":79.78146671467546,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.561866316184754,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1115]交替打印FooBar","frequency":49.224020960298624,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5168012809946547,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1116]打印零与奇偶数","frequency":61.489580762955676,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.520475235303194,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1117]H2O 生成","frequency":45.79071316982024,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6413928671721426,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662882371491643,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6072191878413679,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1120]子树的最大平均值","frequency":8.460936643878826,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5740245857830037,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068731293005379,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[1122]数组的相对排序","frequency":52.38134854650668,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7045434178689847,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3167326632145395,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1124]表现良好的最长时间段","frequency":6.482152669761118,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4895162621759947,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6937229437229437,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1126]查询活跃业务","frequency":16.964770586115876,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4141547973942807,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5445765669831691,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":15.742317076136757,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37947151938177737,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1129]颜色交替的最短路径","frequency":7.7697809816036845,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6283813263525305,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4537205081669691,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3886255924170616,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1132]报告的记录 II","frequency":16.964770586115876,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6443287299071768,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7750062359690696,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5344751478767547,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":25.979924332141945,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5675617150281507,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6067609461927209,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[1137]第 N 个泰波那契数","frequency":33.938192048265044,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43199254319925434,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":5.880903715586605,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4760840178849953,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.286109221180304,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6528436018957346,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.482152669761118,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5108573867577229,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":17.61219123288114,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3711812342920972,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6339246326133323,"acs":0,"articleLive":2,"columnArticles":1066,"formTitle":"[1143]最长公共子序列","frequency":84.52585775117171,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4418261511087966,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.602213602553157,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4691864650827934,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":20.48835658403759,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2861058401855366,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5620905724864711,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1147]段式回文","frequency":36.794837723885436,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7181922855497985,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44195342370524854,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6064938535542491,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.286109221180304,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48279648609077597,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":18.286109221180304,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38513513513513514,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1152]用户网站访问行为分析","frequency":15.164157979236952,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3710215891386601,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.567103811741635,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1154]一年中的第几天","frequency":4.7534500031620315,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47991174508697215,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1155]掷骰子的N种方法","frequency":5.880903715586605,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4340284019413985,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3160754234579738,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5494170780380212,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4881259329624101,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1159]市场分析 II","frequency":18.286109221180304,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6872255442399328,"acs":0,"articleLive":2,"columnArticles":903,"formTitle":"[1160]拼写单词","frequency":16.342026351333764,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6329424765178955,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1161]最大层内元素和","frequency":17.61219123288114,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46923871256702787,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[1162]地图分析","frequency":17.61219123288114,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26709992625368734,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1163]按字典序排在最后的子串","frequency":8.460936643878826,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6097231600270088,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1164]指定日期的产品价格","frequency":17.61219123288114,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8388795518207283,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48782329620539927,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4264705882352941,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1167]连接棒材的最低费用","frequency":9.952248600050137,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.570581696924787,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":10.7188188657084,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3223742061553493,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":18.286109221180304,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6169079486479104,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.482152669761118,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47270689333084254,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":24.602213602553157,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2692393486504573,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.75627625280844,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6178580919479139,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48897976157471584,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.44689187758127713,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26355336158315495,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1177]构建回文串检测","frequency":6.482152669761118,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46200289406716233,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6347207598255152,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1179]重新格式化部门表","frequency":51.00987756419432,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7745122878135292,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1180]统计只含单一字母的子串","frequency":9.952248600050137,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37031408308004055,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3872749590834697,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6024667931688804,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5858761598857959,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":4.7534500031620315,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6101629169899146,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1185]一周中的第几天","frequency":16.964770586115876,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3923442392830148,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":30.196392590007427,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4408471275559883,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6926615553121577,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":21.291132933343892,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6443938963131457,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1189]“气球” 的最大数量","frequency":5.305271024461289,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6511596748742072,"acs":0,"articleLive":2,"columnArticles":604,"formTitle":"[1190]反转每对括号间的子串","frequency":94.50912144232964,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2675954077233743,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5003068614213821,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6066735230259399,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":5.880903715586605,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5119769557307459,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.482152669761118,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6343534994068802,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1195]交替打印字符串","frequency":30.196392590007427,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6903107113654947,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3686691164722799,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.286109221180304,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7475785728404823,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43393939393939396,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6865759672853099,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[1200]最小绝对差","frequency":23.951595310336085,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24708056792405275,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032020402380277,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":6.482152669761118,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.623167383308294,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":7.111028644942187,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7274200081004455,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":6.482152669761118,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46174410029498525,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1205]每月交易II","frequency":25.979924332141945,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6192484662576687,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":18.988552069728925,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303611432510277,"acs":0,"articleLive":2,"columnArticles":822,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4966084804063394,"acs":0,"articleLive":2,"columnArticles":601,"formTitle":"[1208]尽可能使字符串相等","frequency":16.964770586115876,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5319158561411446,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":34.6129730750139,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4502500431108812,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":12.338880588903073,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6554370204005241,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1211]查询结果的质量和占比","frequency":17.61219123288114,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5124072110286321,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1212]查询球队积分","frequency":5.305271024461289,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7727211885959042,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":18.286109221180304,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6344707923655292,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":18.286109221180304,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40919786096256683,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5334088335220838,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6955067852736835,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":34.6129730750139,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42110172565683784,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.631025792267682,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.6129730750139,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5269086357947435,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843906604642801,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[1221]分割平衡字符串","frequency":17.466097224411982,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6723533535872868,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47288378766140604,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3257399985938269,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1224]最大相等频率","frequency":29.100255065408508,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5420110192837465,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1225]报告系统状态的连续日期","frequency":18.286109221180304,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5999373923931758,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1226]哲学家进餐","frequency":51.31344809669288,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6628259551243177,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1227]飞机座位分配概率","frequency":4.223815124819899,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5391459074733096,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4147300679299249,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.48982035928143713,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5586098566660122,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":18.988552069728925,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4692420743229057,"acs":0,"articleLive":2,"columnArticles":417,"formTitle":"[1232]缀点成线","frequency":15.742317076136757,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48296867230233714,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.482152669761118,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34227035984848486,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1234]替换子串得到平衡字符串","frequency":24.602213602553157,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45392678347934917,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1235]规划兼职工作","frequency":39.70164884207949,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.56047197640118,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106971493084956,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6579520697167756,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":4.7534500031620315,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4906678852442629,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[1239]串联字符串的最大长度","frequency":42.08322652910345,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4962211614956245,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":27.472821306110042,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5948997469340082,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4701086956521739,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":14.067221659084762,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5395516074450084,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6190476190476191,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.187347576852503,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5083124908047668,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.482152669761118,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4803580308304326,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":9.952248600050137,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6167778836987607,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1247]交换字符使得字符串相同","frequency":24.602213602553157,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5589119424930566,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1248]统计「优美子数组」","frequency":16.964770586115876,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.572636617471081,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[1249]移除无效的括号","frequency":36.92371046062444,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5624866936342346,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":8.460936643878826,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7705424810530515,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497897039030955,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3937218360956236,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":18.988552069728925,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5978643162845884,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.7534500031620315,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6780141843971631,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6647577092511013,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5646279949558638,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5574151557415156,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47542997542997545,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":14.067221659084762,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6040171451355661,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7278010670731707,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5252798468644667,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1262]可被三整除的最大和","frequency":41.372493009105014,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41588980102963685,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":7.7697809816036845,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5698529411764706,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1264]页面推荐","frequency":6.482152669761118,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9197898423817863,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":7.7697809816036845,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8239430747421964,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[1266]访问所有点的最小时间","frequency":17.61219123288114,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6079481584341732,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5825154763702249,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1268]搜索推荐系统","frequency":5.880903715586605,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49166244753303173,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.94343534792997,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8050788335426259,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":5.305271024461289,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5056556346878928,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5188243064729194,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5442368699330279,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5992438563327032,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5398403679653679,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.964770586115876,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5014456513245292,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7244937846923618,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":28.888686901970388,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5979804894745849,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":59.57628574703566,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6232709519934907,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5046802485644616,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":17.61219123288114,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831749207937302,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[1281]整数的各位积和之差","frequency":5.305271024461289,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8112200067590403,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41643835616438357,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.61219123288114,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6598586017282011,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":17.61219123288114,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8123794832240648,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6456398169970886,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":5.305271024461289,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6038997214484679,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.342026351333764,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5630288193102263,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":24.602213602553157,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6272104671368701,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8091927562922038,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1290]二进制链表转整数","frequency":3.714897135977991,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5192176483966341,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4677212140677694,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":4.7534500031620315,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35636220605175173,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":56.940621210274045,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6581322346478321,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8093232621187062,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1295]统计位数为偶数的数字","frequency":16.964770586115876,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45343254920787324,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4574697754749568,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":26.71086994244475,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5961803957662218,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7854768199785346,"acs":0,"articleLive":2,"columnArticles":427,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4672535967360962,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":3.714897135977991,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3604351895180159,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8169742012643089,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.602213602553157,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8223144484123154,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7247259018434614,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1304]和为零的N个唯一整数","frequency":4.7534500031620315,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7466795582921989,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.305271024461289,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5750442237039053,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1306]跳跃游戏 III","frequency":30.196392590007427,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3327205882352941,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7516916740217711,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1308]不同性别每日分数总计","frequency":5.880903715586605,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.755585364725473,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7126241353993585,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":54.0302231983097,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37761607761607763,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.482152669761118,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6668861092824226,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":36.92371046062444,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8315756675135421,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1313]解压缩编码列表","frequency":4.223815124819899,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7355618969968746,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[1314]矩阵区域和","frequency":34.6129730750139,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8100590955806783,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43951612903225806,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6140017180022088,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6533843374774201,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1318]或运算的最小翻转次数","frequency":66.58605518735305,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6174364591573865,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[1319]连通网络的操作次数","frequency":5.880903715586605,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5891510581367064,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6173900378677541,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":4.7534500031620315,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5924462521789657,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7555941845764854,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.602213602553157,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5923807578388316,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7284040995607614,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1325]删除给定值的叶子节点","frequency":4.7534500031620315,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47418200408997957,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":6.482152669761118,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6921262937246168,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45919261087666213,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":16.342026351333764,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7710259301014656,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.482152669761118,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37817342565117046,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":14.067221659084762,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5356080327259204,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1331]数组序号转换","frequency":16.964770586115876,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6848190973517344,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.305271024461289,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5429135802469136,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4903254569772626,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":49.896531456244716,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5855012140131807,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42472187886279356,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7060569962430129,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":38.2625397231158,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6407563025210085,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":4.7534500031620315,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39775006113964295,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":6.482152669761118,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5724414715719064,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.48022432113341207,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204596202106428,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5434022532049898,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5938230214365539,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1344]时钟指针的夹角","frequency":6.482152669761118,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3666322047040579,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":5.880903715586605,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43564441148789323,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7390715667311412,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3036797807790174,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":8.460936643878826,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.504383788254756,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":6.482152669761118,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8487281067556297,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.880903715586605,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7550799660047902,"acs":0,"articleLive":2,"columnArticles":541,"formTitle":"[1351]统计有序矩阵中的负数","frequency":4.7534500031620315,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44248455730954017,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":5.880903715586605,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2827773368493817,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1353]最多可以参加的会议数目","frequency":55.50471638356095,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2822828784119107,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.66301419076702,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315358504528563,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.342026351333764,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5286241289793687,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48852133044107016,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.305271024461289,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5472837022132797,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5033593608135101,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1360]日期之间隔几天","frequency":30.196392590007427,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40125548580634407,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1361]验证二叉树","frequency":5.305271024461289,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5236021069692058,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36296580868228967,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":36.039368418060455,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6763537528747648,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.880903715586605,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250737723400292,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.602213602553157,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5374312920956879,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1366]通过投票对团队排名","frequency":18.286109221180304,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4177083917259936,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":16.342026351333764,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5215453194650818,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6091081593927894,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":5.305271024461289,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.790541992429627,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1370]上升下降字符串","frequency":5.305271024461289,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799017443144182,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":42.08322652910345,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5132686500032128,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.305271024461289,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3986870640642401,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":30.196392590007427,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7393171854935128,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.572654191717895,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5021529628870207,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32514416620586145,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8620689655172413,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8368317481141357,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7278902503995738,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.732375218489027,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6910668380462724,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32370274543625127,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":9.187347576852503,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5434719395173015,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7031308536259031,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[1385]两个数组间的距离值","frequency":5.305271024461289,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3106052925073507,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1386]安排电影院座位","frequency":19.721786318379326,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6936917407327119,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":18.988552069728925,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5375331564986737,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":25.277715518506767,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307471950346145,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.342026351333764,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3530413073082161,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4004909481436023,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":18.988552069728925,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.401033814344174,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1392]最长快乐前缀","frequency":5.880903715586605,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8559877622377622,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6641755446016855,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7494640943193998,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1395]统计作战单位数","frequency":5.305271024461289,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4111914630919834,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1396]设计地铁系统","frequency":19.721786318379326,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3697261287934863,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7712765957446809,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6685914772311965,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.604571554770318,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.305271024461289,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41789748045178104,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7519980818414322,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1402]做菜顺序","frequency":4.7534500031620315,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915695454394528,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1403]非递增顺序的最小子序列","frequency":15.742317076136757,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.492371705963939,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":6.482152669761118,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5060709982389471,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1405]最长快乐字符串","frequency":17.61219123288114,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5688314794880995,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":7.111028644942187,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6685479129923574,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6145583038869258,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8054097698829229,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47571493418066274,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1410]HTML 实体解析器","frequency":6.482152669761118,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5497562374533983,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":37.58143493562092,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5514936285773971,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6916655711844354,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":15.742317076136757,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6019635577003078,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.602213602553157,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6837155236183029,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.482152669761118,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4079631555489526,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":19.721786318379326,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5183683499201376,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":5.880903715586605,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327377734786196,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":50.10277927752686,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4189625484287559,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":35.3127571390813,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.593483709273183,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.951595310336085,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7490816614862955,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.540760584094968,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[1422]分割字符串的最大得分","frequency":30.196392590007427,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5543036750483559,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":5.305271024461289,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39690533980582526,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1424]对角线遍历 II","frequency":17.61219123288114,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43439041578576465,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.482152669761118,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7042682926829268,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":9.952248600050137,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6572890025575447,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5908733280881195,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5006802721088436,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5782493368700266,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8463536007649181,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.305271024461289,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3931858407079646,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6427477576022752,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4559127655574356,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6197688944409744,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7835718776581975,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5891599231530535,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":5.880903715586605,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4826419797044686,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":36.60314524993319,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5606758832565284,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6988312041315575,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6476748902902238,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1441]用栈操作构建数组","frequency":6.482152669761118,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7917861649650109,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":53.33148846736433,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41037665624534764,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5242778119237861,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8594032549728752,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5724718578472416,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6169329073482428,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7131040821015547,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":4.223815124819899,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.628074362033794,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.039368418060455,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8023859270742064,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":4.7534500031620315,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5216565549986811,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":6.482152669761118,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4982938065176591,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.111028644942187,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3627738875084707,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40248997326203206,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":17.61219123288114,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6332613390928725,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5197448606484115,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6357583631049042,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4412397418532388,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.594048594048594,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7444472049689441,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5003053834743915,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42677883929844573,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1462]课程表 IV","frequency":4.7534500031620315,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.590339892665474,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":9.187347576852503,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7689160341555977,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1464]数组中两元素的最大乘积","frequency":16.964770586115876,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3081110506260207,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48497320804535216,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":17.61219123288114,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6145357686453576,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7116104868913857,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.803173403853419,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434922711247946,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[1470]重新排列数组","frequency":42.727087191450074,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5429274109405277,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6173214139260231,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6746128947598635,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":47.94343534792997,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7191011235955056,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.721989608031075,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8647393233499723,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1476]子矩形查询","frequency":18.988552069728925,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28948326055312956,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":16.964770586115876,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5757238307349666,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":27.472821306110042,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5731857318573186,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":5.305271024461289,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8694962641929905,"acs":0,"articleLive":2,"columnArticles":1277,"formTitle":"[1480]一维数组的动态和","frequency":31.642663375228935,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5120403599105424,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1481]不同整数的最少数目","frequency":34.6129730750139,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869639598540146,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":48.63755006325966,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.2997222222222222,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8057630736392742,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.659963436928702,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.858632874375533,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":48.63755006325966,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30821330939654823,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1487]保证文件名唯一","frequency":24.602213602553157,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2354221790534883,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1488]避免洪水泛滥","frequency":61.88349189701954,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6918341481079123,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8574730354391371,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6719447688397334,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6660010509721492,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.566615265998458,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.602213602553157,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.36636332996292553,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":29.100255065408508,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5427301405219386,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5380853959772143,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1496]判断路径是否相交","frequency":5.880903715586605,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39066314583229533,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33326790971540726,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":20.48835658403759,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3775687409551375,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30226480836236935,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5908611069220329,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":23.951595310336085,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7170196258728198,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[1502]判断能否形成等差数列","frequency":34.6129730750139,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5121980896757315,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":17.61219123288114,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5920698376437954,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1504]统计全 1 子矩形","frequency":33.938192048265044,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36123495318769505,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":33.12738596540461,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8435054773082942,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":28.268325494170988,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5886875,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":30.196392590007427,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5524948989055833,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1508]子数组和排序后的区间和","frequency":6.482152669761118,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5449578875483724,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5784690667598742,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":30.196392590007427,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6816375885299706,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":5.880903715586605,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8487738419618529,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[1512]好数对的数目","frequency":4.7534500031620315,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37895797852003754,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":4.7534500031620315,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3179449948752989,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3414152495885902,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5767326732673267,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.731309975451908,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743653421633554,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1518]换酒问题","frequency":24.602213602553157,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29600130925754187,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33204684588767636,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39531701383609547,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":14.067221659084762,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7026455026455026,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5776574861697698,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4252003962892912,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.342026351333764,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6612307300293031,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6121589085072231,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.506713885199941,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7845904427789294,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1528]重新排列字符串","frequency":16.342026351333764,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6891106222501572,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1529]灯泡开关 IV","frequency":6.482152669761118,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5660864385465616,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":16.964770586115876,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32416289592760184,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":22.13336879219314,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6191853458664739,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":5.880903715586605,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6146788990825688,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7895747470962907,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.305271024461289,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45281322405505414,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1535]找出数组游戏的赢家","frequency":6.482152669761118,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4386326641345632,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3652224726604892,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6084656084656085,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5383412644459551,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[1539]第 k 个缺失的正整数","frequency":30.886868973535446,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3164741802734634,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.45854281382172213,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38155202266645677,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5487709715177527,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5446441245776907,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1544]整理字符串","frequency":34.6129730750139,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5525802580258026,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":18.286109221180304,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4111571928112548,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5347240915208614,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":27.472821306110042,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7133757961783439,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.667425320056899,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":5.305271024461289,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6602243203852735,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[1550]存在连续三个奇数的数组","frequency":4.7534500031620315,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8174573620317271,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.305271024461289,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5077108988376108,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":16.964770586115876,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2947437939473991,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":62.61222941479897,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7050359712230215,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4350552403702598,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5783425414364641,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1556]千位分隔数","frequency":45.79071316982024,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7635177128651336,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6219166430394103,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":6.482152669761118,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3667621776504298,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":8.460936643878826,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5736685590700189,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.482152669761118,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7794590893529613,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.342026351333764,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3096114218428025,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":9.952248600050137,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37794432548179874,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":39.70164884207949,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5877712031558185,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7251655629139073,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":5.880903715586605,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4460348609026896,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.305271024461289,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39556121520829546,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":23.951595310336085,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45503694359344027,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4717289719626168,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8962088253573648,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7571329157967989,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049494297396169,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1572]矩阵对角线元素的和","frequency":16.964770586115876,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2956468756346896,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3261562433600113,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":17.61219123288114,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5961479669825741,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47576354945856175,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":4.7534500031620315,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32421773985001295,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.187347576852503,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5802253089795472,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6195996599428085,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":9.187347576852503,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6313131313131313,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8089233753637245,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6716246317453474,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":5.880903715586605,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6860598439175944,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":26.19609235492866,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6661686456449373,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[1584]连接所有点的最小费用","frequency":18.988552069728925,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4292763157894737,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6168384879725086,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8236031069907291,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8388851253266234,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1588]所有奇数长度子数组的和","frequency":21.70709826574351,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.293879173290938,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":6.482152669761118,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2651250947687642,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1590]使数组和能被 P 整除","frequency":6.482152669761118,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5812332439678284,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4448053865690154,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5293701344656758,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.880903715586605,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31323742102458707,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":6.482152669761118,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46142322097378274,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7630268835048125,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6714580338728829,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.305271024461289,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4191281431865598,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6804065040650407,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":17.61219123288114,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4850521436848204,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7826603325415677,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8448255150459487,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1603]设计停车系统","frequency":61.88349189701954,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4138636363636364,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7338081460048965,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3413852073535699,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5465139642354833,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6399946297912331,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5120819213201709,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1609]奇偶树","frequency":5.305271024461289,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2705772157826952,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6093009478672986,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7340241796200345,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7237141556668184,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8209670176138916,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1614]括号的最大嵌套深度","frequency":4.223815124819899,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49555576794418427,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27501116569897277,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.482152669761118,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6184163382300251,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5869565217391305,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6751543942992874,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3703247652762814,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":9.187347576852503,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4380564741795981,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14762171934418053,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":16.964770586115876,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.782017648461722,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.305271024461289,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6274166195590729,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.964770586115876,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5419172932330827,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3837421447395094,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.482152669761118,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3785113474051738,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8363636363636363,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5234420595292134,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.768996000841928,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1630]等差子数组","frequency":5.880903715586605,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4924014579640289,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":23.951595310336085,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3170301828596607,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6541984732824427,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":5.880903715586605,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5185676392572944,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5438683948155534,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":6.482152669761118,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7060664419836302,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.305271024461289,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8061035758323057,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7106690777576854,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":8.460936643878826,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.402156158118262,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6621234620280017,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1640]能否连接形成数组","frequency":4.7534500031620315,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7693151745949783,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.968669594144814,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4537365260797222,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":5.305271024461289,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4496823119491699,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5439650464227198,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":18.988552069728925,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4111592632719393,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":7.111028644942187,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5376038444022174,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.840492390771146,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5129051180525004,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.602213602553157,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27778234761865594,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.721786318379326,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4748762847354397,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7945402298850575,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":7.111028644942187,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6865817825661117,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6603494225644063,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1652]拆炸弹","frequency":16.342026351333764,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5038124010933679,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.305271024461289,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2740296518407463,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":16.964770586115876,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38678869876641464,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7810777709736682,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":4.7534500031620315,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4646717979763037,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":5.880903715586605,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29749816811472835,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":5.305271024461289,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41032017407522536,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":13.300651393426497,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7398058252427184,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7265090230242688,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":17.61219123288114,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8129066149432255,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.342026351333764,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725313359828799,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.979924332141945,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.545351707116413,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6660123020547049,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":7.111028644942187,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6859756097560976,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6000585994726048,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44243590624785206,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7640806975116146,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1669]合并两个链表","frequency":5.305271024461289,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5289678987082748,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":5.305271024461289,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4651928504233302,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":7.7697809816036845,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8505515651920968,"acs":0,"articleLive":2,"columnArticles":438,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35145566302949444,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":4.7534500031620315,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3621484898080643,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":18.988552069728925,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4350380096751901,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7654450261780105,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":9.187347576852503,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3958776030599235,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8303917765709853,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":4.7534500031620315,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4963986476554461,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":5.305271024461289,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46170659206154924,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.482152669761118,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38385502471169686,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.519298245614035,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8950231166711994,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8280419261734772,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[1684]统计一致字符串的数目","frequency":24.602213602553157,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5959053532471891,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.46974434430752254,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":5.880903715586605,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39869281045751637,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8053258352629837,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1688]比赛中的配对次数","frequency":16.342026351333764,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8678223844282238,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1689]十-二进制数的最少数目","frequency":15.742317076136757,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5164621552666747,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1690]石子游戏 VII","frequency":6.482152669761118,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4861450692746536,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.64,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8015151515151515,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6338360434745977,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4575213741045983,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1695]删除子数组的最大得分","frequency":5.305271024461289,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39675496688741724,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":23.32421688025942,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5244977951984321,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5475,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8005865102639296,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7119822342377137,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.305271024461289,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6116064191927378,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1701]平均等待时间","frequency":17.61219123288114,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4747779453661807,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":20.48835658403759,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3879390736711222,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7819826959910178,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3474791215589236,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":17.61219123288114,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5832175604334537,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1706]球会落何处","frequency":16.964770586115876,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032020321276519,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":40.463508395446425,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6973788721207307,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7132904608788854,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6933808808808809,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":23.951595310336085,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3592499730076658,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":51.31344809669288,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26474471830985913,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49686279531340033,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":47.19959107817731,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6398891966759003,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7355565993424142,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1715]苹果和橘子的个数","frequency":17.61219123288114,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6757878685191461,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4306200767521713,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":7.111028644942187,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48766066838046274,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36594202898550726,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692861053943319,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":57.61884932896053,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6473496464109143,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1721]交换链表中的节点","frequency":5.880903715586605,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5141540487162607,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5071656050955414,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.47558476265958,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5583756345177665,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.787560884226302,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.305271024461289,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47829906870497274,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5750085236958745,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":6.482152669761118,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35450081833060554,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6234703482899279,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":5.880903715586605,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5336585365853659,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4731693683622135,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7924306372379437,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1732]找到最高海拔","frequency":34.6129730750139,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4583612413485153,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":8.460936643878826,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231480039453876,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":57.03613470338729,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48452611218568664,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44904266785012364,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.79071316982024,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30963802878325336,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":7.111028644942187,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6543370005790388,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":40.024497229838104,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47177563415505536,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7040951122853368,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":13.300651393426497,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8431111111111111,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7075998282524689,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":4.7534500031620315,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6970675866394856,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":42.82082310063188,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3627048916886289,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":55.55941851158301,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48454063604240283,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":6.482152669761118,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.590990990990991,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7048794826572604,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7487622011599944,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":25.277715518506767,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5306553911205074,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.602213602553157,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45832123148417075,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4726695395781356,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":18.988552069728925,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6836480749524227,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":5.305271024461289,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6287657920310982,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4203476482617587,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":5.880903715586605,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.40011648223645896,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":7.7697809816036845,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8295739348370927,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9234760051880675,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6363053239255934,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4278232717577604,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":5.880903715586605,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5375165125495377,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4289340101522843,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6709401709401709,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6084681255946718,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1763]最长的美好子字符串","frequency":5.880903715586605,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47770428845743546,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5528686581318161,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":5.880903715586605,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3750681942171304,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":13.300651393426497,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7935684647302904,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7672854640980735,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1768]交替合并字符串","frequency":16.342026351333764,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8553683113273106,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.305271024461289,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36890021849963583,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":9.952248600050137,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3648908857509628,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5176470588235295,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8419837904567656,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":22.71859125636899,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5528102602791399,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":5.305271024461289,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47350504935890164,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":18.286109221180304,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46187245590230663,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":28.268325494170988,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7793135580059015,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1777]每家商店的产品价格","frequency":65.44931298971203,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5728813559322034,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6458282358698312,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":5.305271024461289,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6629171353580803,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5176637441980402,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":6.482152669761118,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2874044860734533,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7916666666666666,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4211219512195122,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":5.305271024461289,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3488023120102262,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.33998158944461493,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6543333891400189,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":55.276568695008386,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.688,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7117948717948718,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6487527884810383,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.305271024461289,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8094427903019992,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5124228517170438,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":35.3127571390813,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4126760563380282,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":18.286109221180304,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6995305164319249,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7868852459016393,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.277715518506767,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48728183454645063,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1796]字符串中第二大的数字","frequency":5.305271024461289,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5750240682162013,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1797]设计一个验证系统","frequency":16.964770586115876,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5208623087621697,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5164609053497943,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":7.111028644942187,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6834490740740741,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1800]最大升序子数组和","frequency":16.964770586115876,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3770138628699888,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26248007650621613,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4072698846980653,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":23.018772335893733,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5720461095100865,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":9.187347576852503,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.49174858769627683,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.305271024461289,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6634152685654832,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.71086994244475,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5849273544475803,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2671316284733754,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":11.57231032324481,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6368264743317776,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1809]没有广告的剧集","frequency":25.979924332141945,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.65234375,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":23.951595310336085,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.660427807486631,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1811]寻找面试候选人","frequency":6.482152669761118,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.795022112516713,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5154172002758349,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1813]句子相似性 III","frequency":25.979924332141945,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34246301479408237,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":5.880903715586605,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29773822766036334,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7526493799323563,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1816]截断句子","frequency":5.305271024461289,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6973763028633042,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.305271024461289,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37409197422378443,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":46.48262515564488,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3657235246564268,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5027932960893855,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9013266998341625,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.277715518506767,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8126222888306065,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1822]数组元素积的符号","frequency":15.742317076136757,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7089483394833949,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1823]找出游戏的获胜者","frequency":16.342026351333764,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6596736596736597,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2871919014084507,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":12.338880588903073,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4419047619047619,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7963485623566766,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8688039749201467,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.342026351333764,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6793048973143759,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48579710144927535,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7355450236966825,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.822650260903176,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":23.951595310336085,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6849005281968561,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1833]雪糕的最大数量","frequency":29.530880035468677,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35079864472410455,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1834]单线程 CPU","frequency":31.604133113411436,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5087819505926031,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":9.952248600050137,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7110655737704918,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":9.952248600050137,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7947649572649572,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":5.305271024461289,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4299543818972915,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":59.0472269564352,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5763751127141569,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3879693177230521,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":9.952248600050137,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5183211192538307,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1841]联赛信息统计","frequency":25.277715518506767,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6917808219178082,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5088868101028999,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1843]","frequency":5.305271024461289,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8025415444770283,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5658373488051922,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.633771828245866,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.372493009105014,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36018957345971564,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":6.482152669761118,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6862381922578256,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32874180083482407,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":6.482152669761118,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6054708048395582,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":7.7697809816036845,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40131714344515335,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7112970711297071,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6467195385724586,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":7.111028644942187,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7921461951593778,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1854]人口最多的年份","frequency":24.602213602553157,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6887390694880181,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.951595310336085,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35603562005277045,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":18.988552069728925,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4510986643688065,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6504424778761062,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":11.57231032324481,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7712464589235127,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7704041204437401,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1860]增长的内存泄露","frequency":5.305271024461289,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.618059558117195,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":6.482152669761118,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.30987320131072804,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9174547930695317,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.372493009105014,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3870908925152703,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":6.482152669761118,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5159330810595499,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":4.223815124819899,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5961857379767828,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":22.13336879219314,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7522935779816514,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5302325581395348,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":15.164157979236952,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7929913985345651,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1869]哪种连续子字符串更长","frequency":30.196392590007427,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4595773857757277,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":5.880903715586605,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2761282379125823,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6273133375877473,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8030575539568345,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":34.6129730750139,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8802816901408451,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7420042643923241,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7268280123583934,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8190024396855516,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[1877]数组中最大数对和的最小值","frequency":54.0302231983097,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.429097605893186,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40910119990944077,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":7.7697809816036845,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7728251507321274,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":4.7534500031620315,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3527609205071201,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2785027740876768,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37325479930191974,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6934244235695987,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":33.938192048265044,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5190839694656488,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5714909885308574,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":16.964770586115876,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.641185647425897,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.482152669761118,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31472435450104674,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":7.111028644942187,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2731137088204038,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":17.61219123288114,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7024647887323944,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5167958656330749,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3355102040816327,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":5.880903715586605,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915369352869353,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.79071316982024,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45835985502916304,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":8.747098507935066,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5292689506339358,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5036630036630036,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5305193099220598,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.964770586115876,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30859981372244644,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.460936643878826,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6279517229316075,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.42782931354359927,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":28.268325494170988,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6633663366336634,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.432258064516129,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6458390678043857,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2764342895263509,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5693290734824281,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1905]统计子岛屿","frequency":5.305271024461289,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4228561488954601,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":20.48835658403759,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.594553706505295,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6923076923076923,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3272097575666315,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":5.880903715586605,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6751456310679612,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5696485028826483,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1911]最大子序列交替和","frequency":16.342026351333764,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2883701714521793,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8427898631980265,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":5.305271024461289,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4415204678362573,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":18.286109221180304,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3903054076772205,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5485436893203883,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":18.988552069728925,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.29001367989056087,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4713656387665198,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.38042131350681535,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9249043688343064,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34317602040816325,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.964770586115876,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36221920217443443,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.305271024461289,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2367086536888598,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.979924332141945,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38095238095238093,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6984051792199589,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.886868973535446,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3427910252540497,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4109555984555985,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.880903715586605,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39702280007537216,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":32.350215569193246,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9267580716497125,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1929]数组串联","frequency":16.342026351333764,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4755132877077593,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.964770586115876,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5535307517084282,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":8.460936643878826,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3263058527375708,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":21.291132933343892,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5695461200585652,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":11.57231032324481,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7491039426523297,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7399929980161045,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4486065573770492,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24142553023732555,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.61219123288114,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3396284829721362,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":20.48835658403759,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6060606060606061,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8033573141486811,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7727597286683328,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39117132867132864,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40363473188243215,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5696321911348633,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":5.305271024461289,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6617194953885296,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.305271024461289,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30286811332829133,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.61219123288114,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.539499304589708,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.511767925561029,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.460936643878826,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.5462962962962963,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7205882352941176,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5442622950819672,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1952]三除数","frequency":5.305271024461289,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3225553288337781,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4798940524921743,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":5.305271024461289,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4941153393487642,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.44366197183098594,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":18.988552069728925,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6088820826952527,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4208231600976631,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.40794117647058825,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.279023418036871,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5355515782622844,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":4.7534500031620315,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4244432026822064,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1962]移除石子使总数最小","frequency":15.742317076136757,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6117767387492694,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":5.880903715586605,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38188877755511025,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7545454545454545,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.7441860465116279,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7750307335063515,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35427394438722964,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27700263440335643,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":21.019325696190595,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47837960855712336,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":15.164157979236952,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5530474040632054,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.5059288537549407,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":10.7188188657084,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5196078431372549,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.746268656716418,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.7665702656582626,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.37732919254658387,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1975]最大方阵和","frequency":12.812252362025845,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28132387706855794,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2426056338028169,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.6103286384976526,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1978]","frequency":14.067221659084762,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8296056884292179,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5791235226440749,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1980]找出不同的二进制字符串","frequency":11.13947459775855,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29499792157406124,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":22.13336879219314,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4589400116482236,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1982]从子集的和还原数组","frequency":9.952248600050137,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6851851851851852,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1983]","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5801912718478619,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.40864736215787384,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2646747537246601,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1986]完成任务的最少工作时间段","frequency":5.305271024461289,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.45097369320122993,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6442307692307693,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1988]","frequency":33.938192048265044,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.3972602739726027,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1989]","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6410256410256411,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1990]","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6642487046632124,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5904389795449322,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3817751479289941,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3553162853297443,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.541282389108476,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.23639892675686475,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3357305071915216,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1997]访问完所有房间的第一天","frequency":12.338880588903073,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.42134146341463413,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1998]数组的最大公因数排序","frequency":23.951595310336085,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.8447739875651151,"acs":0,"articleLive":2,"columnArticles":621,"formTitle":"[LCP 01]猜数字","frequency":38.2625397231158,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6900418583018966,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[LCP 02]分式化简","frequency":28.888686901970388,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21853349885867607,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":23.32421688025942,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3768506056527591,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 04]覆盖","frequency":26.71086994244475,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.1969756868946432,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8396457472030096,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[LCP 06]拿硬币","frequency":34.6129730750139,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7703791755651368,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[LCP 07]传递信息","frequency":67.01967451005898,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28455988455988457,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27049392293767777,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":66.4177129262341,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5834464043419267,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":18.988552069728925,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.685350580022585,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":5.880903715586605,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4074392746045403,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[LCP 12]小张刷题计划","frequency":42.08322652910345,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6127431779605693,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":7.111028644942187,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2049595943590556,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":25.277715518506767,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5711311589174185,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":9.952248600050137,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30064308681672025,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7983737596471885,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[LCP 17]速算机器人","frequency":28.888686901970388,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28543145249240787,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[LCP 18]早餐组合","frequency":35.3127571390813,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162731671205352,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":34.6129730750139,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3041983351429606,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":17.61219123288114,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3273580879214682,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":7.7697809816036845,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.332629753872828,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":51.31344809669288,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3376987839101964,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":16.964770586115876,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2749445676274945,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.32783505154639175,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3350416399743754,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3268357810413885,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":13.300651393426497,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.27624083433145397,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[LCP 28]采购方案","frequency":28.268325494170988,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18151840788299647,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[LCP 29]乐团站位","frequency":51.31344809669288,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34363468634686345,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[LCP 30]魔塔游戏","frequency":4.223815124819899,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.242960944595822,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":16.342026351333764,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3944421401907922,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":17.61219123288114,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2080563947633434,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[LCP 33]蓄水","frequency":30.196392590007427,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4682383759004584,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":30.196392590007427,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3846994535519126,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 35]电动车游城市","frequency":17.61219123288114,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.24875267284390593,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":36.794837723885436,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.18721943490889886,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 37]最小矩形面积","frequency":33.12738596540461,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5343203230148048,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":20.48835658403759,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.4881216886002393,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.17266689968542467,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.3330101793504605,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.10141800246609124,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.27578947368421053,"acs":0,"articleLive":2,"columnArticles":1,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.5401653868871825,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[LCS 01]下载插件","frequency":25.979924332141945,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6998623221661312,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[LCS 02]完成一半题目","frequency":18.286109221180304,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4166233766233766,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[LCS 03]主题空间","frequency":6.482152669761118,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786253137426324,"acs":0,"articleLive":2,"columnArticles":2724,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":95.98717517405444,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40286992598984755,"acs":0,"articleLive":2,"columnArticles":2015,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":76.2388998862295,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7616148796253138,"acs":0,"articleLive":2,"columnArticles":1877,"formTitle":"[剑指 Offer 05]替换空格","frequency":65.06749762271771,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.752297977151242,"acs":0,"articleLive":2,"columnArticles":2014,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":78.76510352186095,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6967480666859871,"acs":0,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":81.05065323695118,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.716943837418921,"acs":0,"articleLive":2,"columnArticles":1595,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":93.30733633955491,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3594596864780676,"acs":0,"articleLive":2,"columnArticles":1816,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":56.44642251302283,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44257174078297223,"acs":0,"articleLive":2,"columnArticles":1278,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":71.1669030274154,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49322589075361106,"acs":0,"articleLive":2,"columnArticles":1586,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":81.27839419327225,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4528834349012005,"acs":0,"articleLive":2,"columnArticles":1095,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":62.973540269616954,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5259602920106434,"acs":0,"articleLive":2,"columnArticles":1673,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":76.55685527286687,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5687951051145278,"acs":0,"articleLive":2,"columnArticles":1269,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":67.47257605372134,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3114484356894554,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":33.938192048265044,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7465319569175694,"acs":0,"articleLive":2,"columnArticles":1231,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":52.20470458328009,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3390297277326209,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":36.28787824259439,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7771999744250975,"acs":0,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":66.63924847041751,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5957062013133276,"acs":0,"articleLive":2,"columnArticles":1428,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":60.058373293739976,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37546160442906895,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":56.985138237023314,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24020070512758138,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":69.29570855863423,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6425559531204992,"acs":0,"articleLive":2,"columnArticles":1583,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":58.55987251066475,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7976878979075096,"acs":0,"articleLive":2,"columnArticles":2395,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":63.73420372397314,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427645170687641,"acs":0,"articleLive":2,"columnArticles":1778,"formTitle":"[剑指 Offer 24]反转链表","frequency":95.0126005343227,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7286961175840916,"acs":0,"articleLive":2,"columnArticles":1152,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":80.9769251076331,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655376211916605,"acs":0,"articleLive":2,"columnArticles":1144,"formTitle":"[剑指 Offer 26]树的子结构","frequency":72.23422762244076,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7913002200837181,"acs":0,"articleLive":2,"columnArticles":1363,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":64.51410984900637,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5803699070764832,"acs":0,"articleLive":2,"columnArticles":1055,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":51.41156930153409,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44001680877819627,"acs":0,"articleLive":2,"columnArticles":1443,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":83.10197232254423,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5722457319248061,"acs":0,"articleLive":2,"columnArticles":878,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":60.21848313429563,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6145450211142897,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":39.384102023544834,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6453696022572041,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":63.39270951024547,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6859379435793369,"acs":0,"articleLive":2,"columnArticles":1054,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":57.246101168713096,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5886101279112678,"acs":0,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":57.293056766568704,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.550758619988098,"acs":0,"articleLive":2,"columnArticles":922,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":63.43210979679439,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5773379909656432,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":66.88572414086065,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7204841376459646,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":59.89318154573934,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6544865348083585,"acs":0,"articleLive":2,"columnArticles":866,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":68.23046316409282,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.559930355248016,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":71.91539764059483,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5789399861252744,"acs":0,"articleLive":2,"columnArticles":1087,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":93.58532331632726,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6898095684403357,"acs":0,"articleLive":2,"columnArticles":997,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":58.35452663604771,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5697213826928695,"acs":0,"articleLive":2,"columnArticles":1773,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":75.56775971562855,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5807221203921911,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":48.573439182396186,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.605437040371777,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":91.12792957771387,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4833865100493832,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":52.89476650898569,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41367518722535124,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":52.38134854650668,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5618147056740872,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.36714971506007,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.537571816641584,"acs":0,"articleLive":2,"columnArticles":1386,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":71.22923410108467,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6890042242069678,"acs":0,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":55.82003055301864,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646010107059726,"acs":0,"articleLive":2,"columnArticles":998,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":72.23422762244076,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.651310257577277,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[剑指 Offer 49]丑数","frequency":70.68706534420068,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6138684519055952,"acs":0,"articleLive":2,"columnArticles":1019,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":66.88572414086065,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4816542948038176,"acs":0,"articleLive":2,"columnArticles":821,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":93.29348722002871,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6482138586977483,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":67.82575918632287,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.538626891338357,"acs":0,"articleLive":2,"columnArticles":1531,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":59.420552795105074,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44700616217218675,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":56.71948948483533,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.755465543734075,"acs":0,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":47.42551348922385,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7894199214236192,"acs":0,"articleLive":2,"columnArticles":1235,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":60.39282472394386,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5868717930380991,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.423138364038635,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6993065239750879,"acs":0,"articleLive":2,"columnArticles":999,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":65.88204208041411,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7993374480646266,"acs":0,"articleLive":2,"columnArticles":677,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":49.72626914792858,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6640808724064016,"acs":0,"articleLive":2,"columnArticles":811,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.17910306993653,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7063006954015129,"acs":0,"articleLive":2,"columnArticles":1829,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":59.17630488068677,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44137824905968287,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":59.54653043899781,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8568656676926876,"acs":0,"articleLive":2,"columnArticles":1734,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":55.03227831897187,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4439020629575249,"acs":0,"articleLive":2,"columnArticles":1165,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":76.36923353344164,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4746146186849335,"acs":0,"articleLive":2,"columnArticles":1046,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":49.02157160070437,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5602585450573848,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":57.53787205241439,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4597040519722802,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":62.00729907555896,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.65535414589436,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":75.12751064671113,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6334487623444914,"acs":0,"articleLive":2,"columnArticles":922,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":65.02026583070554,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8572092183024078,"acs":0,"articleLive":2,"columnArticles":1263,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":53.85325667179753,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5819172729376076,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":45.122210233165,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5978345931907502,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":57.40221474827965,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28537732747017636,"acs":0,"articleLive":2,"columnArticles":541,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":45.995757191003214,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6931222459176587,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":49.11410592184593,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6998228785969989,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.96958235798273,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20531182372614598,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 001]整数除法","frequency":14.067221659084762,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5868270605050023,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5331405313165252,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7853945517329581,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":14.606201654946489,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6959269662921348,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":3.225363773674486,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7203121704281797,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6685427441435959,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":17.61219123288114,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4614026236125126,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5152590489709014,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5440404797601199,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.43846680355920603,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5670027046963364,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":14.606201654946489,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6633617708093152,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":3.714897135977991,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6636485580147552,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5059805912886481,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6445255474452555,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.495985727029438,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5282546494992847,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5410539215686274,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4751101321585903,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":15.164157979236952,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7073409461663948,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.536944219886823,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":15.164157979236952,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5183711367555379,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":12.812252362025845,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7112894873122735,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":3.714897135977991,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7708094593186791,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 024]反转链表","frequency":22.13336879219314,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6130311614730878,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":23.32421688025942,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6577471967380224,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 026]重排链表","frequency":16.342026351333764,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6170825335892515,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 027]回文链表","frequency":2.2997107969747876,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6047804335742079,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":16.964770586115876,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30128050253684463,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5277641277641277,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5890804597701149,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.597629239380968,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7859272510435301,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.578826764436297,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.7018323153803443,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5968992248062015,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4571984435797665,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7778239202657807,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5233602875112309,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5727733526430123,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":15.742317076136757,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7903154153709463,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8632130384167637,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6434923201293452,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":5.305271024461289,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6463267763950221,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8128898128898129,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7161470451372731,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6896217264791464,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6713132795304475,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":5.880903715586605,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7528846153846154,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":15.742317076136757,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6175757575757576,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41947565543071164,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":24.602213602553157,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.734629294755877,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":2.2997107969747876,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6457901285773539,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8480610298792117,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8940864960282436,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7343951786482996,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3550765740215542,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.588126159554731,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.627147766323024,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6705675833820948,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5349008082292432,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7202432667245873,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7223451327433629,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6027397260273972,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6223684210526316,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6404907975460122,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6382393397524071,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5181313296308396,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7254536993950674,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6765408504538939,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5201238390092879,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":5.880903715586605,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42360496014171833,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5406091370558376,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5420760358821016,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 074]合并区间","frequency":16.342026351333764,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7130846032580137,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6709031909140075,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":24.602213602553157,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5626453112890726,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6462663587374904,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8466969238527483,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 079]所有子集","frequency":3.714897135977991,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8180494905385735,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7885514018691588,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6472954850245864,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8554160855416085,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6759530791788856,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8555767397521449,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7673956262425448,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6321070234113713,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":16.964770586115876,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7449113591595535,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6185185185185185,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5206438068579426,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":4.223815124819899,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7510760401721664,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.305271024461289,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6425567703952901,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5536480686695279,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6088939566704675,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6652393927598287,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":45.79071316982024,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4960282436010591,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5311804008908686,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7615844544095666,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6812036633231574,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":24.602213602553157,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7397260273972602,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4690541066562865,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5924657534246576,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5008641548565503,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":30.196392590007427,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.554140127388535,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6901561932437341,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.305271024461289,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5350389321468298,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.305271024461289,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5434782608695652,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5641592920353983,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5984405458089669,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8427734375,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6615384615384615,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5886194029850746,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":5.880903715586605,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5729166666666666,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.964770586115876,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.39351851851851855,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.27207062600321025,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 115]重建序列","frequency":4.7534500031620315,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6355885588558856,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6294117647058823,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7027463651050081,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4406604747162023,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.305271024461289,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7211865766823492,"acs":0,"articleLive":2,"columnArticles":1489,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":77.21534487145287,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6501660735468565,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":46.623958387052,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.579627051835109,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[面试题 01.03]URL化","frequency":40.68679818649756,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.551029715670206,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[面试题 01.04]回文排列","frequency":45.79071316982024,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3332007396576933,"acs":0,"articleLive":2,"columnArticles":536,"formTitle":"[面试题 01.05]一次编辑","frequency":40.024497229838104,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47280951650243186,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[面试题 01.06]字符串压缩","frequency":68.5640016581416,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7550091401125488,"acs":0,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 01.07]旋转矩阵","frequency":54.859574696851865,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6217445967790217,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 01.08]零矩阵","frequency":38.968669594144814,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5512076785149246,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[面试题 01.09]字符串轮转","frequency":37.58143493562092,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.683752116189967,"acs":0,"articleLive":2,"columnArticles":672,"formTitle":"[面试题 02.01]移除重复节点","frequency":48.573439182396186,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7801800916428141,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":60.76144099880775,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.853871717774234,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[面试题 02.03]删除中间节点","frequency":63.54355616189983,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.656731757451182,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[面试题 02.04]分割链表","frequency":47.94343534792997,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46656155564314805,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[面试题 02.05]链表求和","frequency":74.61509086001787,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48353013498629643,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[面试题 02.06]回文链表","frequency":28.268325494170988,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6863509316770187,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 02.07]链表相交","frequency":27.087817741251484,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320261968004217,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 02.08]环路检测","frequency":50.592458864783474,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5412616339193381,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6131338443396226,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.39286252656413,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.386235816477553,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 03.03]堆盘子","frequency":33.938192048265044,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7119927126523432,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 03.04]化栈为队","frequency":36.28787824259439,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5443716967736846,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 03.05]栈排序","frequency":16.342026351333764,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5888434446716655,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.06]动物收容所","frequency":34.6129730750139,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5345335826809091,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.01]节点间通路","frequency":35.3127571390813,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7895809421189478,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[面试题 04.02]最小高度树","frequency":49.896531456244716,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8049663735126746,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":32.65721719716918,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5841211880185831,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 04.04]检查平衡性","frequency":17.61219123288114,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3512090734003852,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":35.3127571390813,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5908074153516164,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.06]后继者","frequency":17.61219123288114,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7164560365689702,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":30.886868973535446,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4781639928698752,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":17.61219123288114,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7172161172161172,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.10]检查子树","frequency":5.880903715586605,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4880880535678363,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.12]求和路径","frequency":34.6129730750139,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5060794531293775,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.687894541403639,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":17.61219123288114,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38981446421809923,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 05.03]翻转数位","frequency":39.70164884207949,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39162883742402094,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5272265588262955,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 05.06]整数转换","frequency":4.7534500031620315,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7034038755736869,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":4.7534500031620315,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.552297165200391,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":23.951595310336085,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36395905274413226,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[面试题 08.01]三步问题","frequency":41.45992980914596,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36111710489812276,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 08.02]迷路的机器人","frequency":36.92371046062444,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768524987806004,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":5.305271024461289,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8230409118664767,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[面试题 08.04]幂集","frequency":40.68679818649756,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6798317671025826,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 08.05]递归乘法","frequency":5.880903715586605,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6563452360416308,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":53.103858186445876,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8135626267352987,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":29.530880035468677,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185085354896675,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":46.48262515564488,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8119562706905843,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.09]括号","frequency":64.22526176386846,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5594905644410595,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 08.10]颜色填充","frequency":16.342026351333764,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.494731723131788,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":45.79071316982024,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7600075439671837,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 08.12]八皇后","frequency":45.122210233165,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.501223241590214,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":17.61219123288114,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5346481876332623,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":25.277715518506767,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5542293044698337,"acs":0,"articleLive":2,"columnArticles":2362,"formTitle":"[面试题 10.01]合并排序的数组","frequency":73.7190427609413,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7394534530654435,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.88349189701954,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3964495175632213,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":60.30375859311135,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534066713981547,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.602213602553157,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4561549601737871,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":44.08204068457754,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6305723324705206,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6667873630850004,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":42.727087191450074,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8329868562231759,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[面试题 16.01]交换数字","frequency":24.602213602553157,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7664744867719165,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.02]单词频率","frequency":5.880903715586605,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4435029563759952,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":7.7697809816036845,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4606748949579832,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46386636536842574,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.196392590007427,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42454263030721434,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.06]最小差","frequency":34.6129730750139,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7327811013959196,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 16.07]最大数值","frequency":41.372493009105014,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.375590020229265,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5494791666666666,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":8.460936643878826,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6833367633943884,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.10]生存人数","frequency":16.964770586115876,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44096451592936786,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[面试题 16.11]跳水板","frequency":23.951595310336085,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4320589590050668,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.550613741431532,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5032909930715935,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 16.15]珠玑妙算","frequency":5.880903715586605,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4519335980241973,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.16]部分排序","frequency":35.3127571390813,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.600758838339066,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[面试题 16.17]连续数列","frequency":38.2625397231158,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.344296791015759,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 16.18]模式匹配","frequency":33.938192048265044,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.610360153256705,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[面试题 16.19]水域大小","frequency":47.94343534792997,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7204038704249054,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[面试题 16.20]T9键盘","frequency":30.196392590007427,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4654011642622121,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":5.305271024461289,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5822950819672131,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.111028644942187,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4724661173398172,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.24]数对和","frequency":24.602213602553157,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5446364805027853,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 16.25]LRU 缓存","frequency":89.11029576359637,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38725734196117473,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.26]计算器","frequency":59.0472269564352,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5977121067683508,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":16.964770586115876,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6450835322195704,"acs":0,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 17.04]消失的数字","frequency":37.58143493562092,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38683187917002715,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.61219123288114,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44866093487498765,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.305271024461289,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4116000772051727,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 17.07]婴儿名字","frequency":34.6129730750139,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2722667650709517,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":41.372493009105014,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5503485513962203,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[面试题 17.09]第 k 个数","frequency":53.33148846736433,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5711148997726803,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 17.10]主要元素","frequency":59.57628574703566,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.686611345659242,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 17.11]单词距离","frequency":34.6129730750139,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6313839063278525,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 17.12]BiNode","frequency":4.7534500031620315,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5531253545093591,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":30.886868973535446,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5983903549555905,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[面试题 17.14]最小K个数","frequency":48.53262496651136,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40222984562607206,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.15]最长单词","frequency":32.350215569193246,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5189348805885096,"acs":0,"articleLive":2,"columnArticles":1128,"formTitle":"[面试题 17.16]按摩师","frequency":51.68390331154002,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44257817040567243,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.17]多次搜索","frequency":16.342026351333764,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4457069901053304,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.18]最短超串","frequency":25.277715518506767,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5817666574509262,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":35.3127571390813,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5717080511662904,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":16.964770586115876,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358555584513365,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 17.21]直方图的水量","frequency":88.78393793487164,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3718715876829002,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.68679818649756,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3794912142669814,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.23]最大黑方阵","frequency":5.305271024461289,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5190759353786244,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.24]最大子矩阵","frequency":76.29246762748132,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.501368925393566,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 17.25]单词矩阵","frequency":29.100255065408508,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34117284584574303,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.964770586115876,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
+[{"acceptance":0.35492424912051196,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[678]有效的括号字符串","frequency":69.1182663152717,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5197616795898551,"acs":0,"articleLive":2,"columnArticles":14020,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4083779027438624,"acs":0,"articleLive":2,"columnArticles":7033,"formTitle":"[2]两数相加","frequency":99.24005388899357,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37964357300192,"acs":0,"articleLive":2,"columnArticles":7258,"formTitle":"[3]无重复字符的最长子串","frequency":96.2463107402282,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4079319144501027,"acs":0,"articleLive":2,"columnArticles":3740,"formTitle":"[4]寻找两个正序数组的中位数","frequency":96.18605319564443,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35360666630325727,"acs":0,"articleLive":2,"columnArticles":3908,"formTitle":"[5]最长回文子串","frequency":98.3249144871417,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5065118599452081,"acs":0,"articleLive":2,"columnArticles":2402,"formTitle":"[6]Z 字形变换","frequency":78.95516499294058,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35342968224685783,"acs":0,"articleLive":2,"columnArticles":5177,"formTitle":"[7]整数反转","frequency":99.08486059814814,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21712873760079926,"acs":0,"articleLive":2,"columnArticles":2638,"formTitle":"[8]字符串转换整数 (atoi)","frequency":72.14251587482921,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5849693059213913,"acs":0,"articleLive":2,"columnArticles":4842,"formTitle":"[9]回文数","frequency":82.3141923496469,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3163897116919174,"acs":0,"articleLive":2,"columnArticles":1222,"formTitle":"[10]正则表达式匹配","frequency":86.31194143301694,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.630104334070661,"acs":0,"articleLive":2,"columnArticles":2952,"formTitle":"[11]盛最多水的容器","frequency":87.90118461034572,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6653063787041688,"acs":0,"articleLive":2,"columnArticles":1737,"formTitle":"[12]整数转罗马数字","frequency":76.57624798125444,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6327719563633152,"acs":0,"articleLive":2,"columnArticles":3811,"formTitle":"[13]罗马数字转整数","frequency":84.17700318598979,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4080534503683253,"acs":0,"articleLive":2,"columnArticles":3802,"formTitle":"[14]最长公共前缀","frequency":90.59630061716439,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3342910576410728,"acs":0,"articleLive":2,"columnArticles":2998,"formTitle":"[15]三数之和","frequency":94.92160355789898,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45950305968871386,"acs":0,"articleLive":2,"columnArticles":1400,"formTitle":"[16]最接近的三数之和","frequency":83.6369494816087,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5721456497535968,"acs":0,"articleLive":2,"columnArticles":2996,"formTitle":"[17]电话号码的字母组合","frequency":73.79118206112535,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40053918629867297,"acs":0,"articleLive":2,"columnArticles":1479,"formTitle":"[18]四数之和","frequency":67.36118022692898,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42850308154607086,"acs":0,"articleLive":2,"columnArticles":3760,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":75.92555078920125,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4448368995785699,"acs":0,"articleLive":2,"columnArticles":5447,"formTitle":"[20]有效的括号","frequency":92.6312185492037,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672223693858669,"acs":0,"articleLive":2,"columnArticles":3387,"formTitle":"[21]合并两个有序链表","frequency":86.13049994215764,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724332771758032,"acs":0,"articleLive":2,"columnArticles":2573,"formTitle":"[22]括号生成","frequency":90.43675021248056,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.558982414601668,"acs":0,"articleLive":2,"columnArticles":2058,"formTitle":"[23]合并K个升序链表","frequency":83.23184649212841,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031353052749362,"acs":0,"articleLive":2,"columnArticles":2458,"formTitle":"[24]两两交换链表中的节点","frequency":60.09902598388349,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6567261415659115,"acs":0,"articleLive":2,"columnArticles":2132,"formTitle":"[25]K 个一组翻转链表","frequency":89.14529554563548,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5399925752066296,"acs":0,"articleLive":2,"columnArticles":4436,"formTitle":"[26]删除有序数组中的重复项","frequency":83.93938162403258,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5981193452251967,"acs":0,"articleLive":2,"columnArticles":3989,"formTitle":"[27]移除元素","frequency":75.75623320777925,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4067537998879361,"acs":0,"articleLive":2,"columnArticles":3165,"formTitle":"[28]实现 strStr()","frequency":73.40675089745966,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20761203641930795,"acs":0,"articleLive":2,"columnArticles":874,"formTitle":"[29]两数相除","frequency":66.28458587861694,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3569753273048768,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[30]串联所有单词的子串","frequency":53.10821132058351,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37322656624712264,"acs":0,"articleLive":2,"columnArticles":1699,"formTitle":"[31]下一个排列","frequency":81.54241639512182,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3562969102634536,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[32]最长有效括号","frequency":75.6352987016899,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42648417696866553,"acs":0,"articleLive":2,"columnArticles":2355,"formTitle":"[33]搜索旋转排序数组","frequency":72.411053953103,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4241843544647546,"acs":0,"articleLive":2,"columnArticles":3190,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.79655419941115,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4649538588015724,"acs":0,"articleLive":2,"columnArticles":3829,"formTitle":"[35]搜索插入位置","frequency":77.09511957336467,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6281194634269806,"acs":0,"articleLive":2,"columnArticles":1141,"formTitle":"[36]有效的数独","frequency":53.87980405397117,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6703666834849249,"acs":0,"articleLive":2,"columnArticles":832,"formTitle":"[37]解数独","frequency":62.71477413927984,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5800928336054381,"acs":0,"articleLive":2,"columnArticles":2244,"formTitle":"[38]外观数列","frequency":63.63101976814784,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7272858970415836,"acs":0,"articleLive":2,"columnArticles":1901,"formTitle":"[39]组合总和","frequency":72.70703369394369,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6261463039507834,"acs":0,"articleLive":2,"columnArticles":1357,"formTitle":"[40]组合总和 II","frequency":71.54670169526139,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41930013913993314,"acs":0,"articleLive":2,"columnArticles":1391,"formTitle":"[41]缺失的第一个正数","frequency":88.55894352372171,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5775889520476998,"acs":0,"articleLive":2,"columnArticles":2375,"formTitle":"[42]接雨水","frequency":95.426107084638,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4490733637501514,"acs":0,"articleLive":2,"columnArticles":1120,"formTitle":"[43]字符串相乘","frequency":82.7226655462022,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32808799516058246,"acs":0,"articleLive":2,"columnArticles":542,"formTitle":"[44]通配符匹配","frequency":62.43187882153545,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4271267526104364,"acs":0,"articleLive":2,"columnArticles":1560,"formTitle":"[45]跳跃游戏 II","frequency":96.74359268485507,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7825852131760754,"acs":0,"articleLive":2,"columnArticles":2622,"formTitle":"[46]全排列","frequency":93.53986995346763,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6371775850956451,"acs":0,"articleLive":2,"columnArticles":1442,"formTitle":"[47]全排列 II","frequency":66.76573832756704,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352516908672754,"acs":0,"articleLive":2,"columnArticles":1834,"formTitle":"[48]旋转图像","frequency":72.12489680550323,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.66428280713995,"acs":0,"articleLive":2,"columnArticles":1288,"formTitle":"[49]字母异位词分组","frequency":69.1790088146811,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37679369539292323,"acs":0,"articleLive":2,"columnArticles":1263,"formTitle":"[50]Pow(x, n)","frequency":70.41428215443986,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7391477577361424,"acs":0,"articleLive":2,"columnArticles":1510,"formTitle":"[51]N 皇后","frequency":67.17586316468415,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8230104510699905,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[52]N皇后 II","frequency":31.491563468370405,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.55187250754575,"acs":0,"articleLive":2,"columnArticles":3682,"formTitle":"[53]最大子序和","frequency":79.35387972503601,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4801314207537001,"acs":0,"articleLive":2,"columnArticles":1965,"formTitle":"[54]螺旋矩阵","frequency":87.27129505796557,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4323978924348547,"acs":0,"articleLive":2,"columnArticles":2424,"formTitle":"[55]跳跃游戏","frequency":72.31983468999518,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4676763939435501,"acs":0,"articleLive":2,"columnArticles":2258,"formTitle":"[56]合并区间","frequency":83.98358996711876,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4109429456719823,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[57]插入区间","frequency":38.14960487430996,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35531119426559715,"acs":0,"articleLive":2,"columnArticles":2357,"formTitle":"[58]最后一个单词的长度","frequency":56.13003699030992,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7924893062210177,"acs":0,"articleLive":2,"columnArticles":1529,"formTitle":"[59]螺旋矩阵 II","frequency":78.65642916907247,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.523670295856593,"acs":0,"articleLive":2,"columnArticles":936,"formTitle":"[60]排列序列","frequency":43.811617614286725,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4178883190365966,"acs":0,"articleLive":2,"columnArticles":1961,"formTitle":"[61]旋转链表","frequency":69.19690860589266,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6609684829313072,"acs":0,"articleLive":2,"columnArticles":2376,"formTitle":"[62]不同路径","frequency":65.29722234807565,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3904209318257414,"acs":0,"articleLive":2,"columnArticles":1676,"formTitle":"[63]不同路径 II","frequency":67.94338650912769,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6881860411618161,"acs":0,"articleLive":2,"columnArticles":2044,"formTitle":"[64]最小路径和","frequency":73.35488120150548,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2691848083293895,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[65]有效数字","frequency":43.19101523119446,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45826132853212015,"acs":0,"articleLive":2,"columnArticles":3109,"formTitle":"[66]加一","frequency":62.60429081434295,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5436915601707731,"acs":0,"articleLive":2,"columnArticles":1748,"formTitle":"[67]二进制求和","frequency":56.095557624377044,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.525255403730248,"acs":0,"articleLive":2,"columnArticles":563,"formTitle":"[68]文本左右对齐","frequency":43.261622546160474,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3927040813143716,"acs":0,"articleLive":2,"columnArticles":1893,"formTitle":"[69]x 的平方根","frequency":78.51233096738933,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5288350180358175,"acs":0,"articleLive":2,"columnArticles":3491,"formTitle":"[70]爬楼梯","frequency":92.51683201214527,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42135905496721676,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[71]简化路径","frequency":56.76098687749841,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.613499991033481,"acs":0,"articleLive":2,"columnArticles":1212,"formTitle":"[72]编辑距离","frequency":91.55757453197386,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.60269096371771,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[73]矩阵置零","frequency":53.68409936914155,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4595929262595929,"acs":0,"articleLive":2,"columnArticles":1665,"formTitle":"[74]搜索二维矩阵","frequency":75.06258830174758,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5948266068012125,"acs":0,"articleLive":2,"columnArticles":1815,"formTitle":"[75]颜色分类","frequency":52.71146093653979,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42522303652973464,"acs":0,"articleLive":2,"columnArticles":1230,"formTitle":"[76]最小覆盖子串","frequency":77.14335249500812,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699875841149066,"acs":0,"articleLive":2,"columnArticles":1242,"formTitle":"[77]组合","frequency":73.57187396120386,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8009035638532457,"acs":0,"articleLive":2,"columnArticles":1997,"formTitle":"[78]子集","frequency":70.73734846387016,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4579542344694019,"acs":0,"articleLive":2,"columnArticles":1366,"formTitle":"[79]单词搜索","frequency":72.42054041784307,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6163986201480343,"acs":0,"articleLive":2,"columnArticles":1310,"formTitle":"[80]删除有序数组中的重复项 II","frequency":69.09527311864866,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41569159267007855,"acs":0,"articleLive":2,"columnArticles":979,"formTitle":"[81]搜索旋转排序数组 II","frequency":72.23477304447916,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5297674334447111,"acs":0,"articleLive":2,"columnArticles":1652,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":80.1791995228279,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.538809161690015,"acs":0,"articleLive":2,"columnArticles":1897,"formTitle":"[83]删除排序链表中的重复元素","frequency":71.22444663898474,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43293693118468374,"acs":0,"articleLive":2,"columnArticles":1130,"formTitle":"[84]柱状图中最大的矩形","frequency":76.4454393700117,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5157890760746393,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[85]最大矩形","frequency":60.46966739620005,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6322635480435087,"acs":0,"articleLive":2,"columnArticles":1079,"formTitle":"[86]分隔链表","frequency":56.62650182723588,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.488087343690792,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[87]扰乱字符串","frequency":67.36118022692898,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5159557564055349,"acs":0,"articleLive":2,"columnArticles":3157,"formTitle":"[88]合并两个有序数组","frequency":97.56496837613527,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7098067763985885,"acs":0,"articleLive":2,"columnArticles":466,"formTitle":"[89]格雷编码","frequency":43.811617614286725,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6335697733566947,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[90]子集 II","frequency":71.41013257490299,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30592390101462724,"acs":0,"articleLive":2,"columnArticles":1486,"formTitle":"[91]解码方法","frequency":70.36349659747617,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5477311290897389,"acs":0,"articleLive":2,"columnArticles":1986,"formTitle":"[92]反转链表 II","frequency":87.35060627657202,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5386994554868642,"acs":0,"articleLive":2,"columnArticles":1296,"formTitle":"[93]复原 IP 地址","frequency":82.5130752022918,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559542995320115,"acs":0,"articleLive":2,"columnArticles":2245,"formTitle":"[94]二叉树的中序遍历","frequency":62.34250223111986,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.700730083132513,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[95]不同的二叉搜索树 II","frequency":60.75216750768161,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6991198632866111,"acs":0,"articleLive":2,"columnArticles":1251,"formTitle":"[96]不同的二叉搜索树","frequency":65.7509192891033,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4571769621008654,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[97]交错字符串","frequency":45.11533858127057,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.349159166626256,"acs":0,"articleLive":2,"columnArticles":1883,"formTitle":"[98]验证二叉搜索树","frequency":74.09660247386893,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.612607672851407,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[99]恢复二叉搜索树","frequency":56.76098687749841,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6034207694876266,"acs":0,"articleLive":2,"columnArticles":1849,"formTitle":"[100]相同的树","frequency":56.42932905857345,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5621057241760741,"acs":0,"articleLive":2,"columnArticles":2204,"formTitle":"[101]对称二叉树","frequency":74.5060188238583,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6419835951998432,"acs":0,"articleLive":2,"columnArticles":2443,"formTitle":"[102]二叉树的层序遍历","frequency":87.07188754402337,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716122836824186,"acs":0,"articleLive":2,"columnArticles":1549,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":79.54012173314008,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661264129624292,"acs":0,"articleLive":2,"columnArticles":2495,"formTitle":"[104]二叉树的最大深度","frequency":76.58609219560938,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.703985916679497,"acs":0,"articleLive":2,"columnArticles":1394,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":83.4558752086196,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7214559939638719,"acs":0,"articleLive":2,"columnArticles":859,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":72.03657792938478,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6959120600945805,"acs":0,"articleLive":2,"columnArticles":1284,"formTitle":"[107]二叉树的层序遍历 II","frequency":62.71477413927984,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7601326022378654,"acs":0,"articleLive":2,"columnArticles":1164,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":51.47390484590627,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7634417496608543,"acs":0,"articleLive":2,"columnArticles":709,"formTitle":"[109]有序链表转换二叉搜索树","frequency":56.84126440605384,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5630778072621309,"acs":0,"articleLive":2,"columnArticles":1429,"formTitle":"[110]平衡二叉树","frequency":61.42705952723356,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48491130610904515,"acs":0,"articleLive":2,"columnArticles":1746,"formTitle":"[111]二叉树的最小深度","frequency":46.23561835311511,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5256841888677978,"acs":0,"articleLive":2,"columnArticles":1629,"formTitle":"[112]路径总和","frequency":61.17447316903787,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6265930515185829,"acs":0,"articleLive":2,"columnArticles":1218,"formTitle":"[113]路径总和 II","frequency":63.21951785260078,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7254988429280012,"acs":0,"articleLive":2,"columnArticles":1290,"formTitle":"[114]二叉树展开为链表","frequency":45.62752635479236,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5229496453157214,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[115]不同的子序列","frequency":62.84815184992581,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7029380713748957,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":46.153443505845594,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6115685669397374,"acs":0,"articleLive":2,"columnArticles":735,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":27.74436690886687,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7276348466668527,"acs":0,"articleLive":2,"columnArticles":1695,"formTitle":"[118]杨辉三角","frequency":73.75287305718324,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6644909609895338,"acs":0,"articleLive":2,"columnArticles":1184,"formTitle":"[119]杨辉三角 II","frequency":56.689896739589216,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6797195375569177,"acs":0,"articleLive":2,"columnArticles":1542,"formTitle":"[120]三角形最小路径和","frequency":52.00394093460351,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734110312483324,"acs":0,"articleLive":2,"columnArticles":3311,"formTitle":"[121]买卖股票的最佳时机","frequency":87.67664189341363,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6882512364298948,"acs":0,"articleLive":2,"columnArticles":2590,"formTitle":"[122]买卖股票的最佳时机 II","frequency":67.47080571762461,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5348701852121313,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[123]买卖股票的最佳时机 III","frequency":65.32818980236745,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44373111025167233,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[124]二叉树中的最大路径和","frequency":85.40785092725325,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47363981883420264,"acs":0,"articleLive":2,"columnArticles":1804,"formTitle":"[125]验证回文串","frequency":68.04787215529728,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3940541359240106,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[126]单词接龙 II","frequency":34.72792558917025,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46748328508210396,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[127]单词接龙","frequency":50.646411098701435,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433108473102413,"acs":0,"articleLive":2,"columnArticles":1072,"formTitle":"[128]最长连续序列","frequency":79.86210368109995,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.68097188065519,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[129]求根节点到叶节点数字之和","frequency":61.70343195930902,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44361407517180157,"acs":0,"articleLive":2,"columnArticles":1149,"formTitle":"[130]被围绕的区域","frequency":53.242230603620044,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.723091672855037,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[131]分割回文串","frequency":73.35488120150548,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49212161562361295,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[132]分割回文串 II","frequency":45.11533858127057,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6753097990211392,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[133]克隆图","frequency":15.921126355027134,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.576575007062812,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[134]加油站","frequency":74.13974083556155,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48636856573604703,"acs":0,"articleLive":2,"columnArticles":769,"formTitle":"[135]分发糖果","frequency":85.61176115997962,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7194811074402908,"acs":0,"articleLive":2,"columnArticles":2212,"formTitle":"[136]只出现一次的数字","frequency":76.36254052655097,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7196581072021918,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[137]只出现一次的数字 II","frequency":73.57187396120386,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.659831844204374,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[138]复制带随机指针的链表","frequency":69.1790088146811,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5135023876173226,"acs":0,"articleLive":2,"columnArticles":1172,"formTitle":"[139]单词拆分","frequency":76.22237377231362,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4855516556168403,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[140]单词拆分 II","frequency":36.32495819865756,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5123758853602198,"acs":0,"articleLive":2,"columnArticles":2667,"formTitle":"[141]环形链表","frequency":77.15350449426657,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5519328181705017,"acs":0,"articleLive":2,"columnArticles":1676,"formTitle":"[142]环形链表 II","frequency":70.69642262518009,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6185185743501616,"acs":0,"articleLive":2,"columnArticles":1057,"formTitle":"[143]重排链表","frequency":90.69144936613661,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7027375099572933,"acs":0,"articleLive":2,"columnArticles":1793,"formTitle":"[144]二叉树的前序遍历","frequency":49.6429431469325,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7495626215475362,"acs":0,"articleLive":2,"columnArticles":1512,"formTitle":"[145]二叉树的后序遍历","frequency":69.33165816187392,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5266103057710273,"acs":0,"articleLive":2,"columnArticles":1355,"formTitle":"[146]LRU 缓存机制","frequency":91.4752844520972,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6808628548469776,"acs":0,"articleLive":2,"columnArticles":776,"formTitle":"[147]对链表进行插入排序","frequency":46.05676873252075,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.666943931792779,"acs":0,"articleLive":2,"columnArticles":1220,"formTitle":"[148]排序链表","frequency":76.22237377231362,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33812040356258544,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[149]直线上最多的点数","frequency":66.02806148125688,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362836825575013,"acs":0,"articleLive":2,"columnArticles":1024,"formTitle":"[150]逆波兰表达式求值","frequency":69.16000741757775,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4810637266071877,"acs":0,"articleLive":2,"columnArticles":1395,"formTitle":"[151]翻转字符串里的单词","frequency":53.962781627893484,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4207415621645216,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[152]乘积最大子数组","frequency":75.75623320777925,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5661841241592582,"acs":0,"articleLive":2,"columnArticles":1453,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":56.06475768515416,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319149953386083,"acs":0,"articleLive":2,"columnArticles":883,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":64.30723654647329,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5731484406043995,"acs":0,"articleLive":2,"columnArticles":1568,"formTitle":"[155]最小栈","frequency":71.45322290027805,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7239200367647058,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[156]上下翻转二叉树","frequency":24.77959965613308,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5311620426216325,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5913503971756399,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.426138519871788,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5439907993099482,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":39.07889161373655,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6127911513987273,"acs":0,"articleLive":2,"columnArticles":1922,"formTitle":"[160]相交链表","frequency":67.74746966586822,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3366038424679414,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":5.830085131237878,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49470620643399527,"acs":0,"articleLive":2,"columnArticles":720,"formTitle":"[162]寻找峰值","frequency":59.636905978913646,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3241576745210306,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[163]缺失的区间","frequency":17.18031537567092,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106454316848282,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[164]最大间距","frequency":58.25729901067792,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5184520982778875,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[165]比较版本号","frequency":55.85145115538555,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2985782530869124,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[166]分数到小数","frequency":51.92147421490737,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5864785834190719,"acs":0,"articleLive":2,"columnArticles":1847,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":65.18535797502142,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325517573675362,"acs":0,"articleLive":2,"columnArticles":741,"formTitle":"[168]Excel表列名称","frequency":58.58594013202338,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6647665221709989,"acs":0,"articleLive":2,"columnArticles":2139,"formTitle":"[169]多数元素","frequency":68.87708273400975,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41679618952118325,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":4.712374071363843,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7175510204081633,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[171]Excel 表列序号","frequency":49.01688628563306,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4383300026579774,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[172]阶乘后的零","frequency":44.715015706111224,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8035817195298314,"acs":0,"articleLive":2,"columnArticles":615,"formTitle":"[173]二叉搜索树迭代器","frequency":48.41001293846093,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4798563357959048,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[174]地下城游戏","frequency":63.130480200387176,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7398589854510377,"acs":0,"articleLive":2,"columnArticles":1443,"formTitle":"[175]组合两个表","frequency":93.36116106579861,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35610304128112236,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[176]第二高的薪水","frequency":91.3638564951015,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4624857578313431,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[177]第N高的薪水","frequency":75.75623320777925,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6029564476936178,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[178]分数排名","frequency":67.82561127846877,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097783775367208,"acs":0,"articleLive":2,"columnArticles":945,"formTitle":"[179]最大数","frequency":81.72877467106974,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48711641667813405,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[180]连续出现的数字","frequency":67.69183651869848,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7028232125907776,"acs":0,"articleLive":2,"columnArticles":657,"formTitle":"[181]超过经理收入的员工","frequency":68.6471737695639,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.797501940328141,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[182]查找重复的电子邮箱","frequency":60.55114693085799,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6773878917029922,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[183]从不订购的客户","frequency":46.05676873252075,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47501380452788516,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[184]部门工资最高的员工","frequency":73.35488120150548,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4941079255586693,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[185]部门工资前三高的所有员工","frequency":74.27453074715406,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7540765049738488,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[186]翻转字符串里的单词 II","frequency":5.830085131237878,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48351102537742713,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[187]重复的DNA序列","frequency":30.906917707035465,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3902406381327123,"acs":0,"articleLive":2,"columnArticles":675,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":51.79023263927201,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45214253928045733,"acs":0,"articleLive":2,"columnArticles":1641,"formTitle":"[189]旋转数组","frequency":64.00613313807096,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6966136760170045,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[190]颠倒二进制位","frequency":49.282778853724466,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7479220487476131,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[191]位1的个数","frequency":60.81260140752165,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.355816552943728,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[192]统计词频","frequency":56.21302939434779,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3242696600806503,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[193]有效电话号码","frequency":35.694620390120726,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34502127659574466,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":23.464938834974102,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43620018951673234,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":52.590951865619736,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6651681472932715,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[196]删除重复的电子邮箱","frequency":56.689896739589216,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339087904364141,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[197]上升的温度","frequency":56.13003699030992,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5133418615668376,"acs":0,"articleLive":2,"columnArticles":2597,"formTitle":"[198]打家劫舍","frequency":80.11820050612644,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6522776644847863,"acs":0,"articleLive":2,"columnArticles":1550,"formTitle":"[199]二叉树的右视图","frequency":83.05297773481198,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.553755965121507,"acs":0,"articleLive":2,"columnArticles":2073,"formTitle":"[200]岛屿数量","frequency":89.57450853321173,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5230469967436512,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[201]数字范围按位与","frequency":36.97699908685729,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6183469484745179,"acs":0,"articleLive":2,"columnArticles":1350,"formTitle":"[202]快乐数","frequency":62.34250223111986,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5144077937737503,"acs":0,"articleLive":2,"columnArticles":1613,"formTitle":"[203]移除链表元素","frequency":54.98626763601262,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37871208430259823,"acs":0,"articleLive":2,"columnArticles":723,"formTitle":"[204]计数质数","frequency":52.365288603579785,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5008842883947248,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[205]同构字符串","frequency":49.6429431469325,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7227790069062312,"acs":0,"articleLive":2,"columnArticles":7260,"formTitle":"[206]反转链表","frequency":90.7087361101591,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5445652259595298,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[207]课程表","frequency":72.09895939218521,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7164862081157668,"acs":0,"articleLive":2,"columnArticles":940,"formTitle":"[208]实现 Trie (前缀树)","frequency":69.79655419941115,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4705510456970892,"acs":0,"articleLive":2,"columnArticles":1324,"formTitle":"[209]长度最小的子数组","frequency":53.87980405397117,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5417764735933811,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[210]课程表 II","frequency":47.77663614785786,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4817388356918905,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":30.340282799154465,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.44972814171709197,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[212]单词搜索 II","frequency":40.05552799867142,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329022046108729,"acs":0,"articleLive":2,"columnArticles":1482,"formTitle":"[213]打家劫舍 II","frequency":72.31983468999518,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37103662950629795,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[214]最短回文串","frequency":57.67890019751872,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6467797256385855,"acs":0,"articleLive":2,"columnArticles":2240,"formTitle":"[215]数组中的第K个最大元素","frequency":89.67680410147413,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7381992973539789,"acs":0,"articleLive":2,"columnArticles":995,"formTitle":"[216]组合总和 III","frequency":65.64922197202091,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5604512722035526,"acs":0,"articleLive":2,"columnArticles":1628,"formTitle":"[217]存在重复元素","frequency":75.4296211352779,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5428073756070096,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[218]天际线问题","frequency":63.853938619815885,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4251216265564076,"acs":0,"articleLive":2,"columnArticles":863,"formTitle":"[219]存在重复元素 II","frequency":47.937575136429864,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28675381893033836,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":62.71477413927984,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47450401072333376,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[221]最大正方形","frequency":74.17266900969744,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7803824162819339,"acs":0,"articleLive":2,"columnArticles":863,"formTitle":"[222]完全二叉树的节点个数","frequency":40.73529753464515,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4618821686857985,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[223]矩形面积","frequency":43.42143122754762,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4179166591275083,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[224]基本计算器","frequency":72.80233142523765,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754904471648825,"acs":0,"articleLive":2,"columnArticles":4733,"formTitle":"[225]用队列实现栈","frequency":46.73601211983524,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7875370683120786,"acs":0,"articleLive":2,"columnArticles":1823,"formTitle":"[226]翻转二叉树","frequency":75.65014466705603,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4369419208053482,"acs":0,"articleLive":2,"columnArticles":693,"formTitle":"[227]基本计算器 II","frequency":70.4535154113348,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.581471208485264,"acs":0,"articleLive":2,"columnArticles":629,"formTitle":"[228]汇总区间","frequency":16.538489277352273,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46336385267949515,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[229]求众数 II","frequency":39.39895017550606,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7406684759477998,"acs":0,"articleLive":2,"columnArticles":836,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":40.223235279144056,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5036392658605431,"acs":0,"articleLive":2,"columnArticles":1184,"formTitle":"[231]2 的幂","frequency":42.47150139022436,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6913547695126584,"acs":0,"articleLive":2,"columnArticles":1236,"formTitle":"[232]用栈实现队列","frequency":57.472618019043864,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4764222137587632,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[233]数字 1 的个数","frequency":60.09902598388349,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49435465148597085,"acs":0,"articleLive":2,"columnArticles":1935,"formTitle":"[234]回文链表","frequency":78.0524221149103,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6661518331939549,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":56.095557624377044,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6802121915150529,"acs":0,"articleLive":2,"columnArticles":1346,"formTitle":"[236]二叉树的最近公共祖先","frequency":74.15165701687366,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481411233837877,"acs":0,"articleLive":2,"columnArticles":1005,"formTitle":"[237]删除链表中的节点","frequency":52.71146093653979,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7227259385756597,"acs":0,"articleLive":2,"columnArticles":845,"formTitle":"[238]除自身以外数组的乘积","frequency":54.34797075926099,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4963294263618504,"acs":0,"articleLive":2,"columnArticles":1287,"formTitle":"[239]滑动窗口最大值","frequency":66.02806148125688,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4755768001394781,"acs":0,"articleLive":2,"columnArticles":729,"formTitle":"[240]搜索二维矩阵 II","frequency":62.14968391864593,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7373101326667948,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[241]为运算表达式设计优先级","frequency":56.21302939434779,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6443959671113968,"acs":0,"articleLive":2,"columnArticles":1627,"formTitle":"[242]有效的字母异位词","frequency":57.799298173958036,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6558769513314968,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5477953742736699,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6076833527357393,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4743150684931507,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5224672352818805,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46332737030411447,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.638322387371817,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6331482022800351,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[250]统计同值子树","frequency":5.259426648139519,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5432789432789433,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":15.921126355027134,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.561617145640526,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[252]会议室","frequency":5.830085131237878,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4985979869361557,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[253]会议室 II","frequency":54.10583346148277,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5680209997717416,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[254]因子的组合","frequency":17.18031537567092,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4726046642315257,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6351542598358336,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[256]粉刷房子","frequency":6.426138519871788,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6812153801620049,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[257]二叉树的所有路径","frequency":62.60429081434295,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6919273941014437,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[258]各位相加","frequency":47.24945846645417,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.565400495458299,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.830085131237878,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7251543716041812,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[260]只出现一次的数字 III","frequency":50.28940267153621,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49528556843432825,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[261]以图判树","frequency":23.464938834974102,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43718880759251033,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[262]行程和用户","frequency":61.79149525508283,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515165011575037,"acs":0,"articleLive":2,"columnArticles":826,"formTitle":"[263]丑数","frequency":56.168897052060004,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.579232187205491,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[264]丑数 II","frequency":64.76277097507577,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5831521739130435,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[265]粉刷房子 II","frequency":5.259426648139519,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6716510903426791,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4464309719048259,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":5.830085131237878,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6238833741675297,"acs":0,"articleLive":2,"columnArticles":1071,"formTitle":"[268]丢失的数字","frequency":30.340282799154465,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3386164768036982,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5517422211863419,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.538489277352273,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5520586333261479,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6457364341085271,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":7.702640064275236,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30925449871465294,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[273]整数转换英文表示","frequency":29.65577302110651,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404179561412266,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[274]H 指数","frequency":56.84126440605384,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4625626407981242,"acs":0,"articleLive":2,"columnArticles":413,"formTitle":"[275]H 指数 II","frequency":33.36523851156228,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4869546772254826,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[276]栅栏涂色","frequency":24.77959965613308,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.569191638184564,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[277]搜寻名人","frequency":5.259426648139519,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45477987454787844,"acs":0,"articleLive":2,"columnArticles":984,"formTitle":"[278]第一个错误的版本","frequency":69.3699989721214,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6310473186522708,"acs":0,"articleLive":2,"columnArticles":1170,"formTitle":"[279]完全平方数","frequency":72.90799464131868,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6868852459016394,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.538489277352273,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7574906367041199,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3882346497233938,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6388494598754921,"acs":0,"articleLive":2,"columnArticles":3256,"formTitle":"[283]移动零","frequency":76.9026491785035,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7337966349670813,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[284]顶端迭代器","frequency":16.538489277352273,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6351373446697187,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5072686925410986,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[286]墙与门","frequency":5.830085131237878,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6614359342256791,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[287]寻找重复数","frequency":61.42705952723356,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.428135722455204,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.753287531146927,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[289]生命游戏","frequency":15.921126355027134,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570665699174041,"acs":0,"articleLive":2,"columnArticles":1069,"formTitle":"[290]单词规律","frequency":28.359367594904178,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5333188626003907,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6961559698583863,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[292]Nim 游戏","frequency":39.39895017550606,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7111441307578009,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":5.259426648139519,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5857047204553063,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5232376936474471,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[295]数据流的中位数","frequency":39.347380659857734,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6217208814270724,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":17.848409844356635,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5587415154187918,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[297]二叉树的序列化与反序列化","frequency":58.58594013202338,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5783472290338402,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5039199049720007,"acs":0,"articleLive":2,"columnArticles":353,"formTitle":"[299]猜数字游戏","frequency":22.842981762771895,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5129752018257491,"acs":0,"articleLive":2,"columnArticles":1938,"formTitle":"[300]最长递增子序列","frequency":78.70651599790085,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.521997074725961,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[301]删除无效的括号","frequency":51.64902237772383,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6644917582417582,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7248496880317641,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":47.937575136429864,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5429217198589357,"acs":0,"articleLive":2,"columnArticles":550,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":39.39895017550606,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.37859703962489655,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":5.259426648139519,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3372765294407086,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[306]累加数","frequency":39.07889161373655,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5428584684621988,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[307]区域和检索 - 数组可修改","frequency":20.031626952889315,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.605771924908938,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6059732256807053,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":69.298052147904,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3798111190306486,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[310]最小高度树","frequency":45.62752635479236,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7618835081455032,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":16.538489277352273,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6828661675827592,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[312]戳气球","frequency":51.92147421490737,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6412236934689439,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[313]超级丑数","frequency":56.84126440605384,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.543788702135726,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41853939685027425,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":55.51827740437165,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47660393467769363,"acs":0,"articleLive":2,"columnArticles":517,"formTitle":"[316]去除重复字母","frequency":56.689896739589216,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48454340874096885,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6837330332653492,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[318]最大单词长度乘积","frequency":5.259426648139519,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5172318910366651,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[319]灯泡开关","frequency":16.538489277352273,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6742990654205607,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42544235968334654,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[321]拼接最大数","frequency":31.051348852825445,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4438286948985242,"acs":0,"articleLive":2,"columnArticles":1781,"formTitle":"[322]零钱兑换","frequency":80.93464940681694,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.630745627493096,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[323]无向图中连通分量的数目","frequency":34.03418856093366,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3782157961433348,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":39.07889161373655,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5386887182516243,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":34.03418856093366,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4896539687591436,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[326]3的幂","frequency":29.65577302110651,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42292909441903337,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[327]区间和的个数","frequency":39.83416771907456,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6564975569185986,"acs":0,"articleLive":2,"columnArticles":1046,"formTitle":"[328]奇偶链表","frequency":61.72764317648507,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4836949287900972,"acs":0,"articleLive":2,"columnArticles":480,"formTitle":"[329]矩阵中的最长递增路径","frequency":54.799629724060395,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5339486014482465,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[330]按要求补齐数组","frequency":32.71944499693893,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47999482485364037,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[331]验证二叉树的前序序列化","frequency":30.340282799154465,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4489681902301058,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[332]重新安排行程","frequency":48.650533722148445,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4680872966851966,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[333]最大 BST 子树","frequency":17.848409844356635,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4128298656344214,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[334]递增的三元子序列","frequency":23.464938834974102,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3676489348131139,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4011627906976744,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[336]回文对","frequency":35.44825801062081,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6083774845530556,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[337]打家劫舍 III","frequency":69.79655419941115,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869555108518747,"acs":0,"articleLive":2,"columnArticles":1343,"formTitle":"[338]比特位计数","frequency":57.67890019751872,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8079484902309059,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49387009825232586,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":30.340282799154465,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270217532702176,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":69.79655419941115,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5155354722096701,"acs":0,"articleLive":2,"columnArticles":758,"formTitle":"[342]4的幂","frequency":45.94138348637294,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.604971606250604,"acs":0,"articleLive":2,"columnArticles":1020,"formTitle":"[343]整数拆分","frequency":67.69183651869848,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7664311442416495,"acs":0,"articleLive":2,"columnArticles":1868,"formTitle":"[344]反转字符串","frequency":64.54382746854499,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5391901790901513,"acs":0,"articleLive":2,"columnArticles":1020,"formTitle":"[345]反转字符串中的元音字母","frequency":28.996011352404967,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7062240663900415,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.621930835369946,"acs":0,"articleLive":2,"columnArticles":1448,"formTitle":"[347]前 K 个高频元素","frequency":75.90385808868815,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6000510790448219,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7385898134325718,"acs":0,"articleLive":2,"columnArticles":1464,"formTitle":"[349]两个数组的交集","frequency":65.03305252683535,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5497019667447993,"acs":0,"articleLive":2,"columnArticles":1338,"formTitle":"[350]两个数组的交集 II","frequency":63.676940992185635,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5893789578935674,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":11.386140572883487,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5919548147127703,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4223804679552391,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":8.387823251226841,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4517114793134239,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[354]俄罗斯套娃信封问题","frequency":70.5226944951857,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40696462413139606,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[355]设计推特","frequency":34.72792558917025,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35098265895953756,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5196951532796712,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.0781862781592,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3507764477515367,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.725050916496945,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6079081069140712,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":6.426138519871788,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5611972207375735,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6924428822495606,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":5.830085131237878,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.490564618070186,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":55.51827740437165,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7199675324675324,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3644515577382649,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[365]水壶问题","frequency":45.94138348637294,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7632014719411223,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4394174882553386,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[367]有效的完全平方数","frequency":16.538489277352273,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45913088174494093,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[368]最大整除子集","frequency":68.31865213199609,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6163865546218488,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7190635451505016,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":16.538489277352273,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5801193780340131,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[371]两整数之和","frequency":48.51897816938013,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5094269458183035,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":7.049580196459441,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.42236602891524544,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[373]查找和最小的K对数字","frequency":42.171112188327655,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5146664982314301,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[374]猜数字大小","frequency":33.36523851156228,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46904222856580374,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":34.03418856093366,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4627640996005563,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[376]摆动序列","frequency":31.491563468370405,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5071458202848567,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[377]组合总和 Ⅳ","frequency":62.43187882153545,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6388071862142013,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":55.51827740437165,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6437887534744494,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5021543985637343,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":28.996011352404967,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4421889537342468,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6292277976410636,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.77959965613308,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5973178553934028,"acs":0,"articleLive":2,"columnArticles":718,"formTitle":"[383]赎金信","frequency":3.197492475500808,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5769648009232544,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[384]打乱数组","frequency":51.27374033037454,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4151443554428629,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.259426648139519,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7474932577276814,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[386]字典序排数","frequency":56.168897052060004,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5318698252411791,"acs":0,"articleLive":2,"columnArticles":1161,"formTitle":"[387]字符串中的第一个唯一字符","frequency":61.10287966241359,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5252707581227437,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":5.259426648139519,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6921019652321242,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[389]找不同","frequency":23.464938834974102,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46675252491018776,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":39.07889161373655,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3575618262523779,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5147942430588346,"acs":0,"articleLive":2,"columnArticles":1546,"formTitle":"[392]判断子序列","frequency":54.277044701817175,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3916774378859687,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":33.36523851156228,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5515772804152982,"acs":0,"articleLive":2,"columnArticles":1271,"formTitle":"[394]字符串解码","frequency":84.76277987475605,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.520440879710724,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.21302939434779,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4257258609047941,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.377628195431856,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[397]整数替换","frequency":22.24258952448678,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6550069864927807,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[398]随机数索引","frequency":37.65221825153508,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.592429248671168,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[399]除法求值","frequency":23.464938834974102,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4142996410688173,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":44.12948524319125,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140174611973392,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[401]二进制手表","frequency":46.584553024890646,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32769589408816846,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[402]移掉 K 位数字","frequency":67.03578880331061,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45607682143253414,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[403]青蛙过河","frequency":68.91621276863175,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5822304881622303,"acs":0,"articleLive":2,"columnArticles":1096,"formTitle":"[404]左叶子之和","frequency":53.68409936914155,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5222659384970736,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[405]数字转换为十六进制数","frequency":47.24945846645417,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7363640966570043,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[406]根据身高重建队列","frequency":57.933921851696525,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4842141218952813,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":47.937575136429864,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32431919536957965,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.555973089278138,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[409]最长回文串","frequency":64.43496441960197,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5628228714401354,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[410]分割数组的最大值","frequency":73.95216134450973,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49743589743589745,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6734998553740215,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[412]Fizz Buzz","frequency":24.109934946968394,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6870003787652254,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[413]等差数列划分","frequency":54.19696406811951,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36423214729579806,"acs":0,"articleLive":2,"columnArticles":827,"formTitle":"[414]第三大的数","frequency":23.464938834974102,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5371375291375291,"acs":0,"articleLive":2,"columnArticles":1050,"formTitle":"[415]字符串相加","frequency":87.62462370672763,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.506782041408055,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[416]分割等和子集","frequency":73.29740134190652,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47832993375331684,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[417]太平洋大西洋水流问题","frequency":56.93263409680947,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3595737366792712,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7554011853929004,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[419]甲板上的战舰","frequency":4.712374071363843,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2069097594607017,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":20.031626952889315,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223635500711913,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":59.50297259524958,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42702104097452936,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5691817362987598,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5305936073059361,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[424]替换后的最长重复字符","frequency":63.130480200387176,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6109510086455331,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6679146008297075,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":28.996011352404967,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.613345521023766,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6495507060333762,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6984204966960623,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[429]N 叉树的层序遍历","frequency":32.71944499693893,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.54220549605981,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[430]扁平化多级双向链表","frequency":30.340282799154465,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7285587975243147,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.377698681293033,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":27.74436690886687,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5326992910254194,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":4.187315920688197,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37395746352964293,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[434]字符串中的单词数","frequency":24.109934946968394,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5091278899457798,"acs":0,"articleLive":2,"columnArticles":821,"formTitle":"[435]无重叠区间","frequency":60.81260140752165,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48573069193224233,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":4.712374071363843,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5667723371332202,"acs":0,"articleLive":2,"columnArticles":809,"formTitle":"[437]路径总和 III","frequency":47.82121000217959,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5174395334210075,"acs":0,"articleLive":2,"columnArticles":776,"formTitle":"[438]找到字符串中所有字母异位词","frequency":47.24945846645417,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5895630565334438,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3799942990165804,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":68.36963718835632,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42571584426631165,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[441]排列硬币","frequency":15.921126355027134,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.697201942453173,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[442]数组中重复的数据","frequency":63.130480200387176,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.477024636493075,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[443]压缩字符串","frequency":42.106420976860484,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2504550970873786,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.544782681751272,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5880538234328848,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[445]两数相加 II","frequency":69.79655419941115,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5517520761596111,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":45.11533858127057,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6046924685593148,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6478359335681932,"acs":0,"articleLive":2,"columnArticles":1047,"formTitle":"[448]找到所有数组中消失的数字","frequency":60.09902598388349,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5560563170441001,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4853708457060412,"acs":0,"articleLive":2,"columnArticles":594,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.715015706111224,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7113992869875223,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[451]根据字符出现频率排序","frequency":61.10287966241359,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093764791008155,"acs":0,"articleLive":2,"columnArticles":824,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.18567730825995,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5544700883186136,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[453]最小操作次数使数组元素相等","frequency":22.842981762771895,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6009169278996865,"acs":0,"articleLive":2,"columnArticles":474,"formTitle":"[454]四数相加 II","frequency":56.84126440605384,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5773844925812308,"acs":0,"articleLive":2,"columnArticles":1202,"formTitle":"[455]分发饼干","frequency":56.689896739589216,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625369264309395,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[456]132 模式","frequency":72.56097721770296,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4352460527124163,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":50.95760396809148,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6088802732391766,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":16.538489277352273,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115228346041211,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[459]重复的子字符串","frequency":54.00119521086948,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43937470772930726,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[460]LFU 缓存","frequency":60.371470716515375,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8119792784531034,"acs":0,"articleLive":2,"columnArticles":1329,"formTitle":"[461]汉明距离","frequency":56.62650182723588,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6025539409951564,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":37.65221825153508,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7142803418481991,"acs":0,"articleLive":2,"columnArticles":907,"formTitle":"[463]岛屿的周长","frequency":34.03418856093366,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3583110318168302,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":36.97699908685729,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.531667237247518,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3735719602576135,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":7.049580196459441,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.440964853253274,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.18031537567092,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24984642935229628,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[468]验证IP地址","frequency":50.95760396809148,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43441381399575885,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":25.47574048097743,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.546174826738207,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":44.600310293023554,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6156530408773679,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":14.75343628308859,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40255066607740386,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4204804307310002,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[473]火柴拼正方形","frequency":36.97699908685729,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6107575719764086,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[474]一和零","frequency":62.60429081434295,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33029988294838186,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":29.65577302110651,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011485595932969,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[476]数字的补数","frequency":5.259426648139519,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039760374141679,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":47.24945846645417,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43767898540842765,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":29.65577302110651,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41432545201668985,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":10.62619446187706,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4482509640053462,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":41.43988940140756,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5361273104675299,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.259426648139519,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4260703019378098,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[482]密钥格式化","frequency":15.32659934056083,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5900733874082658,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":34.03418856093366,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6404545454545455,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6065783485867422,"acs":0,"articleLive":2,"columnArticles":975,"formTitle":"[485]最大连续 1 的个数","frequency":49.6429431469325,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5870112434972311,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[486]预测赢家","frequency":44.86417912758058,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5767826460481099,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[487]最大连续1的个数 II","frequency":36.32495819865756,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38700045934772626,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7173308619091752,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48154449293586804,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[490]迷宫","frequency":16.538489277352273,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5472473984558577,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[491]递增子序列","frequency":50.28940267153621,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5512898112119902,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[492]构造矩形","frequency":5.259426648139519,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.344499815430048,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":36.197199088388054,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49551452991452993,"acs":0,"articleLive":2,"columnArticles":1010,"formTitle":"[494]目标和","frequency":75.90385808868815,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5419988947659272,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[495]提莫攻击","frequency":29.65577302110651,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6874874026091369,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[496]下一个更大元素 I","frequency":42.5895861019714,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.404627539503386,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4638807547502147,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[498]对角线遍历","frequency":51.54876687196028,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3705452984113353,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7088065493091047,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[500]键盘行","frequency":15.921126355027134,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5118393285564123,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[501]二叉搜索树中的众数","frequency":46.584553024890646,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4405893242826288,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[502]IPO","frequency":29.433186606910322,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.634586827255436,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[503]下一个更大元素 II","frequency":47.24945846645417,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.504570260361228,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[504]七进制数","frequency":23.464938834974102,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48277684785481456,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":17.18031537567092,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.564379904097646,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[506]相对名次","frequency":4.712374071363843,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4110000429018834,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[507]完美数","frequency":16.538489277352273,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6758389578515127,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.18031537567092,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6761944741260876,"acs":0,"articleLive":2,"columnArticles":1421,"formTitle":"[509]斐波那契数","frequency":62.60429081434295,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6082139446036294,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":7.049580196459441,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337075520522314,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[511]游戏玩法分析 I","frequency":37.65221825153508,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5382304666935059,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[512]游戏玩法分析 II","frequency":5.259426648139519,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7306985294117647,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[513]找树左下角的值","frequency":5.259426648139519,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.501217049044487,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[514]自由之路","frequency":49.875591007440114,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6438905351228865,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[515]在每个树行中找最大值","frequency":29.65577302110651,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6526075849872274,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[516]最长回文子序列","frequency":57.799298173958036,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4399574920297556,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.653378386929395,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[518]零钱兑换 II","frequency":69.79655419941115,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3949795856646,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":20.031626952889315,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5634230543339684,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[520]检测大写字母","frequency":5.259426648139519,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7126714863095577,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":15.921126355027134,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36012792021247764,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":15.921126355027134,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2743417990488718,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[523]连续的子数组和","frequency":56.84126440605384,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4724955676396045,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":31.790984195026773,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5366465194588113,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[525]连续数组","frequency":67.82561127846877,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7349235226736743,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[526]优美的排列","frequency":35.084646696173635,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5771614045441134,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4767670207666497,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[528]按权重随机选择","frequency":23.813798606727087,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.646090398661742,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":33.36523851156228,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6207318654949902,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":4.712374071363843,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.661068429515812,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3732403807480896,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.538489277352273,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5227123107307439,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6754813611070074,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[534]游戏玩法分析 III","frequency":15.921126355027134,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.841432363616664,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[535]TinyURL 的加密与解密","frequency":23.464938834974102,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.53470715835141,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":9.866248350870627,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125069689648764,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":4.187315920688197,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6976329187004671,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":36.4167452872137,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5960825371897222,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[539]最小时间差","frequency":33.36523851156228,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5803574232859072,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[540]有序数组中的单一元素","frequency":46.584553024890646,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6082862034971204,"acs":0,"articleLive":2,"columnArticles":781,"formTitle":"[541]反转字符串 II","frequency":28.2036428687456,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45865508253692444,"acs":0,"articleLive":2,"columnArticles":617,"formTitle":"[542]01 矩阵","frequency":45.11533858127057,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5503463094612202,"acs":0,"articleLive":2,"columnArticles":1208,"formTitle":"[543]二叉树的直径","frequency":73.32950261865044,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7083071113908118,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4170704435333582,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6307802857384395,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.47574048097743,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6183837909723852,"acs":0,"articleLive":2,"columnArticles":1105,"formTitle":"[547]省份数量","frequency":47.24945846645417,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3563636363636364,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":11.386140572883487,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4833530106257379,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4386085821030868,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":29.65577302110651,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5673386232039459,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[551]学生出勤记录 I","frequency":20.424868045697817,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5787397740553175,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.289990987410324,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.602510460251046,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":5.259426648139519,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5019176795518333,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[554]砖墙","frequency":61.069054968274415,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3422208281053952,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32577409507195815,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":47.24945846645417,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.745629264942715,"acs":0,"articleLive":2,"columnArticles":1247,"formTitle":"[557]反转字符串中的单词 III","frequency":60.397861494186685,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5036893886156009,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7275976481495036,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[559]N 叉树的最大深度","frequency":31.491563468370405,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44663936623559103,"acs":0,"articleLive":2,"columnArticles":889,"formTitle":"[560]和为 K 的子数组","frequency":81.48161719314825,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7741608480219521,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[561]数组拆分 I","frequency":14.75343628308859,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4622431294874969,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6050814481364208,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[563]二叉树的坡度","frequency":4.712374071363843,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17924021330246787,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[564]寻找最近的回文数","frequency":24.77959965613308,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6116296393672495,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[565]数组嵌套","frequency":15.921126355027134,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6940304808544772,"acs":0,"articleLive":2,"columnArticles":615,"formTitle":"[566]重塑矩阵","frequency":28.996011352404967,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43080911990332477,"acs":0,"articleLive":2,"columnArticles":1027,"formTitle":"[567]字符串的排列","frequency":55.51827740437165,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.503968253968254,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5635544881416992,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":29.65577302110651,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6626949740034662,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[570]至少有5名直接下属的经理","frequency":15.32659934056083,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4881068507541082,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":5.830085131237878,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47379055806022097,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[572]另一棵树的子树","frequency":49.01688628563306,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6605141727092947,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6480321285140562,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6846819946252612,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[575]分糖果","frequency":28.996011352404967,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4697404207293382,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":24.951077846249888,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7058011049723757,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[577]员工奖金","frequency":23.464938834974102,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4975302154492906,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[578]查询回答率最高的问题","frequency":5.259426648139519,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.412485316328243,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":26.200369779545174,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5244417622208811,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[580]统计各专业学生人数","frequency":15.921126355027134,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4043728635068159,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[581]最短无序连续子数组","frequency":61.069054968274415,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40488962734393547,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5866204690831557,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[583]两个字符串的删除操作","frequency":45.11533858127057,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7743153918791312,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5949225729600953,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7491879601559116,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[586]订单最多的客户","frequency":24.109934946968394,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38248337028824836,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":8.387823251226841,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42660970399755876,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":9.107957057919515,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451966473243069,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[589]N 叉树的前序遍历","frequency":42.73820845667335,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.76013480027753,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[590]N 叉树的后序遍历","frequency":15.32659934056083,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3403755868544601,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5212651251946807,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44113304533275005,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[593]有效的正方形","frequency":23.464938834974102,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5169266088477517,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[594]最长和谐子序列","frequency":5.259426648139519,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7964549413101099,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[595]大的国家","frequency":39.39895017550606,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42076459180149306,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[596]超过5名学生的课","frequency":22.842981762771895,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44121081469505075,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":15.921126355027134,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5175037049234316,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[598]范围求和 II","frequency":15.921126355027134,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220328915617923,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[599]两个列表的最小索引总和","frequency":15.921126355027134,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4769806094182826,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[600]不含连续1的非负整数","frequency":7.702640064275236,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4987745694762299,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[601]体育馆的人流量","frequency":51.92147421490737,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6280690381654647,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.18031537567092,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6713302242949145,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[603]连续空余座位","frequency":24.109934946968394,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37215954234864135,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":5.830085131237878,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3345666276820233,"acs":0,"articleLive":2,"columnArticles":1240,"formTitle":"[605]种花问题","frequency":53.43525790531313,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5684345594525235,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[606]根据二叉树创建字符串","frequency":4.712374071363843,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6637056564846123,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.259426648139519,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6577950198484301,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[608]树节点","frequency":4.712374071363843,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4841330094139083,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6670221985200987,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[610]判断三角形","frequency":5.830085131237878,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.531991716091817,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[611]有效三角形的个数","frequency":76.76835427550878,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6681813878632964,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[612]平面上的最近距离","frequency":5.830085131237878,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8169466764061358,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":4.712374071363843,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3464935760171306,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[614]二级关注者","frequency":16.538489277352273,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42462079946367215,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.45977521443359953,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":34.03418856093366,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881441035695499,"acs":0,"articleLive":2,"columnArticles":1196,"formTitle":"[617]合并二叉树","frequency":63.038977476169265,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6195149306042338,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":16.538489277352273,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4658414357305007,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.259426648139519,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.772878825156315,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[620]有趣的电影","frequency":40.05552799867142,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5695919633447196,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[621]任务调度器","frequency":62.84815184992581,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4365665721597925,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[622]设计循环队列","frequency":47.24945846645417,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5453806694093148,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4164544564152791,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34054054054054056,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6830167061482961,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[626]换座位","frequency":42.0781862781592,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8075836718901142,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[627]变更性别","frequency":28.996011352404967,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5252294189830871,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[628]三个数的最大乘积","frequency":32.71944499693893,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40407915993537963,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":25.47574048097743,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36757016647635077,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":6.426138519871788,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.284705243140451,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5969565913823482,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[632]最小区间","frequency":16.538489277352273,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3990886202555657,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[633]平方数之和","frequency":63.130480200387176,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44014430960970813,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5563451776649746,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5499134448932487,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":5.259426648139519,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6894127886625734,"acs":0,"articleLive":2,"columnArticles":635,"formTitle":"[637]二叉树的层平均值","frequency":21.101267563722896,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5927257348276591,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":5.259426648139519,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3095273594751752,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[639]解码方法 II","frequency":28.996011352404967,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42419039252485724,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[640]求解方程","frequency":22.842981762771895,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5327835471390755,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[641]设计循环双端队列","frequency":14.75343628308859,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4895528625156707,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":9.107957057919515,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.451515261233209,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[643]子数组最大平均数 I","frequency":37.65221825153508,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.39855595667870036,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4352316241409987,"acs":0,"articleLive":2,"columnArticles":688,"formTitle":"[645]错误的集合","frequency":41.43988940140756,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5755257616547166,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[646]最长数对链","frequency":3.682795638898352,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6563580484056858,"acs":0,"articleLive":2,"columnArticles":889,"formTitle":"[647]回文子串","frequency":58.11807393050103,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5828174245835209,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[648]单词替换","frequency":5.830085131237878,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4816593303988262,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":4.712374071363843,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5358145060527232,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[650]只有两个键的键盘","frequency":16.538489277352273,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5803940260565618,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5710861011986458,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[652]寻找重复的子树","frequency":52.78642770627161,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5960772434683832,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8098797530061749,"acs":0,"articleLive":2,"columnArticles":584,"formTitle":"[654]最大二叉树","frequency":43.811617614286725,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5960956123961085,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.538489277352273,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30754716981132074,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834413926648105,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":5.259426648139519,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4537744149216963,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[658]找到 K 个最接近的元素","frequency":30.340282799154465,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5417494071603463,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[659]分割数组为连续子序列","frequency":4.712374071363843,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.65,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":14.75343628308859,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5604076697184315,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[661]图片平滑器","frequency":5.259426648139519,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40720975174669244,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[662]二叉树最大宽度","frequency":52.78642770627161,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4614343707713126,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.655300644774329,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":54.10583346148277,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2702821530243243,"acs":0,"articleLive":2,"columnArticles":925,"formTitle":"[665]非递减数列","frequency":49.875591007440114,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6186699206833435,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242376237623762,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":15.32659934056083,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5077016928473387,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[668]乘法表中第k小的数","frequency":34.72792558917025,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6665079969535415,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[669]修剪二叉搜索树","frequency":23.464938834974102,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4498557357476868,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[670]最大交换","frequency":61.069054968274415,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48650718233063633,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[671]二叉树中第二小的节点","frequency":46.584553024890646,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5502008032128514,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[672]灯泡开关 Ⅱ","frequency":4.712374071363843,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3917999457847655,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[673]最长递增子序列的个数","frequency":53.87980405397117,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4933123091003319,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[674]最长连续递增序列","frequency":35.084646696173635,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3997445721583653,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":6.426138519871788,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5882352941176471,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6163805954256996,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.5413877900138993,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[679]24 点游戏","frequency":69.79655419941115,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015177794990472,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":46.64407965750704,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5001000200040008,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6956159950689575,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":29.65577302110651,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43113530953821333,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658965458373641,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[684]冗余连接","frequency":28.359367594904178,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4321338729082358,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":29.65577302110651,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3551526797276411,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[686]重复叠加字符串匹配","frequency":4.712374071363843,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44053725781535596,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[687]最长同值路径","frequency":50.95760396809148,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5113828541693769,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.538489277352273,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4849595358069934,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.197199088388054,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6469318568395369,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[690]员工的重要性","frequency":65.00668040083679,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4907394316414534,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.426138519871788,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5789179609404328,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[692]前K个高频单词","frequency":62.97655470560548,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6096112568566658,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":5.259426648139519,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5307901907356948,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":5.259426648139519,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6633949379437429,"acs":0,"articleLive":2,"columnArticles":1225,"formTitle":"[695]岛屿的最大面积","frequency":65.18535797502142,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6311576658925836,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[696]计数二进制子串","frequency":23.464938834974102,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.605620163975247,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[697]数组的度","frequency":24.109934946968394,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4449590086989173,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[698]划分为k个相等的子集","frequency":56.84126440605384,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47615695935245467,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7589813640355156,"acs":0,"articleLive":2,"columnArticles":496,"formTitle":"[700]二叉搜索树中的搜索","frequency":22.842981762771895,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7238590467495609,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[701]二叉搜索树中的插入操作","frequency":30.340282799154465,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7403914590747331,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5126810651400815,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[703]数据流中的第 K 大元素","frequency":33.36523851156228,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5597660679119174,"acs":0,"articleLive":2,"columnArticles":1324,"formTitle":"[704]二分查找","frequency":68.38731550838251,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6460701437957723,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[705]设计哈希集合","frequency":45.11533858127057,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6445391446950537,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[706]设计哈希映射","frequency":32.71944499693893,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31943305174121933,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[707]设计链表","frequency":59.95670003533804,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33514550687559963,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[708]循环有序列表的插入","frequency":6.426138519871788,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7593808935423034,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[709]转换成小写字母","frequency":5.259426648139519,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35021186440677965,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[710]黑名单中的随机数","frequency":24.77959965613308,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5721352019785655,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6718626768731153,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":34.72792558917025,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4080801932550929,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[713]乘积小于K的子数组","frequency":35.694620390120726,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7191836673624047,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":45.31861075795656,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40195121951219515,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":7.049580196459441,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46042903890437525,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[716]最大栈","frequency":17.848409844356635,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5112106889953718,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[717]1比特与2比特字符","frequency":16.538489277352273,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645794066317626,"acs":0,"articleLive":2,"columnArticles":569,"formTitle":"[718]最长重复子数组","frequency":69.1182663152717,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36844818697370685,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[719]找出第 k 小的距离对","frequency":16.538489277352273,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48560148056755087,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[720]词典中最长的单词","frequency":7.049580196459441,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46912867859203694,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[721]账户合并","frequency":36.97699908685729,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3225763875140236,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":38.35224625078595,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7214244686961516,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4590717009654035,"acs":0,"articleLive":2,"columnArticles":840,"formTitle":"[724]寻找数组的中心下标","frequency":34.72792558917025,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5627773057679599,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[725]分隔链表","frequency":15.921126355027134,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5540360240160107,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":52.365288603579785,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4090909090909091,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[727]最小窗口子序列","frequency":31.051348852825445,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7593725916859332,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[728]自除数","frequency":5.259426648139519,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5101026613483293,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[729]我的日程安排表 I","frequency":24.77959965613308,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48928073068628697,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":39.83416771907456,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5100750691426313,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[731]我的日程安排表 II","frequency":5.259426648139519,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.610996434603115,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":17.848409844356635,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804190512226268,"acs":0,"articleLive":2,"columnArticles":521,"formTitle":"[733]图像渲染","frequency":44.715015706111224,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4781973203410475,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4114554309112495,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[735]行星碰撞","frequency":32.71944499693893,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45982545892266025,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4612269938650307,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5023492902277005,"acs":0,"articleLive":2,"columnArticles":579,"formTitle":"[738]单调递增的数字","frequency":28.996011352404967,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.678692740281216,"acs":0,"articleLive":2,"columnArticles":1473,"formTitle":"[739]每日温度","frequency":84.94251790861682,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6296090347009837,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[740]删除并获得点数","frequency":63.07588094539381,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3658490566037736,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":24.77959965613308,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49207920792079207,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5187954387480979,"acs":0,"articleLive":2,"columnArticles":514,"formTitle":"[743]网络延迟时间","frequency":49.6429431469325,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45908568803124283,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":25.47574048097743,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3921291053227633,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5834450033042073,"acs":0,"articleLive":2,"columnArticles":1234,"formTitle":"[746]使用最小花费爬楼梯","frequency":49.14052557292543,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41540158297651486,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.259426648139519,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5997043606799705,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5052467936261174,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7213483146067415,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":20.82746628033752,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5047410649161196,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5306417911615786,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[752]打开转盘锁","frequency":42.171112188327655,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5898887002452368,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":5.259426648139519,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42911898373761154,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5019685039370079,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.569402228976697,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[756]金字塔转换矩阵","frequency":7.702640064275236,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4163165266106443,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":9.866248350870627,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45924744049993355,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":12.14608668388992,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6581670362158167,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":6.426138519871788,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8390507011866235,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5889623455015809,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":10.62619446187706,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6988110437280561,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7633288725975058,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[763]划分字母区间","frequency":66.40015491300979,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4948528521254693,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6657856911021468,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[765]情侣牵手","frequency":55.51827740437165,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080820422169075,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4779334310033781,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[767]重构字符串","frequency":35.44825801062081,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.49989609310058186,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[768]最多能完成排序的块 II","frequency":24.77959965613308,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5877214627646449,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5527065527065527,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8515534193193367,"acs":0,"articleLive":2,"columnArticles":1104,"formTitle":"[771]宝石与石头","frequency":42.0781862781592,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4907010014306152,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[772]基本计算器 III","frequency":18.544782681751272,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.713712312144124,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[773]滑动谜题","frequency":52.101843170391724,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5872125630959057,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":12.90603279489635,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46116774791473586,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[775]全局倒置与局部倒置","frequency":7.049580196459441,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5688700748941713,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32357790601813685,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.538489277352273,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5957124129244531,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[778]水位上升的泳池中游泳","frequency":7.049580196459441,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4358394704950126,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[779]第K个语法符号","frequency":34.72792558917025,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28458246061378745,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[780]到达终点","frequency":18.544782681751272,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6198481323794057,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[781]森林中的兔子","frequency":91.37080600893827,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4250819183795055,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":33.36523851156228,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958419166652241,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[783]二叉搜索树节点最小距离","frequency":33.36523851156228,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6852136892091043,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[784]字母大小写全排列","frequency":28.359367594904178,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5118181818181818,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[785]判断二分图","frequency":42.0781862781592,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4680077281509262,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39245300975493697,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[787]K 站中转内最便宜的航班","frequency":32.00786434618518,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6072472432576059,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[788]旋转数字","frequency":17.18031537567092,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923563486250749,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[789]逃脱阻碍者","frequency":20.71145968148813,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44860368389780153,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[790]多米诺和托米诺平铺","frequency":6.426138519871788,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6952380952380952,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[791]自定义字符串排序","frequency":34.03418856093366,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4512619902470393,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[792]匹配子序列的单词数","frequency":14.75343628308859,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39463011031797535,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.259426648139519,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3403570244803258,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[794]有效的井字游戏","frequency":5.830085131237878,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5355880518400443,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":18.544782681751272,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.526584037993745,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[796]旋转字符串","frequency":42.171112188327655,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7948281201610405,"acs":0,"articleLive":2,"columnArticles":512,"formTitle":"[797]所有可能的路径","frequency":24.533121037854695,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4538352272727273,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4070206442284521,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":51.331762844975955,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7050575863795694,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41796527818925167,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765451545154515,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[802]找到最终的安全状态","frequency":46.5120419694713,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48272712833545106,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7703447869856159,"acs":0,"articleLive":2,"columnArticles":392,"formTitle":"[804]唯一摩尔斯密码词","frequency":23.464938834974102,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2897875724184937,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[805]数组的均值分割","frequency":8.387823251226841,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6575356211117801,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[806]写字符串需要的行数","frequency":16.538489277352273,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.844232373800584,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[807]保持城市天际线","frequency":4.712374071363843,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47964759674361546,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":30.340282799154465,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4189559226216765,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[809]情感丰富的文字","frequency":16.538489277352273,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7360408364303945,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":40.73529753464515,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7038708794966488,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[811]子域名访问计数","frequency":15.921126355027134,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6301140775249358,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5480792757523856,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":5.259426648139519,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000532098031237,"acs":0,"articleLive":2,"columnArticles":341,"formTitle":"[814]二叉树剪枝","frequency":4.187315920688197,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43482580474235,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[815]公交路线","frequency":73.57187396120386,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5095391840328735,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":7.702640064275236,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914523079657026,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":5.830085131237878,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43042424242424243,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4210107915813741,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[819]最常见的单词","frequency":15.921126355027134,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5066967630750787,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[820]单词的压缩编码","frequency":38.35224625078595,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6935147935747097,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[821]字符的最短距离","frequency":34.72792558917025,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5024399060184348,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.43058751342230406,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":18.544782681751272,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6145627815210513,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[824]山羊拉丁文","frequency":5.259426648139519,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3911581264522441,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[825]适龄的朋友","frequency":5.830085131237878,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3721432517956703,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":16.538489277352273,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39148376564483944,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[827]最大人工岛","frequency":29.65577302110651,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49170653907496015,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36214351225051317,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[829]连续整数求和","frequency":28.996011352404967,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431334785674444,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.404195105710005,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955618287359437,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[832]翻转图像","frequency":48.51897816938013,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42598782891917375,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.259426648139519,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5291418997087804,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":24.77959965613308,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5733625051278545,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.477991392418112,"acs":0,"articleLive":2,"columnArticles":649,"formTitle":"[836]矩形重叠","frequency":17.848409844356635,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39651411638818007,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[837]新21点","frequency":17.18031537567092,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5007236937328122,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[838]推多米诺","frequency":32.71944499693893,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748390232049568,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35893606716176946,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6568304953560371,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[841]钥匙和房间","frequency":24.77959965613308,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48929056524919023,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.73820845667335,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37774360408220325,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":6.426138519871788,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5146943161964685,"acs":0,"articleLive":2,"columnArticles":954,"formTitle":"[844]比较含退格的字符串","frequency":28.359367594904178,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42057557217312486,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[845]数组中的最长山脉","frequency":38.35224625078595,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5111553304389773,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6836916234247591,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":56.21302939434779,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44773145309625995,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42604318882935543,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44800905831288923,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":15.921126355027134,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47853608010127746,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[851]喧闹和富有","frequency":5.830085131237878,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.714981014842941,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[852]山脉数组的峰顶索引","frequency":59.95670003533804,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38296310604597256,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[853]车队","frequency":35.44825801062081,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3584274362191552,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4070533056733111,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[855]考场就座","frequency":16.538489277352273,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6259434515662273,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[856]括号的分数","frequency":43.42143122754762,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46554993678887485,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":26.955736901822284,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5555334394904459,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[858]镜面反射","frequency":31.051348852825445,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3016094786521304,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5872653849765888,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[860]柠檬水找零","frequency":28.359367594904178,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8091923086876633,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[861]翻转矩阵后的得分","frequency":4.187315920688197,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18980996107636505,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[862]和至少为 K 的最短子数组","frequency":50.59034996355039,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6037650022743973,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":56.93263409680947,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45367658393710497,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6551131694927915,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.224049020202633,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.544782681751272,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6704425435166448,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[867]转置矩阵","frequency":40.73529753464515,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6249125262421273,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.551438535309503,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.830085131237878,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4269166467637927,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[870]优势洗牌","frequency":5.259426648139519,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34055404347339774,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":39.83416771907456,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520887302174717,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":54.19696406811951,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5087767891147041,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":42.171112188327655,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4145605354466504,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[874]模拟行走机器人","frequency":37.65221825153508,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4783904121053865,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.94138348637294,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7063330004620452,"acs":0,"articleLive":2,"columnArticles":1574,"formTitle":"[876]链表的中间结点","frequency":43.65460479082908,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.756712285240916,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[877]石子游戏","frequency":61.42705952723356,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2804411287706779,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5555468484706005,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":62.84815184992581,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2523344470144779,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[880]索引处的解码字符串","frequency":7.049580196459441,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5381255474452554,"acs":0,"articleLive":2,"columnArticles":565,"formTitle":"[881]救生艇","frequency":42.325905406875656,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4861671469740634,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6872903225806452,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6612931183914024,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[884]两句话中的不常见单词","frequency":6.426138519871788,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6892742059229707,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[885]螺旋矩阵 III","frequency":34.72792558917025,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4225373745648167,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[886]可能的二分法","frequency":5.259426648139519,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2917255847377083,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[887]鸡蛋掉落","frequency":62.97655470560548,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6397429195970348,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[888]公平的糖果棒交换","frequency":5.259426648139519,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.677964557423352,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":40.05552799867142,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7261525565800503,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.32972591459828254,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387162761974603,"acs":0,"articleLive":2,"columnArticles":680,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7240420481519159,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[893]特殊等价字符串组","frequency":7.049580196459441,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7743546543113304,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5437754271765664,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[895]最大频率栈","frequency":24.77959965613308,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5870128834111125,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[896]单调数列","frequency":17.18031537567092,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7449955111251304,"acs":0,"articleLive":2,"columnArticles":698,"formTitle":"[897]递增顺序搜索树","frequency":55.51827740437165,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3357515591192567,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.47574048097743,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5383809274299188,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[899]有序队列","frequency":5.830085131237878,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49303663336360887,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5430441898527005,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3274871484729362,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.426138519871788,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5316176470588235,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":13.66597890590278,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4531915924060442,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[904]水果成篮","frequency":37.65221825153508,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7013210023427247,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[905]按奇偶排序数组","frequency":23.464938834974102,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2743225806451613,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[906]超级回文数","frequency":31.790984195026773,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3161664491808032,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[907]子数组的最小值之和","frequency":34.72792558917025,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986216827813208,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[908]最小差值 I","frequency":5.259426648139519,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45965993381262127,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":39.83416771907456,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31791140174049853,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4257542890948531,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5635205253487012,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[912]排序数组","frequency":82.55632964742512,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4055989583333333,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.107957057919515,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38879828600665134,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[914]卡牌分组","frequency":15.921126355027134,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4676200204290092,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[915]分割数组","frequency":15.921126355027134,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44063027574563873,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5696415161456069,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[917]仅仅反转字母","frequency":24.109934946968394,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35812557983458676,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[918]环形子数组的最大和","frequency":35.44825801062081,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6281721221037146,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48101937881603396,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7356702813704651,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[921]使括号有效的最少添加","frequency":5.830085131237878,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7142571037178861,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[922]按奇偶排序数组 II","frequency":24.77959965613308,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3377340772247694,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.848409844356635,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3592513874129177,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38805865704599884,"acs":0,"articleLive":2,"columnArticles":669,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5187191719899733,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.18031537567092,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3386823482507724,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[927]三等分","frequency":36.97699908685729,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4203291384317522,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6431138640360939,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5450861857691365,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[930]和相同的二元子数组","frequency":54.00119521086948,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6599256402237743,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[931]下降路径最小和","frequency":22.842981762771895,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6279375386518243,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[932]漂亮数组","frequency":5.259426648139519,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7243235409808915,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[933]最近的请求次数","frequency":34.03418856093366,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4750974080975775,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[934]最短的桥","frequency":40.73529753464515,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4747983065740075,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":6.426138519871788,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37752305008721654,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5888270980788676,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.538489277352273,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.818512957876239,"acs":0,"articleLive":2,"columnArticles":785,"formTitle":"[938]二叉搜索树的范围和","frequency":47.24945846645417,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4505178866742101,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4195556324025244,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[940]不同的子序列 II","frequency":4.187315920688197,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39236778730988137,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[941]有效的山脉数组","frequency":5.259426648139519,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7293302236967447,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47443331576172904,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":12.14608668388992,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6897686510678909,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48638417220464497,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":24.77959965613308,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6224662958423682,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[946]验证栈序列","frequency":49.875591007440114,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.612621820774899,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39137296159915835,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3694518746883076,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":37.65221825153508,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7744790409526108,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.18031537567092,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6635865212838046,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":24.77959965613308,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3494331601322626,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5531547104580813,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[953]验证外星语词典","frequency":23.464938834974102,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.29974800139033714,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":29.65577302110651,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3282099539941447,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":7.702640064275236,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4359766185066726,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":24.109934946968394,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3600560398505604,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[957]N 天后的牢房","frequency":24.77959965613308,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.536747165867733,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":27.74436690886687,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7438233948452035,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":24.77959965613308,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5537449971412236,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.677083723894867,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[961]重复 N 次的元素","frequency":16.538489277352273,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.441467478154432,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[962]最大宽度坡","frequency":17.18031537567092,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5009081735620585,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4260265700483092,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[964]表示数字的最少运算符","frequency":12.90603279489635,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840359218172214,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[965]单值二叉树","frequency":5.830085131237878,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4027088641544857,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":7.702640064275236,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4614958448753463,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4975170319297382,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[968]监控二叉树","frequency":38.764088808802995,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6530326253558134,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[969]煎饼排序","frequency":4.712374071363843,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4145609301972109,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4418142033021683,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":7.049580196459441,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4099641810485184,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":13.66597890590278,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6394222862836524,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[973]最接近原点的 K 个点","frequency":4.712374071363843,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46601929358922006,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[974]和可被 K 整除的子数组","frequency":52.590951865619736,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44603151229568544,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":5.830085131237878,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971383506083822,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[976]三角形的最大周长","frequency":24.109934946968394,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7146442750878474,"acs":0,"articleLive":2,"columnArticles":1235,"formTitle":"[977]有序数组的平方","frequency":49.9635418716639,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733832524083926,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[978]最长湍流子数组","frequency":5.259426648139519,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7123157804016202,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[979]在二叉树中分配硬币","frequency":25.47574048097743,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7333158309267525,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[980]不同路径 III","frequency":30.340282799154465,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5333096554873408,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[981]基于时间的键值存储","frequency":54.6823173318317,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5438981562774363,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.633823208583725,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[983]最低票价","frequency":45.80127155616185,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4166039864610756,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5995830541285087,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[985]查询后的偶数和","frequency":5.259426648139519,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6770250494964276,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[986]区间列表的交集","frequency":43.811617614286725,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5323258160655199,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[987]二叉树的垂序遍历","frequency":52.590951865619736,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4977037569855586,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[988]从叶结点开始的最小字符串","frequency":4.712374071363843,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4721946420601015,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[989]数组形式的整数加法","frequency":17.18031537567092,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5016140136158495,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[990]等式方程的可满足性","frequency":5.259426648139519,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5172559941874546,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[991]坏了的计算器","frequency":16.538489277352273,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45180081670569566,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":17.18031537567092,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570709027508718,"acs":0,"articleLive":2,"columnArticles":793,"formTitle":"[993]二叉树的堂兄弟节点","frequency":51.64902237772383,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093572249565295,"acs":0,"articleLive":2,"columnArticles":1361,"formTitle":"[994]腐烂的橘子","frequency":32.71944499693893,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398703075130452,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":5.830085131237878,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4951216645115787,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":18.544782681751272,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5113546458815601,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[997]找到小镇的法官","frequency":14.75343628308859,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148081778936222,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6908712744560249,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.259426648139519,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4079102715466352,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":34.72792558917025,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29238607415793944,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":9.866248350870627,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7375065824117957,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[1002]查找常用字符","frequency":38.764088808802995,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5761742223931542,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5976634574983102,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[1004]最大连续1的个数 III","frequency":51.92147421490737,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5342189043802832,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.101267563722896,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6276306615251078,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[1006]笨阶乘","frequency":50.59034996355039,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46434977578475334,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7264853101196953,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.05552799867142,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5929207024175132,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.259426648139519,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4506881869492029,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":5.830085131237878,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.627190332326284,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":70.43329496213391,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33074620246147024,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":18.544782681751272,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39772133911986507,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":33.36523851156228,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5481696442066443,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[1014]最佳观光组合","frequency":15.32659934056083,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35410638771422215,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":17.18031537567092,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5830485304169515,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5619754680438993,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5165865015304253,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5974914824976634,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.259426648139519,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5368288891546096,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1020]飞地的数量","frequency":24.109934946968394,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7836210688365955,"acs":0,"articleLive":2,"columnArticles":647,"formTitle":"[1021]删除最外层的括号","frequency":24.77959965613308,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7033688201837538,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.259426648139519,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5658002961013324,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5580964992699738,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[1024]视频拼接","frequency":15.921126355027134,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095517126387499,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[1025]除数博弈","frequency":38.764088808802995,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6689361116842033,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4332671668404939,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1027]最长等差数列","frequency":35.44825801062081,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7315091452306347,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[1028]从先序遍历还原二叉树","frequency":23.464938834974102,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6546516711043994,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1029]两地调度","frequency":4.712374071363843,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114028732483964,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5663399474061678,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":5.830085131237878,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39534141671984685,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3899899468619848,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.426138519871788,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4325052379527088,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6308350551279004,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1035]不相交的线","frequency":58.58594013202338,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.299103350637093,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43787645328477376,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7929836972249912,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":3.197492475500808,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5547832680399343,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.521686503933831,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48217785843920147,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":29.65577302110651,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5287524827390523,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1042]不邻接植花","frequency":16.538489277352273,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6916498068787934,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20954704895531492,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":56.21302939434779,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6435258648048239,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1045]买下所有产品的客户","frequency":5.830085131237878,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596248184523508,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[1046]最后一块石头的重量","frequency":27.74436690886687,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7254713106046656,"acs":0,"articleLive":2,"columnArticles":961,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":58.41230465417865,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.452358745275146,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":39.07889161373655,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.643600619825009,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[1049]最后一块石头的重量 II","frequency":60.25082248885158,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7575503355704698,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.259426648139519,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7529339703540365,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1051]高度检查器","frequency":6.426138519871788,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812322181889532,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[1052]爱生气的书店老板","frequency":25.47574048097743,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4581673306772908,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1053]交换一次的先前排列","frequency":17.18031537567092,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3764099103441627,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.538489277352273,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5830029077451758,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40803173029251366,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.464815103760337,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.33924843423799583,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35994050570153696,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.528287558536894,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":17.18031537567092,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6009863259358889,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5384864165588615,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7001176009408075,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6509603426834324,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5387931034482759,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.473796537823097,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42113564668769715,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8638500851788756,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8200689391037916,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1069]产品销售分析 II","frequency":5.259426648139519,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48379584707937123,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1070]产品销售分析 III","frequency":5.259426648139519,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5864057461655264,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1071]字符串的最大公因子","frequency":17.18031537567092,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5789285714285715,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":9.107957057919515,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3359773371104816,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6695023549600204,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":45.80127155616185,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6941499504233086,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4956393874860562,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7216659991990388,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6215982721382289,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7337428228067833,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[1079]活字印刷","frequency":5.259426648139519,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48990738541914036,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.57115299602138,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1081]不同字符的最小子序列","frequency":40.73529753464515,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7598645566996061,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":5.259426648139519,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5275267913427191,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.18031537567092,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5373727475638304,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7723823975720789,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6891742612537973,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5323502858862473,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44478662560492743,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5853507330832894,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[1089]复写零","frequency":4.712374071363843,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5428812843261512,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37793952967525196,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":42.73820845667335,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48736116430486404,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":18.544782681751272,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3813987781756899,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1093]大样本统计","frequency":7.702640064275236,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6126534330648254,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1094]拼车","frequency":22.24258952448678,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37253844078769893,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5534930813364833,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5176585713014856,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1097]游戏玩法分析 V","frequency":36.197199088388054,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4714862138533961,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1098]小众书籍","frequency":16.538489277352273,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5790187376725838,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":5.830085131237878,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7013613159387407,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6682954872089681,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3675976019885948,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367220704997196,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[1103]分糖果 II","frequency":15.921126355027134,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610093217614915,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[1104]二叉树寻路","frequency":44.45261237120647,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5566908371786421,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5733166388425153,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1106]解析布尔表达式","frequency":18.544782681751272,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4104976318692013,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1107]每日新用户统计","frequency":5.259426648139519,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8392205397623227,"acs":0,"articleLive":2,"columnArticles":677,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5753873448856363,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1109]航班预订统计","frequency":27.149670683455223,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6285664578983995,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1110]删点成林","frequency":24.109934946968394,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.771812512055552,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.77959965613308,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6434429843901579,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":17.18031537567092,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5405004939084623,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6529761492061291,"acs":0,"articleLive":2,"columnArticles":570,"formTitle":"[1114]按序打印","frequency":78.90396255870023,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5618849711757609,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1115]交替打印FooBar","frequency":48.51897816938013,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5168785310734463,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1116]打印零与奇偶数","frequency":60.6785477338764,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5204862396643218,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1117]H2O 生成","frequency":45.11533858127057,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6413928671721426,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662882371491643,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6074988134788799,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1120]子树的最大平均值","frequency":8.387823251226841,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5740245857830037,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068782718176396,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[1122]数组的相对排序","frequency":51.64902237772383,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7047021943573668,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3167296810373265,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1124]表现良好的最长时间段","frequency":6.426138519871788,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4895162621759947,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6934999399255076,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1126]查询活跃业务","frequency":16.538489277352273,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4137094996693851,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5445780281856765,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":15.32659934056083,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37947151938177737,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1129]颜色交替的最短路径","frequency":7.702640064275236,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6283253379851723,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4537205081669691,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3886255924170616,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1132]报告的记录 II","frequency":16.538489277352273,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6443287299071768,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7750062359690696,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5344568957910527,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":25.47574048097743,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5675617150281507,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6068338366529809,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[1137]第 N 个泰波那契数","frequency":33.840605120945405,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43199254319925434,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":5.830085131237878,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4761954261954262,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":17.18031537567092,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6528436018957346,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.426138519871788,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5109084120125886,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":17.18031537567092,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37121635206076176,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6339349275174735,"acs":0,"articleLive":2,"columnArticles":1066,"formTitle":"[1143]最长公共子序列","frequency":83.05297773481198,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4417979088029849,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.109934946968394,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4691864650827934,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":20.031626952889315,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2861058401855366,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5618600682593856,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1147]段式回文","frequency":36.197199088388054,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7182463545663853,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4420019115474846,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6064938535542491,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.544782681751272,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4829226640644059,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":17.848409844356635,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38520258367586613,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1152]用户网站访问行为分析","frequency":13.66597890590278,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3710215891386601,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.567156862745098,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1154]一年中的第几天","frequency":4.712374071363843,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4800205180815594,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1155]掷骰子的N种方法","frequency":5.830085131237878,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4342554338063589,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.31590715502555367,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5495117084952221,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4881953867028494,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1159]市场分析 II","frequency":17.848409844356635,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6872008033066342,"acs":0,"articleLive":2,"columnArticles":903,"formTitle":"[1160]拼写单词","frequency":15.921126355027134,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6329424765178955,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1161]最大层内元素和","frequency":17.18031537567092,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4692463649141137,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[1162]地图分析","frequency":17.18031537567092,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26709992625368734,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1163]按字典序排在最后的子串","frequency":8.387823251226841,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6098548768140398,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1164]指定日期的产品价格","frequency":17.18031537567092,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8389156491542511,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48782329620539927,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4271270507439908,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1167]连接棒材的最低费用","frequency":9.107957057919515,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5707407407407408,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":11.386140572883487,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3223128387947453,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":17.848409844356635,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6169253880821232,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.426138519871788,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47270689333084254,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":24.109934946968394,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2690293101526803,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7563714481007714,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6180103599415593,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48884887103476937,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4470089994706194,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26355336158315495,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1177]构建回文串检测","frequency":6.426138519871788,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46200289406716233,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6347430142399966,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1179]重新格式化部门表","frequency":50.95760396809148,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7745122878135292,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1180]统计只含单一字母的子串","frequency":9.866248350870627,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37047353760445684,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3872749590834697,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6024667931688804,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5858347085321797,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":4.712374071363843,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6094363626306765,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1185]一周中的第几天","frequency":16.538489277352273,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39227115716753025,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":29.65577302110651,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4408471275559883,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6927961462666958,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":20.82746628033752,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6444430407731422,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1189]“气球” 的最大数量","frequency":5.259426648139519,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510285739784915,"acs":0,"articleLive":2,"columnArticles":604,"formTitle":"[1190]反转每对括号间的子串","frequency":94.29981606447406,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2675954077233743,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5004290793183769,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6068288226561608,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1193]每月交易 I","frequency":6.426138519871788,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.511962447001817,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.426138519871788,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6344621513944223,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1195]交替打印字符串","frequency":29.65577302110651,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6900919305413687,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3687445127304653,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":17.18031537567092,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7475785728404823,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43393939393939396,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6865912127642851,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[1200]最小绝对差","frequency":23.464938834974102,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2470711736300651,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032205662907765,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":5.830085131237878,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.623167383308294,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":7.049580196459441,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7274200081004455,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":6.426138519871788,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4617582012532252,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1205]每月交易II","frequency":25.47574048097743,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6188516746411483,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":18.544782681751272,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303787030313473,"acs":0,"articleLive":2,"columnArticles":822,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49661984808065224,"acs":0,"articleLive":2,"columnArticles":601,"formTitle":"[1208]尽可能使字符串相等","frequency":16.538489277352273,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5319071955135453,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":34.03418856093366,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4502500431108812,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":12.14608668388992,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6555659494855005,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1211]查询结果的质量和占比","frequency":17.18031537567092,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5125106022052587,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1212]查询球队积分","frequency":5.259426648139519,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7727211885959042,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":18.544782681751272,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6344707923655292,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":17.848409844356635,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4096925704526046,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5334088335220838,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6955632728570965,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":34.03418856093366,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4209000051783957,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6312125107112254,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.03418856093366,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5269744160177976,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8438942226713828,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[1221]分割平衡字符串","frequency":17.03548380764481,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6723533535872868,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47288378766140604,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3257399985938269,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1224]最大相等频率","frequency":28.56910753685132,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5420608979872699,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1225]报告系统状态的连续日期","frequency":17.848409844356635,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6002085505735141,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1226]哲学家进餐","frequency":49.875591007440114,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6627382315307428,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1227]飞机座位分配概率","frequency":4.187315920688197,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5390361017250578,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4147300679299249,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4899110807113543,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5586098566660122,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":18.544782681751272,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46923755019799346,"acs":0,"articleLive":2,"columnArticles":417,"formTitle":"[1232]缀点成线","frequency":15.32659934056083,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48309929166148874,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.426138519871788,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34222669190724087,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1234]替换子串得到平衡字符串","frequency":24.109934946968394,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4538064717836486,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1235]规划兼职工作","frequency":38.35224625078595,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.56047197640118,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106971493084956,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6581010452961672,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":4.712374071363843,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4906969770530194,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[1239]串联字符串的最大长度","frequency":41.43988940140756,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4962211614956245,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":27.74436690886687,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5947680637946124,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.469743987587277,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":13.66597890590278,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5395181741335587,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6191230850501849,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.107957057919515,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5082377169755811,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.426138519871788,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4803580308304326,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":9.866248350870627,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.616834078744776,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1247]交换字符使得字符串相同","frequency":24.109934946968394,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5589541757846948,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1248]统计「优美子数组」","frequency":16.538489277352273,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5728139862369477,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[1249]移除无效的括号","frequency":36.32495819865756,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5624866936342346,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":8.387823251226841,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7706568324529054,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497897392767031,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3937080024434942,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":17.848409844356635,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5978739623920041,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.712374071363843,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6780141843971631,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6647577092511013,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5646279949558638,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5574151557415156,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47542997542997545,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":14.75343628308859,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.603785803237858,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7277227722772277,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5254032928654582,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[1262]可被三整除的最大和","frequency":40.73529753464515,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41588980102963685,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":7.049580196459441,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.569783114814361,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1264]页面推荐","frequency":6.426138519871788,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9198179271708683,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":7.702640064275236,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8239479682027906,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[1266]访问所有点的最小时间","frequency":17.18031537567092,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6078107447300601,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5825785024154589,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1268]搜索推荐系统","frequency":5.830085131237878,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4916790514608613,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.24945846645417,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8051332124424606,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":5.259426648139519,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5056556346878928,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5188243064729194,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5442368699330279,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5992438563327032,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5398403679653679,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.538489277352273,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5014456513245292,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7246229585058999,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":28.359367594904178,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5979804894745849,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":58.78178605175215,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6231707317073171,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5047162395849709,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1280]学生们参加各科测试的次数","frequency":17.18031537567092,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831749207937302,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[1281]整数的各位积和之差","frequency":5.259426648139519,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8112327656123277,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41643335362142425,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.18031537567092,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6598586017282011,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":17.18031537567092,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8123675592371412,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6456398169970886,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":5.259426648139519,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6038103571712672,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":15.921126355027134,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.562977262977263,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":24.109934946968394,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6272225628448804,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8091891228285556,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1290]二进制链表转整数","frequency":4.187315920688197,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5191666666666667,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.467811847808637,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":4.712374071363843,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35623245367770917,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":56.168897052060004,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6580133228840125,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8092559447711583,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1295]统计位数为偶数的数字","frequency":16.538489277352273,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45343254920787324,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4574697754749568,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":26.200369779545174,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5961803957662218,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7855048945191855,"acs":0,"articleLive":2,"columnArticles":427,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4672639962520497,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":3.682795638898352,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36078981189391285,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8169976510783685,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.109934946968394,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8223658818988807,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7247293979320123,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1304]和为零的N个唯一整数","frequency":4.712374071363843,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7467060080378491,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.259426648139519,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.574895482818395,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1306]跳跃游戏 III","frequency":29.65577302110651,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3327205882352941,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7517271791856533,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1308]不同性别每日分数总计","frequency":5.830085131237878,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7556079737292447,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712607704493644,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":53.28364862832431,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3778562525965933,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.426138519871788,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6668420360384059,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":36.32495819865756,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8315837407726968,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1313]解压缩编码列表","frequency":4.187315920688197,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7354558414228498,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[1314]矩阵区域和","frequency":34.03418856093366,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8100712955231549,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43937439535633666,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6139877300613497,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6534989911861527,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1318]或运算的最小翻转次数","frequency":65.73098205356487,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6173620403032883,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[1319]连通网络的操作次数","frequency":5.830085131237878,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892509727626459,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6173558532323821,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":4.712374071363843,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5925882899628253,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7552432090966519,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.109934946968394,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5924451250638081,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7282902919013827,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1325]删除给定值的叶子节点","frequency":4.712374071363843,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4742715965241097,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":6.426138519871788,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6907095256762054,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45919910835124594,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":15.921126355027134,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7710259301014656,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.426138519871788,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37817342565117046,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":14.75343628308859,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5356727864280735,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1331]数组序号转换","frequency":16.538489277352273,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6846618447543061,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.259426648139519,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5429135802469136,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4898922432986018,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":49.18567730825995,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5856152512998267,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42472187886279356,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7060763761636004,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":37.65221825153508,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6407879490150638,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":4.712374071363843,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3977606102092705,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":6.426138519871788,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5724414715719064,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4803010181496237,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204520309783467,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5435204764165192,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5938864628820961,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1344]时钟指针的夹角","frequency":5.830085131237878,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3666322047040579,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":5.830085131237878,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43565542216772646,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7391724671307038,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3036797807790174,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":8.387823251226841,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.504383788254756,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":7.049580196459441,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.848743875742729,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.830085131237878,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7550857496008653,"acs":0,"articleLive":2,"columnArticles":541,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.259426648139519,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4425993275235024,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":5.259426648139519,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28278174511761245,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.74540029289605,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2822828784119107,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6630747126436781,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315358504528563,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":15.921126355027134,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5286885245901639,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48856755535472207,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.830085131237878,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5473557208928213,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5032043530834341,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1360]日期之间隔几天","frequency":29.65577302110651,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4012887456949228,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1361]验证二叉树","frequency":5.259426648139519,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5236021069692058,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3629032258064516,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":35.44825801062081,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6764214046822743,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.830085131237878,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250539109978435,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.109934946968394,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5376402321083172,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1366]通过投票对团队排名","frequency":17.848409844356635,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41759565290459916,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":15.921126355027134,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5218295218295218,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6098252243741143,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":5.259426648139519,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905454545454546,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1370]上升下降字符串","frequency":4.712374071363843,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799133386691689,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.43988940140756,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5132999228989977,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.259426648139519,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3987226811976329,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":29.65577302110651,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7393536963258078,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5727119216480918,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5022887203661952,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3251717873785641,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8621029303127309,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8368585013936711,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7279144100150937,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7324416876655683,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6911169631960948,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32370274543625127,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":8.387823251226841,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5434719395173015,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7031550802139037,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[1385]两个数组间的距离值","frequency":5.259426648139519,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3105999189298743,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1386]安排电影院座位","frequency":19.271680841882883,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6936637526190305,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":18.544782681751272,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5376557942190401,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":24.77959965613308,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307673946771691,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1389]按既定顺序创建目标数组","frequency":15.921126355027134,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3530413073082161,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4004909481436023,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":18.544782681751272,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.400838890083889,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1392]最长快乐前缀","frequency":5.830085131237878,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560192265676208,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6641891891891892,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7494374799099968,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1395]统计作战单位数","frequency":5.830085131237878,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41133439097479285,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1396]设计地铁系统","frequency":18.544782681751272,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3697261287934863,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7713604693802714,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6686399181466053,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6046152147510213,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.259426648139519,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41796875,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7520773410035155,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1402]做菜顺序","frequency":4.712374071363843,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915928175511965,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1403]非递增顺序的最小子序列","frequency":15.921126355027134,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49244210234364166,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":6.426138519871788,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5060207484253427,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1405]最长快乐字符串","frequency":17.18031537567092,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5687470109995217,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":7.049580196459441,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6685862028440475,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6144969856819894,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8054882970137207,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47571808338196203,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1410]HTML 实体解析器","frequency":6.426138519871788,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5498207885304659,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":36.97699908685729,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5514936285773971,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6917619235317304,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":15.32659934056083,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6019966722129784,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.109934946968394,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6837155236183029,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.426138519871788,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40799049457893954,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":18.544782681751272,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5183850626484318,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.426138519871788,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327321347291762,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":49.390142882661415,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4190250726353169,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":34.72792558917025,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.593483709273183,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":24.44157521990897,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7491525423728813,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5407520218464447,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[1422]分割字符串的最大得分","frequency":29.65577302110651,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5543145408245496,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":5.259426648139519,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3970276008492569,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1424]对角线遍历 II","frequency":17.18031537567092,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43447012401352875,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.426138519871788,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7042110603754439,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":9.107957057919515,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6593059936908517,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5911949685534591,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.500903342366757,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5782493368700266,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8463711122940045,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.259426648139519,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3931858407079646,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6426931905126243,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.456015037593985,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6198876053699657,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7835718776581975,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5891495430467432,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":5.830085131237878,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48249425372581006,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":36.00716308436419,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5606758832565284,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6988312041315575,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6476790915459204,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1441]用栈操作构建数组","frequency":6.426138519871788,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7917957189070136,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":52.590951865619736,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41022017256768817,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5242778119237861,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8592726451321436,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5724846568718617,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6169329073482428,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7131379600581529,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":4.187315920688197,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6280403325123153,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":35.44825801062081,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8023988410094,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":4.712374071363843,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5216817894070479,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":6.426138519871788,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49837939269873766,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":6.426138519871788,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3627738875084707,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40247264221869516,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":17.848409844356635,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6332379770065311,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.519816454154146,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6357954545454545,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4413029627269831,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5941593886462883,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7444483084107506,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.500261688764829,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4267189169932312,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1462]课程表 IV","frequency":4.712374071363843,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5901675977653631,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":9.107957057919515,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7689206415083153,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1464]数组中两元素的最大乘积","frequency":15.921126355027134,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30816427511133104,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.485053187359267,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":17.18031537567092,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6145357686453576,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7116824762855717,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8030188679245283,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434838092199712,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[1470]重新排列数组","frequency":42.0781862781592,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5429550704120408,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6174447174447174,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6745670806366976,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":46.42177740154336,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7191011235955056,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7220009076698098,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8647580756966589,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1476]子矩形查询","frequency":18.544782681751272,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28949921183460653,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":16.538489277352273,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5757238307349666,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":26.955736901822284,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5733169382108823,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":5.259426648139519,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8694505194095133,"acs":0,"articleLive":2,"columnArticles":1278,"formTitle":"[1480]一维数组的动态和","frequency":30.937230197819616,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5121418542977484,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1481]不同整数的最少数目","frequency":34.03418856093366,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.586971810906879,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":47.937575136429864,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.29961125509070713,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8057630736392742,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6593146190302588,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586397641153106,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":47.937575136429864,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30821330939654823,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1487]保证文件名唯一","frequency":24.109934946968394,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23564853556485355,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1488]避免洪水泛滥","frequency":61.069054968274415,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6918109951119426,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8574730354391371,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6719447688397334,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6660363483559197,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5664125664125664,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.109934946968394,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.36636332996292553,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":28.56910753685132,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.542836676217765,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5381281185424122,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1496]判断路径是否相交","frequency":5.830085131237878,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3906740397548946,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33326790971540726,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":20.031626952889315,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3771841155234657,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.3025685676969961,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5909844715814865,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":23.464938834974102,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7170223154025102,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[1502]判断能否形成等差数列","frequency":34.03418856093366,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.512196605632946,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":17.18031537567092,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5921031163321913,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1504]统计全 1 子矩形","frequency":33.36523851156228,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3611544461778471,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":32.56143883780239,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8435054773082942,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":26.5740602637562,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5885328836424958,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":29.65577302110651,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526193787668058,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1508]子数组和排序后的区间和","frequency":6.426138519871788,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5450096733811313,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5784690667598742,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":29.65577302110651,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6817475392850976,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":5.830085131237878,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8487827029560836,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[1512]好数对的数目","frequency":4.712374071363843,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37895797852003754,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":4.712374071363843,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31826131467815555,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3414152495885902,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5767326732673267,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7314298460852108,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.674289024356605,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1518]换酒问题","frequency":24.109934946968394,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29603971197905304,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33204684588767636,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39531701383609547,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":12.90603279489635,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7019027484143763,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5775610916225697,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42526562218620567,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":15.921126355027134,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6613211149293623,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.612056879631484,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5065566524237513,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7845982142857143,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[1528]重新排列字符串","frequency":15.921126355027134,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6892082940622055,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1529]灯泡开关 IV","frequency":6.426138519871788,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5661151555261417,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":16.538489277352273,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32416787264833574,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.662424136331353,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6193688267887256,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":5.259426648139519,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6146788990825688,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7895846016953121,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.259426648139519,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4528451911774874,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1535]找出数组游戏的赢家","frequency":6.426138519871788,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4388075880758808,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3652224726604892,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6084656084656085,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5385085574572127,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[1539]第 k 个缺失的正整数","frequency":29.65577302110651,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3164775366646758,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.45858601978933927,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38155202266645677,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5489469578783152,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5447036784741145,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1544]整理字符串","frequency":34.03418856093366,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5526138153453837,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":17.848409844356635,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41126737663604584,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5347240915208614,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":26.955736901822284,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7133757961783439,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6676144441285187,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":5.259426648139519,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6601837187203041,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[1550]存在连续三个奇数的数组","frequency":4.712374071363843,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8174573620317271,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.259426648139519,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.507879903370528,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1552]两球之间的磁力","frequency":15.921126355027134,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2948030762060126,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":61.79149525508283,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.703012912482066,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4346853563972562,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5784097183876311,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1556]千位分隔数","frequency":45.11533858127057,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7635121143093808,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6219702338766832,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":6.426138519871788,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3666409606698248,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":8.387823251226841,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5736685590700189,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.426138519871788,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7794590893529613,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":15.921126355027134,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3096114218428025,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":10.62619446187706,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37794432548179874,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":38.35224625078595,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5877712031558185,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7252305509576732,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":5.830085131237878,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4460730567257199,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.259426648139519,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3955083085407445,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":23.464938834974102,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45503694359344027,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4717289719626168,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8963376784605835,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7571892393320965,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049494297396169,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1572]矩阵对角线元素的和","frequency":16.538489277352273,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2956468756346896,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32583315644236893,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":17.18031537567092,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5961832061068703,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4757648583695623,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":4.712374071363843,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.324240465416936,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.107957057919515,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5802766085387854,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6195664773385882,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":8.387823251226841,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6313131313131313,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8087736306349976,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6717650438029585,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":5.830085131237878,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6860598439175944,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":26.126562783547197,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6661774341501769,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[1584]连接所有点的最小费用","frequency":18.544782681751272,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4290670074858499,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6168384879725086,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8236472945891784,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8388776003870343,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1588]所有奇数长度子数组的和","frequency":21.239837136385713,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29381852852375656,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":7.049580196459441,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2651250947687642,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1590]使数组和能被 P 整除","frequency":6.426138519871788,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5812332439678284,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44470018885741264,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5291919191919192,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.830085131237878,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3132988435788192,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1594]矩阵的最大非负积","frequency":6.426138519871788,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46142322097378274,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7631055076310551,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6714366056364431,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.259426648139519,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4191281431865598,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6802063446931232,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":17.18031537567092,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4850521436848204,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7826603325415677,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8448097275388426,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1603]设计停车系统","frequency":61.069054968274415,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4139302352005454,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7338081460048965,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3413852073535699,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5464952801767423,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6400483156623272,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5120229428634459,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1609]奇偶树","frequency":5.259426648139519,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27066260828845706,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6093009478672986,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7340241796200345,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7237141556668184,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8210116731517509,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1614]括号的最大嵌套深度","frequency":4.187315920688197,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49555576794418427,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27501116569897277,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.426138519871788,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6184163382300251,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5869565217391305,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6752469604863222,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3705185413140483,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":9.107957057919515,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4380564741795981,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14773506137454048,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":16.538489277352273,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7818831942789034,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.259426648139519,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6273446327683616,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.538489277352273,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5420033828227777,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38368794326241135,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.426138519871788,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3786099650904475,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8367346938775511,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5233372228704785,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7689393939393939,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1630]等差子数组","frequency":5.830085131237878,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4923753782449435,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":23.464938834974102,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3170301828596607,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6543743641912513,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":5.830085131237878,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5185676392572944,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5438683948155534,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":7.049580196459441,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7060569594865623,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.259426648139519,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8061035758323057,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7106690777576854,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":8.387823251226841,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.402156158118262,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6621592957895853,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1640]能否连接形成数组","frequency":4.712374071363843,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7693300632502904,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.35224625078595,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4537237888647867,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":5.830085131237878,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4496823119491699,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5428881650380022,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":18.544782681751272,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4111592632719393,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":7.702640064275236,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5375920373015998,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.380719852603455,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5128205128205128,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.109934946968394,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2778417502878763,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.271680841882883,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47497621313035204,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7949820788530466,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":7.049580196459441,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6865817825661117,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6604164610677983,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1652]拆炸弹","frequency":15.921126355027134,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5038837744533947,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.259426648139519,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2745032837309835,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":16.538489277352273,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38663484486873506,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7808037535699714,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":4.712374071363843,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46463773128134184,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":5.830085131237878,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29754055468341184,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":5.259426648139519,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41032017407522536,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":13.66597890590278,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7398058252427184,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7269338303821062,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":17.18031537567092,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8128458897192486,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":15.921126355027134,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725640045854031,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.47574048097743,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5455666289941437,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6660560062810783,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":6.426138519871788,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6859756097560976,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.442627456369383,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7641785350966429,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1669]合并两个链表","frequency":5.259426648139519,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5289530870510034,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":5.259426648139519,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4651928504233302,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":7.702640064275236,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8505515651920968,"acs":0,"articleLive":2,"columnArticles":438,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3514672256097561,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":4.712374071363843,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3622433799464445,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":18.544782681751272,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4347301258837731,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7648283038501561,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":9.107957057919515,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.39555084745762714,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8304,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":4.712374071363843,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4963986476554461,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":5.259426648139519,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46176033563499697,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.426138519871788,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38385502471169686,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.519298245614035,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8951086956521739,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8280680437424058,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[1684]统计一致字符串的数目","frequency":24.109934946968394,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5959731543624162,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.46974434430752254,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":5.830085131237878,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39869281045751637,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8053327821413807,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1688]比赛中的配对次数","frequency":15.921126355027134,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8677937241547069,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1689]十-二进制数的最少数目","frequency":15.32659934056083,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5164621552666747,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1690]石子游戏 VII","frequency":6.426138519871788,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4862497453656549,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.64,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8017404464623534,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6338668913226622,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4576466964423225,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1695]删除子数组的最大得分","frequency":5.259426648139519,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39675711449371276,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":22.842981762771895,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5244977951984321,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5475,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8006839276990718,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7119575699132112,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.259426648139519,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6114350502105604,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1701]平均等待时间","frequency":17.18031537567092,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4747779453661807,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":20.031626952889315,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3879390736711222,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7820114904576372,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34751948533960164,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":17.18031537567092,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.583171341294085,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1706]球会落何处","frequency":16.538489277352273,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032020321276519,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":39.83416771907456,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6976190476190476,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7133689839572193,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6934092046023012,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":23.464938834974102,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35924379828223213,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":50.59034996355039,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26450676982591875,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4968470919624852,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":46.5120419694713,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6398891966759003,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7358047864852182,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1715]苹果和橘子的个数","frequency":17.18031537567092,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6758106849547032,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43073505654281097,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":6.426138519871788,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4881869542886492,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36594202898550726,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.869296838131194,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":56.84126440605384,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6473937801138853,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1721]交换链表中的节点","frequency":5.830085131237878,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.514257512612415,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5071749176376943,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":72.56097721770296,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5583756345177665,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7875768020380638,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.259426648139519,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.478344900289906,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5750809613090165,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":6.426138519871788,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35471204188481675,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6232383338553085,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":5.830085131237878,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5350194552529183,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47349330357142855,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.792476315607496,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1732]找到最高海拔","frequency":34.03418856093366,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4583612413485153,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":8.387823251226841,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231695605907239,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":56.2635851855447,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48452611218568664,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44903716617798556,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.11533858127057,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30961102389673817,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":7.049580196459441,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6543555781966378,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":38.764088808802995,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4719642857142857,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7040951122853368,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":12.90603279489635,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8433895297249334,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7077002317795519,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":4.712374071363843,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6970675866394856,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":43.72174128225914,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3626944337318421,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":54.799629724060395,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48454063604240283,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":6.426138519871788,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5906642728904847,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7046388725778039,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.748957523499894,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":24.77959965613308,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5306553911205074,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.109934946968394,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45832123148417075,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4724552255724326,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":18.544782681751272,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6834942932396839,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":5.259426648139519,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6286824214956297,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4203476482617587,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":5.830085131237878,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.40011648223645896,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":8.387823251226841,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8295739348370927,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9235998705082551,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6363386476085762,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42785075195126593,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":5.830085131237878,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5375165125495377,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4289340101522843,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6709401709401709,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6085578446909667,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1763]最长的美好子字符串","frequency":5.830085131237878,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47770428845743546,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.552835255093982,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":5.830085131237878,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3752386146713935,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":12.90603279489635,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7937823834196891,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7672383619180959,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1768]交替合并字符串","frequency":16.538489277352273,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8553934340802501,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.259426648139519,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36890021849963583,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":10.62619446187706,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3648908857509628,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5176470588235295,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8420007513551226,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":22.24258952448678,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5527581329561527,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":5.259426648139519,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.473570780399274,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":17.848409844356635,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46187245590230663,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":27.74436690886687,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7796557605830361,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1777]每家商店的产品价格","frequency":64.60406277295283,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5709459459459459,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6460880195599022,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":5.259426648139519,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6629592601849538,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5175302913121939,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":6.426138519871788,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2874044860734533,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7918188458729,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42109112183706304,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":5.259426648139519,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3488023120102262,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34001431639226914,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6543333891400189,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":55.51827740437165,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.688,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7083969465648855,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6487760377071613,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.259426648139519,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8095076111914279,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5125,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":35.44825801062081,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4126760563380282,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":18.544782681751272,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6995305164319249,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7873977873977874,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1795]每个产品在不同商店的价格","frequency":24.77959965613308,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4873279098873592,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1796]字符串中第二大的数字","frequency":5.259426648139519,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5751409322150419,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1797]设计一个验证系统","frequency":16.538489277352273,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5211120764552563,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5168949771689497,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":7.049580196459441,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6834875650665124,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1800]最大升序子数组和","frequency":16.538489277352273,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.377036898295561,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26248007650621613,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40719030871434153,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":23.464938834974102,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5726618705035971,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":9.107957057919515,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.49168741109530584,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.259426648139519,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6634590377113134,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.200369779545174,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5849707357859532,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26726427622841964,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":10.62619446187706,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6366328257191202,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1809]没有广告的剧集","frequency":24.77959965613308,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.65234375,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":21.662424136331353,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6610320284697508,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1811]寻找面试候选人","frequency":6.426138519871788,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7951064048524725,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5156526875369167,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1813]句子相似性 III","frequency":25.47574048097743,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3426915775801778,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":5.830085131237878,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29773822766036334,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7526857486289535,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1816]截断句子","frequency":5.259426648139519,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6974850299401197,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.259426648139519,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3742095093102237,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":45.80127155616185,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3657669306610635,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5027932960893855,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9015308233347125,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.47574048097743,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8126378886900054,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1822]数组元素积的符号","frequency":15.32659934056083,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7090288665498479,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1823]找出游戏的获胜者","frequency":15.921126355027134,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6595047027353524,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.287253931595733,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":11.386140572883487,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4419047619047619,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7964203844119203,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8688350088704908,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1828]统计一个圆中点的数目","frequency":15.921126355027134,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6792982456140351,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48579710144927535,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7360454115421002,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.822764437005086,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":23.464938834974102,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6849104940223923,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1833]雪糕的最大数量","frequency":28.996011352404967,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3507923067618241,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1834]单线程 CPU","frequency":31.051348852825445,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5087819505926031,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":10.62619446187706,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7105263157894737,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":9.107957057919515,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7947649572649572,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":5.259426648139519,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42996296407816686,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[1838]最高频元素的频数","frequency":58.25729901067792,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5763751127141569,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3880145278450363,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":9.866248350870627,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5183211192538307,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1841]联赛信息统计","frequency":24.77959965613308,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6917808219178082,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5088868101028999,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1843]","frequency":5.259426648139519,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8025897874419741,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5655802081288043,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.633771828245866,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":40.73529753464515,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36018957345971564,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":7.049580196459441,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6861003146400148,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32874180083482407,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":6.426138519871788,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6054708048395582,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":7.702640064275236,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40106951871657753,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7112970711297071,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6477354421279655,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":7.049580196459441,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7919397573560173,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1854]人口最多的年份","frequency":24.109934946968394,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6887390694880181,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.464938834974102,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35603562005277045,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":18.544782681751272,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4493779493779494,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6504424778761062,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":11.386140572883487,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7708726415094339,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7704334058974867,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1860]增长的内存泄露","frequency":5.259426648139519,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6175398196123585,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":5.830085131237878,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3099273607748184,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9173659938005595,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.43988940140756,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38711147570868654,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":5.830085131237878,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5159780985564958,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":3.682795638898352,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5959679646506489,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":20.82746628033752,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7527472527472527,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5253456221198156,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":14.75343628308859,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.792818031325608,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1869]哪种连续子字符串更长","frequency":29.65577302110651,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4595537828742366,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":5.830085131237878,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2761625153897149,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6273133375877473,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8034993270524899,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":34.03418856093366,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8815331010452961,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7420042643923241,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7269102135322871,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8188370454668618,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[1877]数组中最大数对和的最小值","frequency":53.28364862832431,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4291266107588464,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40910119990944077,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":7.702640064275236,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7728886498117268,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":4.712374071363843,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3527998077385244,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2786155168372529,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.373391494002181,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.694468085106383,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":33.36523851156228,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5177664974619289,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5718337514999454,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":16.538489277352273,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6412789186378997,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.426138519871788,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3148040469822072,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":7.049580196459441,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27284785780607507,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":17.18031537567092,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7017543859649122,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5167958656330749,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3355102040816327,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.426138519871788,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915533258302653,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.11533858127057,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4585663839987628,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":8.815513477413319,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5298387096774193,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5036630036630036,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.530642619506216,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.538489277352273,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3080319107737588,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":7.702640064275236,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6279272981475009,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.42782931354359927,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":26.5740602637562,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6630076838638859,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.42948717948717946,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6459650087020243,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27659751728734483,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5694391209914399,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1905]统计子岛屿","frequency":5.259426648139519,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42295652173913045,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":20.031626952889315,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.594553706505295,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6855345911949685,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.327123863892436,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":6.426138519871788,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6748787584869059,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5695967292324847,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1911]最大子序列交替和","frequency":15.921126355027134,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.28735632183908044,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8423882603338188,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":5.259426648139519,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4415204678362573,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.848409844356635,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3903054076772205,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5485436893203883,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":19.271680841882883,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.29001367989056087,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4713656387665198,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.38042131350681535,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9246534056660639,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34317602040816325,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.538489277352273,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3619230154927328,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.259426648139519,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2367086536888598,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.47574048097743,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38095238095238093,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6983425414364641,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1925]统计平方和三元组的数目","frequency":29.65577302110651,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3423477564102564,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41104146576663453,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.830085131237878,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39702280007537216,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":31.790984195026773,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9251581166549543,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1929]数组串联","frequency":15.32659934056083,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4756065049320181,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.538489277352273,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5535307517084282,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":9.107957057919515,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3263058527375708,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":21.662424136331353,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5695461200585652,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":11.386140572883487,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7491039426523297,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7406028162457815,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4485330273725619,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24154779730475215,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.18031537567092,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3398328690807799,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1938]查询最大基因差","frequency":20.031626952889315,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6067615658362989,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8033573141486811,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7734472326036661,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3912600145666424,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4037685060565276,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5692742695570217,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":5.259426648139519,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.661582459485224,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.259426648139519,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3029139766183912,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.18031537567092,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5392633773453788,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.511767925561029,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":9.107957057919515,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5015873015873016,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.5462962962962963,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7216117216117216,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5443558539655896,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1952]三除数","frequency":5.259426648139519,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3226110152204613,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4799085659287777,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":5.259426648139519,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4939382088384826,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.44366197183098594,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":18.544782681751272,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6090616868207561,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42092414995640803,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.40885111371629546,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27974116475858635,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5347875445994161,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":4.712374071363843,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42460949952183613,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1962]移除石子使总数最小","frequency":15.921126355027134,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.611378555798687,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":5.830085131237878,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38196618659987475,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7552870090634441,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.7441860465116279,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7753069577080491,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35434817044194516,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27707317073170734,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":20.558007807876848,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47873550147828065,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":14.75343628308859,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5513392857142857,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.5059288537549407,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":9.866248350870627,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5196078431372549,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7466467958271237,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.7599461110064303,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3773105686468181,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1975]最大方阵和","frequency":12.14608668388992,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28153046764289086,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.243585237258348,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.6111111111111112,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1978]","frequency":12.90603279489635,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8289321138735025,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5792937735060594,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1980]找出不同的二进制字符串","frequency":10.62619446187706,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2948096885813149,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":21.101267563722896,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.45707656612529,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1982]从子集的和还原数组","frequency":9.107957057919515,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1983]","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5804787000439174,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4083570750237417,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.264827922870393,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1986]完成任务的最少工作时间段","frequency":5.259426648139519,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4513485831341755,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6442307692307693,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1988]","frequency":31.790984195026773,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.3972602739726027,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1989]","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6440677966101694,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1990]","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6649505766062603,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5902952620737011,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3813799621928166,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.35678391959798994,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5414033558509479,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2368689733408962,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.33607938588279346,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1997]访问完所有房间的第一天","frequency":11.386140572883487,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.42063971031985514,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1998]数组的最大公因数排序","frequency":21.662424136331353,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.8447806957672236,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[LCP 01]猜数字","frequency":37.65221825153508,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6900899038958355,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[LCP 02]分式化简","frequency":28.359367594904178,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21857671904714243,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":22.842981762771895,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.377073681064116,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 04]覆盖","frequency":26.200369779545174,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.1970550449649175,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8396693891141274,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[LCP 06]拿硬币","frequency":34.03418856093366,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7702947571877266,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[LCP 07]传递信息","frequency":65.50536752131264,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28464246551624633,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2706287683031869,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":64.81352939243217,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5834464043419267,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":18.544782681751272,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6853448275862069,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":6.426138519871788,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4074760172014555,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[LCP 12]小张刷题计划","frequency":40.73529753464515,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.612819006592259,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":7.049580196459441,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.20593354430379746,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":24.77959965613308,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5711311589174185,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":9.866248350870627,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30064308681672025,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7983468228000689,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[LCP 17]速算机器人","frequency":27.74436690886687,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2854962600207963,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[LCP 18]早餐组合","frequency":34.72792558917025,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162987442167878,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":34.03418856093366,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3041983351429606,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":17.18031537567092,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3273580879214682,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":7.702640064275236,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3327052794211855,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":50.59034996355039,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3376987839101964,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":16.538489277352273,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.275,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.32783505154639175,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3343989769820972,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32674853176721835,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":12.14608668388992,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.27639597608980904,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[LCP 28]采购方案","frequency":27.149670683455223,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18161061878410278,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[LCP 29]乐团站位","frequency":49.875591007440114,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3438219998683431,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[LCP 30]魔塔游戏","frequency":4.187315920688197,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.24330458465728552,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":15.921126355027134,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3951946975973488,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":17.18031537567092,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2085929648241206,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[LCP 33]蓄水","frequency":29.65577302110651,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4697826086956522,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":29.65577302110651,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.38514743356388786,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 35]电动车游城市","frequency":17.18031537567092,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2486659551760939,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":36.197199088388054,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.18743400211193242,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 37]最小矩形面积","frequency":31.790984195026773,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.535475234270415,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":20.031626952889315,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.4891493743069856,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.20118402568733695,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.35287128712871285,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.1512808119864669,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.32521489971346706,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.5400353252870179,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[LCS 01]下载插件","frequency":24.77959965613308,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7000228990153423,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[LCS 02]完成一半题目","frequency":17.18031537567092,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4168180638463535,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[LCS 03]主题空间","frequency":6.426138519871788,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786008063734859,"acs":0,"articleLive":2,"columnArticles":2725,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":97.50353879586149,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40286512759374654,"acs":0,"articleLive":2,"columnArticles":2016,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":74.85447137005772,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7615632400641997,"acs":0,"articleLive":2,"columnArticles":1878,"formTitle":"[剑指 Offer 05]替换空格","frequency":64.22554678261415,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523049167192545,"acs":0,"articleLive":2,"columnArticles":2018,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":77.80478772044773,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6967203743788299,"acs":0,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":80.7313112958513,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7169671995853254,"acs":0,"articleLive":2,"columnArticles":1596,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":93.45820866233284,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.35948011819116865,"acs":0,"articleLive":2,"columnArticles":1819,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":55.67896886821894,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4425950893450561,"acs":0,"articleLive":2,"columnArticles":1279,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":70.75924009314723,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49325173369774367,"acs":0,"articleLive":2,"columnArticles":1587,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":80.3879546554214,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4528323875854988,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":62.14968391864593,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5259941680843614,"acs":0,"articleLive":2,"columnArticles":1673,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":75.61562158116529,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5687850439379121,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":66.60984223756134,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31140877419852925,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":32.71944499693893,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7465571217074826,"acs":0,"articleLive":2,"columnArticles":1231,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":51.47390484590627,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3390498584357793,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":35.694620390120726,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.777208031820578,"acs":0,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":65.78371567813586,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5956843561194687,"acs":0,"articleLive":2,"columnArticles":1428,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":59.25970774098956,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37549639910196225,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":55.51827740437165,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24020256250648409,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":68.41722052892804,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6425670919260819,"acs":0,"articleLive":2,"columnArticles":1584,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":57.774155935167535,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7977103225499976,"acs":0,"articleLive":2,"columnArticles":2395,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":62.76500258187199,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427542134118822,"acs":0,"articleLive":2,"columnArticles":1778,"formTitle":"[剑指 Offer 24]反转链表","frequency":94.41664310952228,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7287438232111485,"acs":0,"articleLive":2,"columnArticles":1155,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":80.0890906510585,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4654835996635828,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[剑指 Offer 26]树的子结构","frequency":70.29517520805355,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7913166474048264,"acs":0,"articleLive":2,"columnArticles":1365,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":62.14968391864593,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5803456950417918,"acs":0,"articleLive":2,"columnArticles":1055,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":49.6429431469325,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44000288304549884,"acs":0,"articleLive":2,"columnArticles":1444,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":81.57542414991602,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5722271825614996,"acs":0,"articleLive":2,"columnArticles":879,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":59.41843402625664,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6145097705550356,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":38.764088808802995,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6452879256351337,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":63.038977476169265,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.68590218356209,"acs":0,"articleLive":2,"columnArticles":1055,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.96596246360329,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5885685796932856,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.51828711111286,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5507914561369621,"acs":0,"articleLive":2,"columnArticles":923,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":62.00714438243797,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5773660762794741,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":66.02806148125688,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7205352879689254,"acs":0,"articleLive":2,"columnArticles":793,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":59.591269079969656,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6544716515159477,"acs":0,"articleLive":2,"columnArticles":866,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":67.94338650912769,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5599617559401541,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":71.0142721223295,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5788965282118302,"acs":0,"articleLive":2,"columnArticles":1087,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":92.69112999473829,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6898917167347252,"acs":0,"articleLive":2,"columnArticles":997,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":57.57058451345001,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.56971932285172,"acs":0,"articleLive":2,"columnArticles":1774,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":74.63507308377277,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5807261378615182,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":47.87401825616976,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054056670386989,"acs":0,"articleLive":2,"columnArticles":1488,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":90.84343632571213,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4834064505646275,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":52.78642770627161,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41369579167923054,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":51.64902237772383,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5618966249088475,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.04787215529728,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5375352801849462,"acs":0,"articleLive":2,"columnArticles":1388,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":70.33403791977094,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889214608525711,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":55.51827740437165,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46458050326670547,"acs":0,"articleLive":2,"columnArticles":999,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":71.33034700239023,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6512871897641437,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[剑指 Offer 49]丑数","frequency":69.79655419941115,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6139045468436959,"acs":0,"articleLive":2,"columnArticles":1020,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":66.60984223756134,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4816399146432215,"acs":0,"articleLive":2,"columnArticles":821,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":92.3175206429803,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6482248782988433,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":66.9599734128987,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5386522357826656,"acs":0,"articleLive":2,"columnArticles":1532,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":59.38857780705593,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44700851581166945,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":56.39053320809448,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7553262802016846,"acs":0,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":46.23561835311511,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7894418288755723,"acs":0,"articleLive":2,"columnArticles":1235,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":59.09594346250475,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5868925251388163,"acs":0,"articleLive":2,"columnArticles":909,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":51.69045107739535,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6993415409455573,"acs":0,"articleLive":2,"columnArticles":1000,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":65.03305252683535,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7993728957786082,"acs":0,"articleLive":2,"columnArticles":678,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":49.6429431469325,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.664012018693435,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":63.34482910326923,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7063134871395823,"acs":0,"articleLive":2,"columnArticles":1829,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":58.38526153537554,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44138626393075114,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":58.75228786790889,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8568577081194453,"acs":0,"articleLive":2,"columnArticles":1735,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":54.277044701817175,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4439012260936258,"acs":0,"articleLive":2,"columnArticles":1166,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":75.4296211352779,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47459490439222635,"acs":0,"articleLive":2,"columnArticles":1046,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":48.31827823306406,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5602665593273403,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":57.41234622939962,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45970468307107004,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":61.19179229329305,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6553529652047978,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":74.75148294764648,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6334731208153472,"acs":0,"articleLive":2,"columnArticles":922,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":64.6758242878383,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8571603624520332,"acs":0,"articleLive":2,"columnArticles":1263,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":53.10821132058351,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5819189203076027,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.45261237120647,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5978890550599075,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":56.62650182723588,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2853026189016379,"acs":0,"articleLive":2,"columnArticles":541,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":45.31861075795656,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6930710701981712,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":48.41001293846093,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6997968189070602,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.15440149674634,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20515121951219512,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 001]整数除法","frequency":13.66597890590278,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5868080094228504,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5198922220128606,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7861579414374446,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":14.20030142024353,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6943558452364443,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":3.197492475500808,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.72059439095856,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6676718938480096,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":17.18031537567092,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4622700538105369,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5145617474096892,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5451862781261527,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4394800974817222,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5685081528352397,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":14.20030142024353,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6621745089081772,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":3.682795638898352,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6635730858468677,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":4.712374071363843,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5049085229808121,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.644122965641953,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.49584585469330034,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5285764998225062,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5407915993537964,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.47414167753150804,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":14.20030142024353,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7065287653522948,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5370459273483758,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":14.75343628308859,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5176625082074853,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":12.90603279489635,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7109114249037227,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7706677675714728,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 024]反转链表","frequency":21.662424136331353,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6142174768193313,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":22.842981762771895,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6582278481012658,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 026]重排链表","frequency":15.921126355027134,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6157011712567269,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 027]回文链表","frequency":2.279838333019291,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6038674033149172,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":16.538489277352273,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.301028954295286,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5280351048269137,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5879032258064516,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5970100747481313,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.784070796460177,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5756891098056937,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.7020925110132159,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5967395967395968,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.45949074074074076,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7782357790601814,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5234479678427869,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5731795241528479,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":15.32659934056083,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7912087912087912,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8594377510040161,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6442307692307693,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6483691328560064,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8116683725690891,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7164662349676225,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6903039073806078,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":4.712374071363843,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.672740524781341,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":5.830085131237878,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7534639273769709,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":15.32659934056083,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.617822966507177,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4195481788842785,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":24.109934946968394,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7364895042429657,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":2.730205226473301,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6463565253190613,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8495909376966646,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8914930555555556,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7338160136286201,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3559322033898305,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5891043397968606,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6286848072562359,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.670150987224158,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5365497076023392,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7200689061154177,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7224669603524229,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6041666666666666,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6246753246753247,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6422466422466423,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6383265856950068,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5195983155166829,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7246111619396157,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6775568181818182,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5188583078491336,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":5.830085131237878,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42321934219124374,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5417193426042983,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5420560747663551,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 074]合并区间","frequency":15.921126355027134,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7128661087866108,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6710561676968557,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":24.109934946968394,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.563124199743918,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6472158657513348,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.847542627883651,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 079]所有子集","frequency":3.682795638898352,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8183791606367583,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7886241352805534,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6480496453900709,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.712374071363843,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8569469835466179,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6759214935375778,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8566698202459792,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7679630850362558,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6325966850828729,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":16.538489277352273,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7451171875,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6162949476558944,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5222222222222223,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":4.187315920688197,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.750354609929078,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6435146443514644,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5453788509575354,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6084070796460177,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6638396299151889,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":45.80127155616185,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4969378827646544,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5297356828193832,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":4.712374071363843,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7626488095238095,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6815231501514496,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":24.109934946968394,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7413931144915933,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4694035631293571,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5935098206660974,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5010344827586207,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":29.65577302110651,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5546522131887985,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.691696750902527,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5350389321468298,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5469255663430421,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5689277899343544,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5998062015503876,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8433852140077821,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6598984771573604,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5899814471243042,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":5.830085131237878,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5719626168224299,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":15.921126355027134,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.3949329359165425,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.27381905524419536,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 115]重建序列","frequency":4.712374071363843,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6358904109589041,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.62890625,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7056,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.44144838212634824,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.259426648139519,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7211960559194975,"acs":0,"articleLive":2,"columnArticles":1489,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":76.26842098130103,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6501553126407892,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":45.94138348637294,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5795750306402082,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[面试题 01.03]URL化","frequency":40.05552799867142,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5509172221272717,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[面试题 01.04]回文排列","frequency":45.11533858127057,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33319721019204107,"acs":0,"articleLive":2,"columnArticles":536,"formTitle":"[面试题 01.05]一次编辑","frequency":40.05552799867142,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47282971062808377,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[面试题 01.06]字符串压缩","frequency":67.69183651869848,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7548561945581967,"acs":0,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 01.07]旋转矩阵","frequency":54.10583346148277,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.621774446887762,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 01.08]零矩阵","frequency":38.35224625078595,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5512194264829913,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[面试题 01.09]字符串轮转","frequency":36.97699908685729,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6837639198218263,"acs":0,"articleLive":2,"columnArticles":672,"formTitle":"[面试题 02.01]移除重复节点","frequency":47.87401825616976,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7801775474871996,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":59.95670003533804,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8538345462068294,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[面试题 02.03]删除中间节点","frequency":62.71477413927984,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.656609894566099,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[面试题 02.04]分割链表","frequency":46.584553024890646,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46660626116188675,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[面试题 02.05]链表求和","frequency":72.98814284859178,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48353153522190506,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[面试题 02.06]回文链表","frequency":27.74436690886687,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6862681243700085,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 02.07]链表相交","frequency":27.149670683455223,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320252959299497,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 02.08]环路检测","frequency":49.875591007440114,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5411114554281582,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6130972842901341,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 03.02]栈的最小值","frequency":42.73820845667335,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3862650364819562,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 03.03]堆盘子","frequency":33.36523851156228,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7119618126432811,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 03.04]化栈为队","frequency":35.694620390120726,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5443292466590453,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 03.05]栈排序","frequency":15.921126355027134,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5889500880131736,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.06]动物收容所","frequency":34.03418856093366,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5343172964241599,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.01]节点间通路","frequency":34.72792558917025,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7895143539549477,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[面试题 04.02]最小高度树","frequency":49.18567730825995,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8049722423364711,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":32.71944499693893,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5841526894158473,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 04.04]检查平衡性","frequency":17.18031537567092,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3512237562756732,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":34.72792558917025,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5907781862745098,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.06]后继者","frequency":17.18031537567092,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7164673742666487,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":30.340282799154465,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4781639928698752,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":17.18031537567092,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7172549558210869,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.10]检查子树","frequency":5.830085131237878,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4880473508792093,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.12]求和路径","frequency":34.03418856093366,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.506160394265233,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6878886310904873,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":17.18031537567092,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3897125567322239,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 05.03]翻转数位","frequency":39.07889161373655,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39161538461538464,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5272607633013724,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 05.06]整数转换","frequency":4.712374071363843,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7034794799898038,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":4.712374071363843,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.552297165200391,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":23.464938834974102,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36397645038636084,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[面试题 08.01]三步问题","frequency":40.82197876809073,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.361048642986969,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 08.02]迷路的机器人","frequency":36.32495819865756,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768652781439494,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":5.259426648139519,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8230553181096593,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[面试题 08.04]幂集","frequency":40.05552799867142,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6799684697999803,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 08.05]递归乘法","frequency":5.830085131237878,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6562194771617351,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":52.365288603579785,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.813598970720106,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":28.996011352404967,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185843887541543,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":45.80127155616185,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8120141614715616,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.09]括号","frequency":63.3905889266203,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5596396243972591,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 08.10]颜色填充","frequency":15.921126355027134,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4947031869281431,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":45.11533858127057,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7599302643358621,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 08.12]八皇后","frequency":44.45261237120647,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5012221203788573,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":17.18031537567092,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.533714589706078,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":24.77959965613308,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5542557240439895,"acs":0,"articleLive":2,"columnArticles":2362,"formTitle":"[面试题 10.01]合并排序的数组","frequency":72.80233142523765,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7394702842377261,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.069054968274415,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39646369137670195,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":59.50297259524958,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534399668864383,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.109934946968394,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4562140245447634,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":43.42143122754762,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6305723324705206,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6668476785229432,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":42.0781862781592,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8330093182275257,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[面试题 16.01]交换数字","frequency":24.109934946968394,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7663596703829375,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.02]单词频率","frequency":5.830085131237878,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4435029563759952,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":7.049580196459441,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46078109616015756,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4640138101983003,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":29.65577302110651,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4246428817886964,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.06]最小差","frequency":34.03418856093366,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.732883539063099,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 16.07]最大数值","frequency":40.73529753464515,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.375695263778864,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5494791666666666,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":9.107957057919515,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6833081881772047,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.10]生存人数","frequency":16.538489277352273,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44093283944941963,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[面试题 16.11]跳水板","frequency":23.464938834974102,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4320589590050668,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5505098789037604,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5033475701258224,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 16.15]珠玑妙算","frequency":5.830085131237878,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45204537641801307,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.16]部分排序","frequency":34.72792558917025,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6007373402577146,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[面试题 16.17]连续数列","frequency":37.65221825153508,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443267845298813,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 16.18]模式匹配","frequency":33.36523851156228,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6103653303910751,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[面试题 16.19]水域大小","frequency":47.24945846645417,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7204138279081503,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[面试题 16.20]T9键盘","frequency":29.65577302110651,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46533151266879075,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":5.259426648139519,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5822950819672131,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.702640064275236,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47235593144091054,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.24]数对和","frequency":24.109934946968394,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5445818389450957,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 16.25]LRU 缓存","frequency":87.4914890341532,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3872840359364202,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.26]计算器","frequency":58.25729901067792,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5976337293828646,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":16.538489277352273,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6451628295359656,"acs":0,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 17.04]消失的数字","frequency":36.97699908685729,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38680351906158356,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.18031537567092,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44871541501976286,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.830085131237878,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4116143346356051,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 17.07]婴儿名字","frequency":34.03418856093366,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2722546454685718,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":40.73529753464515,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.550261780104712,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[面试题 17.09]第 k 个数","frequency":52.590951865619736,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5710977384057784,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 17.10]主要元素","frequency":58.78178605175215,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6866207431842437,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 17.11]单词距离","frequency":34.03418856093366,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6314970432617492,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 17.12]BiNode","frequency":4.712374071363843,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.553072752433021,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":30.340282799154465,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5984074723831039,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[面试题 17.14]最小K个数","frequency":47.833556727690265,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4023275738969013,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.15]最长单词","frequency":31.790984195026773,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5189517208041641,"acs":0,"articleLive":2,"columnArticles":1128,"formTitle":"[面试题 17.16]按摩师","frequency":50.95760396809148,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4425020327564177,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.17]多次搜索","frequency":15.921126355027134,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44574237201583045,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.18]最短超串","frequency":24.77959965613308,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5816298342541436,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":34.72792558917025,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5716864751015496,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":17.18031537567092,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358465168116487,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 17.21]直方图的水量","frequency":87.82864082985733,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3718889179984281,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.05552799867142,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37942487544795034,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.23]最大黑方阵","frequency":5.259426648139519,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5194177308318881,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.24]最大子矩阵","frequency":74.57098699246797,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5013670539986329,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 17.25]单词矩阵","frequency":28.56910753685132,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34116801806425123,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.538489277352273,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/ValidParenthesisString.md b/src/main/java/leetcode/editor/cn/doc/content/ValidParenthesisString.md
new file mode 100644
index 0000000..47404ff
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/ValidParenthesisString.md
@@ -0,0 +1,37 @@
+给定一个只包含三种字符的字符串：（ ，） 和 *，写一个函数来检验这个字符串是否为有效字符串。有效字符串具有如下规则：
+
+
+ - 任何左括号
( 必须有相应的右括号 )。
+ - 任何右括号
) 必须有相应的左括号 ( 。
+ - 左括号
( 必须在对应的右括号之前 )。
+ * 可以被视为单个右括号 ) ，或单个左括号 ( ，或一个空字符串。- 一个空字符串也被视为有效字符串。
+
+
+示例 1:
+
+
+输入: "()"
+输出: True
+
+
+示例 2:
+
+
+输入: "(*)"
+输出: True
+
+
+示例 3:
+
+
+输入: "(*))"
+输出: True
+
+
+注意:
+
+
+ - 字符串大小将在 [1，100] 范围内。
+
+
👍 359👎 0
\ No newline at end of file