diff --git a/src/main/java/leetcode/editor/cn/MonotoneIncreasingDigits.java b/src/main/java/leetcode/editor/cn/MonotoneIncreasingDigits.java
new file mode 100644
index 0000000..a357dee
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/MonotoneIncreasingDigits.java
@@ -0,0 +1,59 @@
+//给定一个非负整数 N，找出小于或等于 N 的最大的整数，同时这个整数需要满足其各个位数上的数字是单调递增。
+//
+// （当且仅当每个相邻位数上的数字 x 和 y 满足 x <= y 时，我们称这个整数是单调递增的。）
+//
+// 示例 1:
+//
+// 输入: N = 10
+//输出: 9
+//
+//
+// 示例 2:
+//
+// 输入: N = 1234
+//输出: 1234
+//
+//
+// 示例 3:
+//
+// 输入: N = 332
+//输出: 299
+//
+//
+// 说明: N 是在 [0, 10^9] 范围内的一个整数。
+// Related Topics 贪心 数学 👍 205 👎 0
+
+package leetcode.editor.cn;
+
+//738:单调递增的数字
+class MonotoneIncreasingDigits {
+ public static void main(String[] args) {
+ //测试代码
+ Solution solution = new MonotoneIncreasingDigits().new Solution();
+ }
+
+ //力扣代码
+ //leetcode submit region begin(Prohibit modification and deletion)
+ class Solution {
+ public int monotoneIncreasingDigits(int n) {
+ char[] arr = (n + "").toCharArray();
+ int max = -1, idx = -1;
+ for (int i = 0; i < arr.length - 1; i++) {
+ if (max < arr[i]) {
+ max = arr[i];
+ idx = i;
+ }
+ if (arr[i] > arr[i + 1]) {
+ arr[idx] -= 1;
+ for (int j = idx + 1; j < arr.length; j++) {
+ arr[j] = '9';
+ }
+ break;
+ }
+ }
+ return Integer.parseInt(new String(arr));
+ }
+ }
+//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 8fa98e8..25fa3a9 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.42789730913993596,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[502]IPO","frequency":29.771219133044468,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.5196206386496128,"acs":0,"articleLive":2,"columnArticles":13960,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4082300523084888,"acs":0,"articleLive":2,"columnArticles":7000,"formTitle":"[2]两数相加","frequency":99.27463906942954,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37946216938391675,"acs":0,"articleLive":2,"columnArticles":7207,"formTitle":"[3]无重复字符的最长子串","frequency":96.9203360351677,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4077630176301763,"acs":0,"articleLive":2,"columnArticles":3708,"formTitle":"[4]寻找两个正序数组的中位数","frequency":94.73959529949452,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3532358823369451,"acs":0,"articleLive":2,"columnArticles":3877,"formTitle":"[5]最长回文子串","frequency":97.82391720828862,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5064705650543226,"acs":0,"articleLive":2,"columnArticles":2388,"formTitle":"[6]Z 字形变换","frequency":79.44968489477911,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3535731684093036,"acs":0,"articleLive":2,"columnArticles":5152,"formTitle":"[7]整数反转","frequency":98.54927813885908,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21710591668915094,"acs":0,"articleLive":2,"columnArticles":2629,"formTitle":"[8]字符串转换整数 (atoi)","frequency":69.94099560939304,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5852517652118293,"acs":0,"articleLive":2,"columnArticles":4813,"formTitle":"[9]回文数","frequency":79.85740808504671,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31649967065261453,"acs":0,"articleLive":2,"columnArticles":1218,"formTitle":"[10]正则表达式匹配","frequency":86.75214884853298,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6307117219094058,"acs":0,"articleLive":2,"columnArticles":2935,"formTitle":"[11]盛最多水的容器","frequency":86.57388042621189,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6653660237602809,"acs":0,"articleLive":2,"columnArticles":1728,"formTitle":"[12]整数转罗马数字","frequency":75.80172398777341,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6329701119932465,"acs":0,"articleLive":2,"columnArticles":3791,"formTitle":"[13]罗马数字转整数","frequency":82.45529102111982,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4077679212653232,"acs":0,"articleLive":2,"columnArticles":3790,"formTitle":"[14]最长公共前缀","frequency":89.56210296936796,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33386805367757466,"acs":0,"articleLive":2,"columnArticles":2979,"formTitle":"[15]三数之和","frequency":95.70095210060153,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45955303288743077,"acs":0,"articleLive":2,"columnArticles":1392,"formTitle":"[16]最接近的三数之和","frequency":83.28523414071563,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.572113981065714,"acs":0,"articleLive":2,"columnArticles":2986,"formTitle":"[17]电话号码的字母组合","frequency":74.0545175207128,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4010075247406612,"acs":0,"articleLive":2,"columnArticles":1474,"formTitle":"[18]四数之和","frequency":67.15031791128484,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42836797772447505,"acs":0,"articleLive":2,"columnArticles":3728,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":75.22648535882391,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4449248454199939,"acs":0,"articleLive":2,"columnArticles":5415,"formTitle":"[20]有效的括号","frequency":92.40071213107535,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6671604928720765,"acs":0,"articleLive":2,"columnArticles":3358,"formTitle":"[21]合并两个有序链表","frequency":86.31840353549384,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724537400700815,"acs":0,"articleLive":2,"columnArticles":2563,"formTitle":"[22]括号生成","frequency":91.66625165587287,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.558907508662478,"acs":0,"articleLive":2,"columnArticles":2045,"formTitle":"[23]合并K个升序链表","frequency":81.50285603180713,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7029861740188678,"acs":0,"articleLive":2,"columnArticles":2446,"formTitle":"[24]两两交换链表中的节点","frequency":60.99725360452004,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6566243312343165,"acs":0,"articleLive":2,"columnArticles":2116,"formTitle":"[25]K 个一组翻转链表","frequency":89.24214331639038,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5401410765648541,"acs":0,"articleLive":2,"columnArticles":4412,"formTitle":"[26]删除有序数组中的重复项","frequency":80.14340493194885,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5981836502852889,"acs":0,"articleLive":2,"columnArticles":3967,"formTitle":"[27]移除元素","frequency":74.34086178206253,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40699398786866464,"acs":0,"articleLive":2,"columnArticles":3156,"formTitle":"[28]实现 strStr()","frequency":71.6819981451233,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2075416465534121,"acs":0,"articleLive":2,"columnArticles":870,"formTitle":"[29]两数相除","frequency":66.19760945911813,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3564239685676252,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[30]串联所有单词的子串","frequency":54.24972677169939,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37326133466983547,"acs":0,"articleLive":2,"columnArticles":1689,"formTitle":"[31]下一个排列","frequency":81.20882746761659,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35614593229059277,"acs":0,"articleLive":2,"columnArticles":1268,"formTitle":"[32]最长有效括号","frequency":74.77575227891113,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4262516555010972,"acs":0,"articleLive":2,"columnArticles":2331,"formTitle":"[33]搜索旋转排序数组","frequency":71.31942122678112,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4243012281835811,"acs":0,"articleLive":2,"columnArticles":3165,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.56461578061828,"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.46533605380546195,"acs":0,"articleLive":2,"columnArticles":3802,"formTitle":"[35]搜索插入位置","frequency":73.1751495265567,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6282906129353306,"acs":0,"articleLive":2,"columnArticles":1130,"formTitle":"[36]有效的数独","frequency":52.77214370728621,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706703546352412,"acs":0,"articleLive":2,"columnArticles":826,"formTitle":"[37]解数独","frequency":65.15766895372907,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5798481636003009,"acs":0,"articleLive":2,"columnArticles":2237,"formTitle":"[38]外观数列","frequency":65.15766895372907,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7271861281234414,"acs":0,"articleLive":2,"columnArticles":1886,"formTitle":"[39]组合总和","frequency":71.05745497848979,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6266553831444851,"acs":0,"articleLive":2,"columnArticles":1350,"formTitle":"[40]组合总和 II","frequency":71.34999021368358,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41912278452194346,"acs":0,"articleLive":2,"columnArticles":1384,"formTitle":"[41]缺失的第一个正数","frequency":87.4690808328411,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.576706189347673,"acs":0,"articleLive":2,"columnArticles":2369,"formTitle":"[42]接雨水","frequency":95.16553058900486,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4489533761883598,"acs":0,"articleLive":2,"columnArticles":1110,"formTitle":"[43]字符串相乘","frequency":80.59928036825728,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32803749453866626,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[44]通配符匹配","frequency":60.31844529881909,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4265806323879462,"acs":0,"articleLive":2,"columnArticles":1547,"formTitle":"[45]跳跃游戏 II","frequency":96.22957532100939,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7825621036754294,"acs":0,"articleLive":2,"columnArticles":2607,"formTitle":"[46]全排列","frequency":93.0460450446726,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6368210889544701,"acs":0,"articleLive":2,"columnArticles":1435,"formTitle":"[47]全排列 II","frequency":66.09988371634661,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352742532132486,"acs":0,"articleLive":2,"columnArticles":1821,"formTitle":"[48]旋转图像","frequency":72.30511505440981,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6644547711726361,"acs":0,"articleLive":2,"columnArticles":1275,"formTitle":"[49]字母异位词分组","frequency":68.39261910635852,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767707951728381,"acs":0,"articleLive":2,"columnArticles":1255,"formTitle":"[50]Pow(x, n)","frequency":66.58913841032383,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7393833480202382,"acs":0,"articleLive":2,"columnArticles":1503,"formTitle":"[51]N 皇后","frequency":67.51292783323733,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.823317539852973,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[52]N皇后 II","frequency":28.48603299997492,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5516696647421231,"acs":0,"articleLive":2,"columnArticles":3652,"formTitle":"[53]最大子序和","frequency":78.93185894496196,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4799123790648551,"acs":0,"articleLive":2,"columnArticles":1949,"formTitle":"[54]螺旋矩阵","frequency":86.925376033259,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43230168031128924,"acs":0,"articleLive":2,"columnArticles":2405,"formTitle":"[55]跳跃游戏","frequency":74.4857724315505,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.467380185793315,"acs":0,"articleLive":2,"columnArticles":2243,"formTitle":"[56]合并区间","frequency":84.01059507128609,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4107424730321089,"acs":0,"articleLive":2,"columnArticles":909,"formTitle":"[57]插入区间","frequency":37.60137052337985,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35451584846681533,"acs":0,"articleLive":2,"columnArticles":2341,"formTitle":"[58]最后一个单词的长度","frequency":54.312436076429634,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7927413817673045,"acs":0,"articleLive":2,"columnArticles":1520,"formTitle":"[59]螺旋矩阵 II","frequency":79.04562476175751,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233998236655089,"acs":0,"articleLive":2,"columnArticles":928,"formTitle":"[60]排列序列","frequency":43.18932526293026,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41797859215624944,"acs":0,"articleLive":2,"columnArticles":1955,"formTitle":"[61]旋转链表","frequency":68.97015961284075,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6607025913477177,"acs":0,"articleLive":2,"columnArticles":2364,"formTitle":"[62]不同路径","frequency":67.56302368465924,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39033020175915345,"acs":0,"articleLive":2,"columnArticles":1666,"formTitle":"[63]不同路径 II","frequency":70.19584609026657,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6879770942098082,"acs":0,"articleLive":2,"columnArticles":2029,"formTitle":"[64]最小路径和","frequency":73.092148470307,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2691885672259687,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[65]有效数字","frequency":43.804556856982224,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45835293800430066,"acs":0,"articleLive":2,"columnArticles":3096,"formTitle":"[66]加一","frequency":63.26866034486089,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.543663084612434,"acs":0,"articleLive":2,"columnArticles":1743,"formTitle":"[67]二进制求和","frequency":54.85360516522901,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.4709395763870565,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[68]文本左右对齐","frequency":45.91589140570294,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3928305549534947,"acs":0,"articleLive":2,"columnArticles":1890,"formTitle":"[69]x 的平方根","frequency":79.28361977991985,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5285169830866767,"acs":0,"articleLive":2,"columnArticles":3473,"formTitle":"[70]爬楼梯","frequency":93.01409153565463,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42125623349956,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[71]简化路径","frequency":58.451020101829,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6131886271982855,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[72]编辑距离","frequency":92.94201541859753,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6022756112004061,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[73]矩阵置零","frequency":54.24972677169939,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45934593039526267,"acs":0,"articleLive":2,"columnArticles":1649,"formTitle":"[74]搜索二维矩阵","frequency":75.33332405294894,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5944284152654822,"acs":0,"articleLive":2,"columnArticles":1802,"formTitle":"[75]颜色分类","frequency":49.087347621680536,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4247562170932019,"acs":0,"articleLive":2,"columnArticles":1217,"formTitle":"[76]最小覆盖子串","frequency":76.29539606454848,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.770139564127121,"acs":0,"articleLive":2,"columnArticles":1229,"formTitle":"[77]组合","frequency":73.73090542449428,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8007474153868126,"acs":0,"articleLive":2,"columnArticles":1988,"formTitle":"[78]子集","frequency":71.87280854956579,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4575875271548127,"acs":0,"articleLive":2,"columnArticles":1357,"formTitle":"[79]单词搜索","frequency":72.64912933555247,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.61637697134136,"acs":0,"articleLive":2,"columnArticles":1306,"formTitle":"[80]删除有序数组中的重复项 II","frequency":68.19721907712427,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4158497235752307,"acs":0,"articleLive":2,"columnArticles":970,"formTitle":"[81]搜索旋转排序数组 II","frequency":71.34999021368358,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5295938104448743,"acs":0,"articleLive":2,"columnArticles":1643,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":80.99359190182246,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386492869342743,"acs":0,"articleLive":2,"columnArticles":1883,"formTitle":"[83]删除排序链表中的重复元素","frequency":70.0057605584441,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4329917484117518,"acs":0,"articleLive":2,"columnArticles":1125,"formTitle":"[84]柱状图中最大的矩形","frequency":75.60754989719504,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5161225411017387,"acs":0,"articleLive":2,"columnArticles":668,"formTitle":"[85]最大矩形","frequency":59.70973951936234,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6321437066188077,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[86]分隔链表","frequency":57.081406529966074,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48822160480634513,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[87]扰乱字符串","frequency":67.98674060709189,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5156899032090433,"acs":0,"articleLive":2,"columnArticles":3140,"formTitle":"[88]合并两个有序数组","frequency":97.09855627771815,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7097785543452668,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[89]格雷编码","frequency":45.91589140570294,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336500801350441,"acs":0,"articleLive":2,"columnArticles":1177,"formTitle":"[90]子集 II","frequency":72.81224872615874,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3054932013288933,"acs":0,"articleLive":2,"columnArticles":1484,"formTitle":"[91]解码方法","frequency":70.12665177145549,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5476366757873277,"acs":0,"articleLive":2,"columnArticles":1977,"formTitle":"[92]反转链表 II","frequency":87.22461399739058,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5380811800038682,"acs":0,"articleLive":2,"columnArticles":1289,"formTitle":"[93]复原 IP 地址","frequency":82.17108604329304,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559552373724974,"acs":0,"articleLive":2,"columnArticles":2225,"formTitle":"[94]二叉树的中序遍历","frequency":60.8190526578316,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.700261358347356,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[95]不同的二叉搜索树 II","frequency":61.26755201022692,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993231938824223,"acs":0,"articleLive":2,"columnArticles":1245,"formTitle":"[96]不同的二叉搜索树","frequency":65.55399242074793,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4573775549556498,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[97]交错字符串","frequency":44.440004346103564,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.349038973936005,"acs":0,"articleLive":2,"columnArticles":1872,"formTitle":"[98]验证二叉搜索树","frequency":73.57408880957361,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6131045241809673,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[99]恢复二叉搜索树","frequency":54.785148283296095,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6036484369356916,"acs":0,"articleLive":2,"columnArticles":1835,"formTitle":"[100]相同的树","frequency":56.35511387858786,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5620170818384604,"acs":0,"articleLive":2,"columnArticles":2192,"formTitle":"[101]对称二叉树","frequency":73.30726334109073,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.642082382276942,"acs":0,"articleLive":2,"columnArticles":2424,"formTitle":"[102]二叉树的层序遍历","frequency":86.0957451951369,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716820799870204,"acs":0,"articleLive":2,"columnArticles":1543,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":79.87191363560451,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7660379675901404,"acs":0,"articleLive":2,"columnArticles":2479,"formTitle":"[104]二叉树的最大深度","frequency":76.71950754501107,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7039619475287527,"acs":0,"articleLive":2,"columnArticles":1393,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.90446325276024,"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.721331414097457,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":72.3804766622097,"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.6957742677022744,"acs":0,"articleLive":2,"columnArticles":1280,"formTitle":"[107]二叉树的层序遍历 II","frequency":60.94617764811285,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7599225832739126,"acs":0,"articleLive":2,"columnArticles":1159,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.38981146471504,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7633992678857503,"acs":0,"articleLive":2,"columnArticles":709,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.287582662412085,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5627874599109962,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[110]平衡二叉树","frequency":62.78084792145688,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48479901005642306,"acs":0,"articleLive":2,"columnArticles":1737,"formTitle":"[111]二叉树的最小深度","frequency":43.18932526293026,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5256960293959243,"acs":0,"articleLive":2,"columnArticles":1614,"formTitle":"[112]路径总和","frequency":61.26755201022692,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6266403222350151,"acs":0,"articleLive":2,"columnArticles":1205,"formTitle":"[113]路径总和 II","frequency":63.3463712658148,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7254177146583335,"acs":0,"articleLive":2,"columnArticles":1283,"formTitle":"[114]二叉树展开为链表","frequency":44.79100183010633,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5234250635427385,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[115]不同的子序列","frequency":63.87889911414967,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.702824002157999,"acs":0,"articleLive":2,"columnArticles":1133,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":46.12611622495805,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6110836464306901,"acs":0,"articleLive":2,"columnArticles":732,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":28.362425163178255,"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.7270992835785235,"acs":0,"articleLive":2,"columnArticles":1683,"formTitle":"[118]杨辉三角","frequency":73.39487343532683,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6640216964225819,"acs":0,"articleLive":2,"columnArticles":1177,"formTitle":"[119]杨辉三角 II","frequency":55.409905402038326,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6794798323153978,"acs":0,"articleLive":2,"columnArticles":1531,"formTitle":"[120]三角形最小路径和","frequency":52.46577469520965,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733778213521405,"acs":0,"articleLive":2,"columnArticles":3300,"formTitle":"[121]买卖股票的最佳时机","frequency":84.82641245270685,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6879035490734174,"acs":0,"articleLive":2,"columnArticles":2571,"formTitle":"[122]买卖股票的最佳时机 II","frequency":66.82774247538966,"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.5345391917933626,"acs":0,"articleLive":2,"columnArticles":802,"formTitle":"[123]买卖股票的最佳时机 III","frequency":62.5685429895862,"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.44363981940709374,"acs":0,"articleLive":2,"columnArticles":1069,"formTitle":"[124]二叉树中的最大路径和","frequency":81.64947957118645,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47371879566968184,"acs":0,"articleLive":2,"columnArticles":1800,"formTitle":"[125]验证回文串","frequency":66.82774247538966,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3938722535379536,"acs":0,"articleLive":2,"columnArticles":321,"formTitle":"[126]单词接龙 II","frequency":37.69846188927235,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4673079297465815,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[127]单词接龙","frequency":50.58020098113215,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433037066122716,"acs":0,"articleLive":2,"columnArticles":1065,"formTitle":"[128]最长连续序列","frequency":77.23169885610702,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6807813594954449,"acs":0,"articleLive":2,"columnArticles":1089,"formTitle":"[129]求根节点到叶节点数字之和","frequency":60.99725360452004,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44328138740836476,"acs":0,"articleLive":2,"columnArticles":1140,"formTitle":"[130]被围绕的区域","frequency":53.69407610664481,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7232651104185367,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[131]分割回文串","frequency":74.41827359077716,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923336942991023,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[132]分割回文串 II","frequency":45.09699522101154,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6752759109100069,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[133]克隆图","frequency":16.183442713396072,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5763237217767161,"acs":0,"articleLive":2,"columnArticles":948,"formTitle":"[134]加油站","frequency":74.72506003312003,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48665359291172167,"acs":0,"articleLive":2,"columnArticles":763,"formTitle":"[135]分发糖果","frequency":85.78562898581812,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7194514923205051,"acs":0,"articleLive":2,"columnArticles":2201,"formTitle":"[136]只出现一次的数字","frequency":74.5400472294296,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7196148865656573,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[137]只出现一次的数字 II","frequency":73.30726334109073,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6595766444439096,"acs":0,"articleLive":2,"columnArticles":846,"formTitle":"[138]复制带随机指针的链表","frequency":68.93357777311871,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5134699529216283,"acs":0,"articleLive":2,"columnArticles":1169,"formTitle":"[139]单词拆分","frequency":76.54592369117523,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4847039979139699,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[140]单词拆分 II","frequency":41.4533539470012,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.512494095204855,"acs":0,"articleLive":2,"columnArticles":2658,"formTitle":"[141]环形链表","frequency":74.38643316657867,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5519960771519197,"acs":0,"articleLive":2,"columnArticles":1662,"formTitle":"[142]环形链表 II","frequency":69.56461578061828,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6181537292642776,"acs":0,"articleLive":2,"columnArticles":1052,"formTitle":"[143]重排链表","frequency":90.03296290838603,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.702729958776384,"acs":0,"articleLive":2,"columnArticles":1785,"formTitle":"[144]二叉树的前序遍历","frequency":50.444624228960755,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7494023398750029,"acs":0,"articleLive":2,"columnArticles":1502,"formTitle":"[145]二叉树的后序遍历","frequency":68.18184885033645,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5266911681874508,"acs":0,"articleLive":2,"columnArticles":1349,"formTitle":"[146]LRU 缓存机制","frequency":92.1109115589459,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6810040082391583,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[147]对链表进行插入排序","frequency":44.11967361024707,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670593008493986,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[148]排序链表","frequency":77.41132029011523,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3378335274351119,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[149]直线上最多的点数","frequency":66.63175827085747,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362869600932637,"acs":0,"articleLive":2,"columnArticles":1022,"formTitle":"[150]逆波兰表达式求值","frequency":68.93357777311871,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48084018801410106,"acs":0,"articleLive":2,"columnArticles":1389,"formTitle":"[151]翻转字符串里的单词","frequency":54.882499728525005,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4207511850990298,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[152]乘积最大子数组","frequency":76.74762822359588,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5660117210489813,"acs":0,"articleLive":2,"columnArticles":1446,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":55.9516563579218,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5318840510144817,"acs":0,"articleLive":2,"columnArticles":876,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":64.3225951485854,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5730250331755108,"acs":0,"articleLive":2,"columnArticles":1563,"formTitle":"[155]最小栈","frequency":71.25201024667808,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7249681676119921,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[156]上下翻转二叉树","frequency":16.7954628814756,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5308253903873453,"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.59,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.717188864301861,"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.5427412344248044,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":39.112788599468395,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6127070268759642,"acs":0,"articleLive":2,"columnArticles":1911,"formTitle":"[160]相交链表","frequency":68.3461907936223,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3361464018713021,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":5.5605738976163455,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49462603922769716,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[162]寻找峰值","frequency":57.444451527870335,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32366953502973,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[163]缺失的区间","frequency":17.431734517438745,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6107323949588672,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[164]最大间距","frequency":56.09864490080408,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5181717888100866,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[165]比较版本号","frequency":55.409905402038326,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2986275926117016,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[166]分数到小数","frequency":50.22628216013047,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865952114934257,"acs":0,"articleLive":2,"columnArticles":1832,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":62.78084792145688,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325683152071018,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[168]Excel表列名称","frequency":59.95101147462879,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646763784210853,"acs":0,"articleLive":2,"columnArticles":2121,"formTitle":"[169]多数元素","frequency":70.45669660580673,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4161966156325544,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.018255598477773,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174290005461497,"acs":0,"articleLive":2,"columnArticles":897,"formTitle":"[171]Excel 表列序号","frequency":48.96477832790934,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43814035365322995,"acs":0,"articleLive":2,"columnArticles":582,"formTitle":"[172]阶乘后的零","frequency":44.7001368019501,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.803364844678508,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[173]二叉搜索树迭代器","frequency":48.36315695657654,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.47961633774604845,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[174]地下城游戏","frequency":62.956231017328946,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7399517725103308,"acs":0,"articleLive":2,"columnArticles":1439,"formTitle":"[175]组合两个表","frequency":93.01409153565463,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35615835968646187,"acs":0,"articleLive":2,"columnArticles":990,"formTitle":"[176]第二高的薪水","frequency":93.1288942313645,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4625169107151509,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[177]第N高的薪水","frequency":76.75850340740806,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6027468824608054,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[178]分数排名","frequency":66.99914322077328,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4099366773538862,"acs":0,"articleLive":2,"columnArticles":942,"formTitle":"[179]最大数","frequency":82.2466970476615,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48720509371770965,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[180]连续出现的数字","frequency":70.21589154857165,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7028349473141552,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[181]超过经理收入的员工","frequency":70.11166040006901,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7973890315730245,"acs":0,"articleLive":2,"columnArticles":559,"formTitle":"[182]查找重复的电子邮箱","frequency":60.97392022076764,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6774075021511128,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[183]从不订购的客户","frequency":46.612506335453844,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47498454356796754,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[184]部门工资最高的员工","frequency":73.62580435731155,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49390314378178457,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[185]部门工资前三高的所有员工","frequency":73.42499810475532,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7538287593791757,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.126293813912077,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48321631911697926,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[187]重复的DNA序列","frequency":31.59112236575192,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38999012921751613,"acs":0,"articleLive":2,"columnArticles":675,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":49.977320218435665,"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.45245275293193266,"acs":0,"articleLive":2,"columnArticles":1628,"formTitle":"[189]旋转数组","frequency":63.097644481530764,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6964019332895758,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[190]颠倒二进制位","frequency":48.194601299975886,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7477310172857609,"acs":0,"articleLive":2,"columnArticles":1175,"formTitle":"[191]位1的个数","frequency":60.97392022076764,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35599671367012625,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[192]统计词频","frequency":56.09864490080408,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3242426934351959,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[193]有效电话号码","frequency":36.38268815024056,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34510702318265746,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[194]转置文件","frequency":29.11716714389944,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4365150945759739,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[195]第十行","frequency":52.507913391402326,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.665278349680372,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[196]删除重复的电子邮箱","frequency":58.451020101829,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339345899752916,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[197]上升的温度","frequency":56.64186027511783,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.512813702811267,"acs":0,"articleLive":2,"columnArticles":2578,"formTitle":"[198]打家劫舍","frequency":78.10875193978319,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524391997469252,"acs":0,"articleLive":2,"columnArticles":1539,"formTitle":"[199]二叉树的右视图","frequency":84.1049361392743,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5531823610376602,"acs":0,"articleLive":2,"columnArticles":2059,"formTitle":"[200]岛屿数量","frequency":89.44694254754734,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5228629088829173,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[201]数字范围按位与","frequency":37.02908617571276,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6183205819452393,"acs":0,"articleLive":2,"columnArticles":1341,"formTitle":"[202]快乐数","frequency":62.175072331320315,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5140947098269725,"acs":0,"articleLive":2,"columnArticles":1598,"formTitle":"[203]移除链表元素","frequency":56.40126087006008,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37899278988654067,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[204]计数质数","frequency":53.59160062730145,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5009198221677142,"acs":0,"articleLive":2,"columnArticles":855,"formTitle":"[205]同构字符串","frequency":50.88870073928404,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7227027897154791,"acs":0,"articleLive":2,"columnArticles":7241,"formTitle":"[206]反转链表","frequency":92.39691574212195,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.544690117785443,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[207]课程表","frequency":70.14248800485817,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7164152206374543,"acs":0,"articleLive":2,"columnArticles":938,"formTitle":"[208]实现 Trie (前缀树)","frequency":68.869403694828,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.470138404502937,"acs":0,"articleLive":2,"columnArticles":1312,"formTitle":"[209]长度最小的子数组","frequency":55.924216225811286,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5414753635021826,"acs":0,"articleLive":2,"columnArticles":658,"formTitle":"[210]课程表 II","frequency":48.824296466419774,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48175356661950947,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":31.154717435598055,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4498997995991984,"acs":0,"articleLive":2,"columnArticles":394,"formTitle":"[212]单词搜索 II","frequency":41.4533539470012,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4327723154514017,"acs":0,"articleLive":2,"columnArticles":1465,"formTitle":"[213]打家劫舍 II","frequency":72.11047054698605,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3711073187853261,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[214]最短回文串","frequency":57.55182983125098,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6468402054148727,"acs":0,"articleLive":2,"columnArticles":2224,"formTitle":"[215]数组中的第K个最大元素","frequency":90.302768440328,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7385696179052801,"acs":0,"articleLive":2,"columnArticles":990,"formTitle":"[216]组合总和 III","frequency":66.08304057702925,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5611728560930049,"acs":0,"articleLive":2,"columnArticles":1606,"formTitle":"[217]存在重复元素","frequency":71.84709560263556,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5433375769149162,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[218]天际线问题","frequency":64.19108103575208,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4252130681818182,"acs":0,"articleLive":2,"columnArticles":858,"formTitle":"[219]存在重复元素 II","frequency":49.132108606911764,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28688342685815477,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":60.65841150614939,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47400692677410233,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[221]最大正方形","frequency":73.30726334109073,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7803978039780398,"acs":0,"articleLive":2,"columnArticles":862,"formTitle":"[222]完全二叉树的节点个数","frequency":40.754859727265256,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4617340452580727,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[223]矩形面积","frequency":45.77699202581343,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41795243320581765,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[224]基本计算器","frequency":74.79860495328833,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6756822197837298,"acs":0,"articleLive":2,"columnArticles":4731,"formTitle":"[225]用队列实现栈","frequency":48.7046785344134,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7877808420369908,"acs":0,"articleLive":2,"columnArticles":1806,"formTitle":"[226]翻转二叉树","frequency":73.37057444142592,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43676803361362104,"acs":0,"articleLive":2,"columnArticles":692,"formTitle":"[227]基本计算器 II","frequency":79.04562476175751,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5816041375570895,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[228]汇总区间","frequency":16.183442713396072,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4636260689601312,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[229]求众数 II","frequency":38.800710146713705,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7406717351768324,"acs":0,"articleLive":2,"columnArticles":830,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":40.840790807905634,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.503555544543416,"acs":0,"articleLive":2,"columnArticles":1179,"formTitle":"[231]2 的幂","frequency":45.464951181090974,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6915463861847346,"acs":0,"articleLive":2,"columnArticles":1232,"formTitle":"[232]用栈实现队列","frequency":57.347332850663754,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.476445941737678,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[233]数字 1 的个数","frequency":40.08097302202694,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4939329085876219,"acs":0,"articleLive":2,"columnArticles":1928,"formTitle":"[234]回文链表","frequency":78.040930158621,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6661663091726394,"acs":0,"articleLive":2,"columnArticles":941,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":53.15355586244086,"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.6801121627124573,"acs":0,"articleLive":2,"columnArticles":1339,"formTitle":"[236]二叉树的最近公共祖先","frequency":73.37702389162844,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481757942649445,"acs":0,"articleLive":2,"columnArticles":1003,"formTitle":"[237]删除链表中的节点","frequency":53.785611653509946,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7227272483207062,"acs":0,"articleLive":2,"columnArticles":842,"formTitle":"[238]除自身以外数组的乘积","frequency":56.508539079287225,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4961302189983688,"acs":0,"articleLive":2,"columnArticles":1283,"formTitle":"[239]滑动窗口最大值","frequency":65.82873618149235,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4752157346675595,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[240]搜索二维矩阵 II","frequency":63.83896700169065,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7369401180226371,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[241]为运算表达式设计优先级","frequency":55.409905402038326,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6441843070131562,"acs":0,"articleLive":2,"columnArticles":1620,"formTitle":"[242]有效的字母异位词","frequency":57.081406529966074,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6566130645533584,"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.5473166266163176,"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.6091987695913286,"acs":0,"articleLive":2,"columnArticles":56,"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.4743821579264617,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5221608092606111,"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.4631956912028725,"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.6387216303844372,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6339351240275943,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[250]统计同值子树","frequency":6.126293813912077,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5433932759968726,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":16.183442713396072,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5617668711656442,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[252]会议室","frequency":6.126293813912077,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4979761049813932,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[253]会议室 II","frequency":52.507913391402326,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5694572217111316,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[254]因子的组合","frequency":17.431734517438745,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47228485531754977,"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.6338903781440712,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[256]粉刷房子","frequency":6.717188864301861,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6809737853586812,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[257]二叉树的所有路径","frequency":62.43459535564136,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917986440616924,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[258]各位相加","frequency":47.21264610252666,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5656037203122405,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.018255598477773,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7255435951094357,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[260]只出现一次的数字 III","frequency":51.84422950385802,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49643202709240447,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[261]以图判树","frequency":23.63396138377883,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43721356553620533,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[262]行程和用户","frequency":62.67634598009314,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152445011783189,"acs":0,"articleLive":2,"columnArticles":825,"formTitle":"[263]丑数","frequency":56.72144306952094,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5790520660861693,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[264]丑数 II","frequency":62.26367544289448,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5827239488117002,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[265]粉刷房子 II","frequency":5.5605738976163455,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6714970809007507,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44600431965442766,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.717188864301861,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6236934681865846,"acs":0,"articleLive":2,"columnArticles":1065,"formTitle":"[268]丢失的数字","frequency":32.189666716451356,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33949831109142253,"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.550491668138727,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.7954628814756,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5516198704103672,"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.6452742123687282,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":7.982643366845061,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30902051877661635,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[273]整数转换英文表示","frequency":29.771219133044468,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404692375723797,"acs":0,"articleLive":2,"columnArticles":558,"formTitle":"[274]H 指数","frequency":56.72144306952094,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4626498248202102,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[275]H 指数 II","frequency":32.808377617599525,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4864558218692384,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[276]栅栏涂色","frequency":24.937244926792673,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5694901645925331,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":6.126293813912077,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45493496185184584,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[278]第一个错误的版本","frequency":68.74426008484677,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6310295511883145,"acs":0,"articleLive":2,"columnArticles":1166,"formTitle":"[279]完全平方数","frequency":72.10146245170522,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6863613360323887,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.7954628814756,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7576042646597679,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3887294403355779,"acs":0,"articleLive":2,"columnArticles":70,"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.6390899988446875,"acs":0,"articleLive":2,"columnArticles":3235,"formTitle":"[283]移动零","frequency":75.79152127876134,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7340292582518562,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[284]顶端迭代器","frequency":24.27337559962882,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6356008883770667,"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.5070236850479611,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[286]墙与门","frequency":6.126293813912077,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6618284121843523,"acs":0,"articleLive":2,"columnArticles":1198,"formTitle":"[287]寻找重复数","frequency":61.541532672516006,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42800713557594294,"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.753539234947417,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[289]生命游戏","frequency":16.183442713396072,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45710072646944955,"acs":0,"articleLive":2,"columnArticles":1067,"formTitle":"[290]单词规律","frequency":27.876354625024913,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.532941943900848,"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.6963069755318803,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[292]Nim 游戏","frequency":40.08097302202694,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7104517668107947,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":5.5605738976163455,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5848897863032139,"acs":0,"articleLive":2,"columnArticles":52,"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.5232620410349098,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[295]数据流的中位数","frequency":39.20109709668201,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6208080274623713,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":19.505000983338796,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5584886755265852,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[297]二叉树的序列化与反序列化","frequency":56.571385362260884,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5787916152897657,"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.5037178200132718,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[299]猜数字游戏","frequency":23.017386824306058,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5125056857628498,"acs":0,"articleLive":2,"columnArticles":1928,"formTitle":"[300]最长递增子序列","frequency":78.39746939119182,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220902849182394,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[301]删除无效的括号","frequency":50.22628216013047,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6650535776011062,"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.724613871629726,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":47.89480770437785,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5420162130658236,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":38.800710146713705,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3781302170283806,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":5.5605738976163455,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3374263463677943,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[306]累加数","frequency":40.640882130761085,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5424528301886793,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[307]区域和检索 - 数组可修改","frequency":20.23036191390926,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6056338028169014,"acs":0,"articleLive":2,"columnArticles":41,"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.605837413245817,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":70.59059301383121,"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.37983717677437867,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[310]最小高度树","frequency":45.60475044229772,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7624383684446436,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.431734517438745,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6831016751948555,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[312]戳气球","frequency":51.84422950385802,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6440691609247214,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[313]超级丑数","frequency":53.59160062730145,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5440895788268227,"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.41861664792091263,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":55.409905402038326,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4765826791132195,"acs":0,"articleLive":2,"columnArticles":513,"formTitle":"[316]去除重复字母","frequency":56.571385362260884,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4866738376957093,"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.6833918004323022,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[318]最大单词长度乘积","frequency":6.717188864301861,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5172524917708261,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[319]灯泡开关","frequency":16.7954628814756,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.674081011472723,"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.42569335001381015,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[321]拼接最大数","frequency":31.154717435598055,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4434573960628954,"acs":0,"articleLive":2,"columnArticles":1768,"formTitle":"[322]零钱兑换","frequency":80.23886905191195,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6334184785994642,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[323]无向图中连通分量的数目","frequency":33.44858233523286,"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.37815667213542065,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":39.112788599468395,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5389324774132193,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":32.808377617599525,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48944753207578356,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[326]3的幂","frequency":29.11716714389944,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.423530027750144,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[327]区间和的个数","frequency":40.640882130761085,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6567142342078724,"acs":0,"articleLive":2,"columnArticles":1041,"formTitle":"[328]奇偶链表","frequency":61.26755201022692,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48348814590750505,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[329]矩阵中的最长递增路径","frequency":57.954865421749645,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533989699228865,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":32.808377617599525,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.48017330797821767,"acs":0,"articleLive":2,"columnArticles":496,"formTitle":"[331]验证二叉树的前序序列化","frequency":58.12522309159364,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4492544661696441,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[332]重新安排行程","frequency":50.524625007718235,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4671427093035289,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[333]最大 BST 子树","frequency":18.094047193227674,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4128100182115164,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[334]递增的三元子序列","frequency":16.7954628814756,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36799589690986023,"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.4010136495041534,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[336]回文对","frequency":35.513575061270465,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6085934262890621,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[337]打家劫舍 III","frequency":71.58460158239042,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7871934854214957,"acs":0,"articleLive":2,"columnArticles":1339,"formTitle":"[338]比特位计数","frequency":58.71552876665284,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8094175407275161,"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.4941258986498334,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":30.449805057568714,"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.7270394107241249,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":70.8887326177279,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5156168756575049,"acs":0,"articleLive":2,"columnArticles":756,"formTitle":"[342]4的幂","frequency":48.471179185528726,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6046752681521695,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[343]整数拆分","frequency":66.82774247538966,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7660373170381396,"acs":0,"articleLive":2,"columnArticles":1859,"formTitle":"[344]反转字符串","frequency":64.10387846583967,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5389520854877629,"acs":0,"articleLive":2,"columnArticles":1018,"formTitle":"[345]反转字符串中的元音字母","frequency":28.934571198288612,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7067960009521542,"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.6219522688090147,"acs":0,"articleLive":2,"columnArticles":1439,"formTitle":"[347]前 K 个高频元素","frequency":78.973319206617,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6003335899409803,"acs":0,"articleLive":2,"columnArticles":76,"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.7384943636428292,"acs":0,"articleLive":2,"columnArticles":1454,"formTitle":"[349]两个数组的交集","frequency":65.71143475874568,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5498354359677426,"acs":0,"articleLive":2,"columnArticles":1326,"formTitle":"[350]两个数组的交集 II","frequency":64.72235536850118,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5892757815107353,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":11.551881321512962,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.591963545981773,"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.42449733278621254,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":7.982643366845061,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45171834204739475,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[354]俄罗斯套娃信封问题","frequency":69.56461578061828,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4071202757875673,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[355]设计推特","frequency":34.79947650804195,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35142658315935976,"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.5197792285886093,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[357]计算各个位数不同的数字个数","frequency":44.440004346103564,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3502875192354418,"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.7247403210576016,"acs":0,"articleLive":2,"columnArticles":53,"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.6074517631403858,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5695050946142649,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6937735430977177,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[362]敲击计数器","frequency":5.5605738976163455,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4906427007023639,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":55.409905402038326,"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.7192339038304808,"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.3642835953722931,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[365]水壶问题","frequency":45.91589140570294,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7629684327118331,"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.43962254123288236,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[367]有效的完全平方数","frequency":17.431734517438745,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4590011536350705,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[368]最大整除子集","frequency":69.56461578061828,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6162692847124824,"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.7187951807228916,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":16.7954628814756,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5799095586418759,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[371]两整数之和","frequency":47.89480770437785,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5088556620306499,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":7.3352351801640365,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4237770816447239,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[373]查找和最小的K对数字","frequency":44.84800934009212,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5146984287886467,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[374]猜数字大小","frequency":33.44858233523286,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4684527531843465,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":34.11174318737981,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4625987399661006,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[376]摆动序列","frequency":27.286804992756892,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.50696442771998,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[377]组合总和 Ⅳ","frequency":59.95101147462879,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.638906391928053,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":55.409905402038326,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6446886446886447,"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.502473082606991,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":24.27337559962882,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44247187678749234,"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.6287922625444325,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.27337559962882,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5965767198241594,"acs":0,"articleLive":2,"columnArticles":705,"formTitle":"[383]赎金信","frequency":3.516484022321481,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5768252013153766,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[384]打乱数组","frequency":51.2021012085766,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41512808677590585,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.5605738976163455,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7475120050107871,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[386]字典序排数","frequency":57.41101373667228,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5314952094987728,"acs":0,"articleLive":2,"columnArticles":1153,"formTitle":"[387]字符串中的第一个唯一字符","frequency":63.87889911414967,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5255932357487044,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6921806477004385,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[389]找不同","frequency":23.017386824306058,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4669570543796366,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":34.79947650804195,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35746678335587556,"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.5146892573482521,"acs":0,"articleLive":2,"columnArticles":1541,"formTitle":"[392]判断子序列","frequency":54.785148283296095,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3916129264689988,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":33.44858233523286,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5514933714398902,"acs":0,"articleLive":2,"columnArticles":1261,"formTitle":"[394]字符串解码","frequency":85.24295549328733,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204489291598023,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.09864490080408,"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.42515753756665053,"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.37785784972975717,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[397]整数替换","frequency":23.017386824306058,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.654746302190601,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[398]随机数索引","frequency":37.69846188927235,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5927106470130095,"acs":0,"articleLive":2,"columnArticles":518,"formTitle":"[399]除法求值","frequency":29.771219133044468,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41426089280940925,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":44.11967361024707,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140821924149664,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":46.55349485552583,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.327794158181803,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[402]移掉 K 位数字","frequency":67.4781126523476,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4563139240506329,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[403]青蛙过河","frequency":68.65310156353523,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5822576760987357,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[404]左叶子之和","frequency":54.17941451933008,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5220460981749528,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[405]数字转换为十六进制数","frequency":47.21264610252666,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.736181959267787,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[406]根据身高重建队列","frequency":56.01637072587099,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48375557406772185,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":47.89480770437785,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3259763938201708,"acs":0,"articleLive":2,"columnArticles":79,"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.5558212013832557,"acs":0,"articleLive":2,"columnArticles":1289,"formTitle":"[409]最长回文串","frequency":64.9933255617794,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5625796131172793,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[410]分割数组的最大值","frequency":73.1751495265567,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49743297204791787,"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.673163376166036,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[412]Fizz Buzz","frequency":24.27337559962882,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6870452698024024,"acs":0,"articleLive":2,"columnArticles":892,"formTitle":"[413]等差数列划分","frequency":34.37618070300181,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36452516523554074,"acs":0,"articleLive":2,"columnArticles":825,"formTitle":"[414]第三大的数","frequency":32.808377617599525,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5369646882043576,"acs":0,"articleLive":2,"columnArticles":1048,"formTitle":"[415]字符串相加","frequency":87.54027154250834,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5067319349591515,"acs":0,"articleLive":2,"columnArticles":952,"formTitle":"[416]分割等和子集","frequency":73.79072462836389,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4781407354892658,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[417]太平洋大西洋水流问题","frequency":58.12522309159364,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3594557354460903,"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.756167894905479,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[419]甲板上的战舰","frequency":4.497741382272873,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20642730837241485,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[420]强密码检验器","frequency":20.23036191390926,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223101657185258,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":59.809917236862134,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4271758436944938,"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.5688814598133445,"acs":0,"articleLive":2,"columnArticles":135,"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.5304836942782506,"acs":0,"articleLive":2,"columnArticles":444,"formTitle":"[424]替换后的最长重复字符","frequency":63.67342851566546,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6107216494845361,"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.6686390532544378,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.11716714389944,"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.6129327436327588,"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.6497553438063353,"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.6981875200632146,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[429]N 叉树的层序遍历","frequency":32.808377617599525,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5420582110021842,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[430]扁平化多级双向链表","frequency":30.449805057568714,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.721565059144677,"acs":0,"articleLive":2,"columnArticles":27,"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.37699156513589505,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":20.23036191390926,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5328675218131887,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":5.018255598477773,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3738205338039695,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[434]字符串中的单词数","frequency":24.27337559962882,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5093111220208872,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[435]无重叠区间","frequency":60.06719448195682,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48642861276694255,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":5.018255598477773,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5669108419670218,"acs":0,"articleLive":2,"columnArticles":804,"formTitle":"[437]路径总和 III","frequency":51.4747476279205,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5172153140417184,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[438]找到字符串中所有字母异位词","frequency":47.697465233081225,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5893338866984852,"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.37966710573584,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":69.56461578061828,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4259171520674823,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[441]排列硬币","frequency":16.183442713396072,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6969606377678127,"acs":0,"articleLive":2,"columnArticles":416,"formTitle":"[442]数组中重复的数据","frequency":63.907080619448585,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4770678776953477,"acs":0,"articleLive":2,"columnArticles":686,"formTitle":"[443]压缩字符串","frequency":43.41774720360198,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25013345534965303,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.784393512347606,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5880612102876649,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[445]两数相加 II","frequency":68.84500970248341,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5522258036414321,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":26.591826165111137,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.604290514344792,"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.6477773990944058,"acs":0,"articleLive":2,"columnArticles":1045,"formTitle":"[448]找到所有数组中消失的数字","frequency":59.95101147462879,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.556034159862162,"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.4855478605415107,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.11967361024707,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7114596201013302,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[451]根据字符出现频率排序","frequency":60.94617764811285,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093007215038813,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[452]用最少数量的箭引爆气球","frequency":47.83180085519276,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5545652355845677,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.017386824306058,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6005778572047141,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[454]四数相加 II","frequency":55.409905402038326,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5776751401751402,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[455]分发饼干","frequency":57.6711858649747,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36239813736903376,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[456]132 模式","frequency":73.05206607727231,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43539299898402145,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":52.507913391402326,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6085386182626412,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":17.431734517438745,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5117722659458886,"acs":0,"articleLive":2,"columnArticles":621,"formTitle":"[459]重复的子字符串","frequency":50.88870073928404,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4392343596572643,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[460]LFU 缓存","frequency":62.67634598009314,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.811952124898383,"acs":0,"articleLive":2,"columnArticles":1326,"formTitle":"[461]汉明距离","frequency":58.12522309159364,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6025086123133999,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":37.69846188927235,"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.71462870538415,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[463]岛屿的周长","frequency":37.02908617571276,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3583797770700637,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":37.02908617571276,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5304498269896194,"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.3733606025191534,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[466]统计重复个数","frequency":7.3352351801640365,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44114285714285717,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.431734517438745,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24966940240549107,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[468]验证IP地址","frequency":50.88870073928404,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4352506920947401,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":25.62736124123482,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5465069787728991,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":45.798629822891506,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6153846153846154,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":15.02585801200021,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40368722186904005,"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.42032462655428526,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[473]火柴拼正方形","frequency":40.08097302202694,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6103913483493781,"acs":0,"articleLive":2,"columnArticles":583,"formTitle":"[474]一和零","frequency":63.87889911414967,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3302250219069821,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":29.11716714389944,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7013225014169658,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[476]数字的补数","frequency":5.5605738976163455,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039641162932694,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":47.89480770437785,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43761153054221,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":29.771219133044468,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4142300194931774,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":10.8265203909425,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44835337408200027,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[480]滑动窗口中位数","frequency":41.4533539470012,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5355261850342841,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.5605738976163455,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42608203036483117,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[482]密钥格式化","frequency":15.594060827695694,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5899806576402321,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":33.44858233523286,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6402550091074681,"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.6065906828386258,"acs":0,"articleLive":2,"columnArticles":966,"formTitle":"[485]最大连续 1 的个数","frequency":47.83180085519276,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5870201144218075,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[486]预测赢家","frequency":41.4533539470012,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5754665502564662,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[487]最大连续1的个数 II","frequency":36.38268815024056,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3869364161849711,"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.4816247582205029,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[490]迷宫","frequency":18.094047193227674,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5474401411002924,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[491]递增子序列","frequency":50.22628216013047,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5510393144577616,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[492]构造矩形","frequency":6.126293813912077,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34437330869249555,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":36.25603468707768,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4964578164413909,"acs":0,"articleLive":2,"columnArticles":1006,"formTitle":"[494]目标和","frequency":74.47666380886051,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5424167081054202,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[495]提莫攻击","frequency":29.771219133044468,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.687463197151109,"acs":0,"articleLive":2,"columnArticles":1007,"formTitle":"[496]下一个更大元素 I","frequency":45.91589140570294,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4055207740466705,"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.4631322634200332,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[498]对角线遍历","frequency":52.078712073361345,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3698058950395399,"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.708349173160996,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[500]键盘行","frequency":16.183442713396072,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5117233814313252,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[501]二叉搜索树中的众数","frequency":48.471179185528726,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.6346240646912608,"acs":0,"articleLive":2,"columnArticles":952,"formTitle":"[503]下一个更大元素 II","frequency":52.078712073361345,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5045595290755044,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[504]七进制数","frequency":23.63396138377883,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48388239461565713,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[505]迷宫 II","frequency":18.094047193227674,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5643112455320319,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[506]相对名次","frequency":15.594060827695694,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4104435790955987,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[507]完美数","frequency":16.7954628814756,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6755654606666983,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[508]出现次数最多的子树元素和","frequency":6.126293813912077,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6766849790715372,"acs":0,"articleLive":2,"columnArticles":1410,"formTitle":"[509]斐波那契数","frequency":62.26367544289448,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6091799500672173,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":7.982643366845061,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.733815842380378,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[511]游戏玩法分析 I","frequency":38.392431737912304,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5377373195747732,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[512]游戏玩法分析 II","frequency":5.5605738976163455,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7311715163124449,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[513]找树左下角的值","frequency":5.018255598477773,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5012592496429963,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[514]自由之路","frequency":49.81605168619866,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6435499174192642,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[515]在每个树行中找最大值","frequency":29.771219133044468,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6524394585485874,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[516]最长回文子序列","frequency":35.43710766706429,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4398764258555133,"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.6528121423685035,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[518]零钱兑换 II","frequency":68.51284797492686,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39493248368988015,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":19.505000983338796,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5634795111430625,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[520]检测大写字母","frequency":5.5605738976163455,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7124846687013321,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.183442713396072,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36001745010360997,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.183442713396072,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2743969042233962,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[523]连续的子数组和","frequency":57.954865421749645,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4725602452929622,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":32.65173886821021,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5364368779847618,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[525]连续数组","frequency":68.28271129386266,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7347775175644028,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[526]优美的排列","frequency":35.15311049539493,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5769117212872749,"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.47647543404261933,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[528]按权重随机选择","frequency":24.155349038118242,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464653191701908,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":34.11174318737981,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206270210391704,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":16.7954628814756,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6626898047722343,"acs":0,"articleLive":2,"columnArticles":74,"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.3731151844173664,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.7954628814756,"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.5216528925619834,"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.6755831265508685,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[534]游戏玩法分析 III","frequency":16.183442713396072,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8414594418503638,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[535]TinyURL 的加密与解密","frequency":29.11716714389944,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5346174813737962,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7122913693615437,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":4.497741382272873,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6972324042087498,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":35.934227637035384,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5954844366505918,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[539]最小时间差","frequency":33.44858233523286,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5802307206068268,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[540]有序数组中的单一元素","frequency":43.804556856982224,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6083401471790678,"acs":0,"articleLive":2,"columnArticles":779,"formTitle":"[541]反转字符串 II","frequency":28.331655939689593,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45898051100728204,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[542]01 矩阵","frequency":45.77699202581343,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5499716375120732,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[543]二叉树的直径","frequency":71.77328601872371,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7080037962670042,"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.4167604752970607,"acs":0,"articleLive":2,"columnArticles":77,"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.6308076743890559,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":24.937244926792673,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6182687577480863,"acs":0,"articleLive":2,"columnArticles":1100,"formTitle":"[547]省份数量","frequency":50.621056500657055,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35647621215570224,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":10.8265203909425,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4823952095808383,"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.43954673805420075,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":29.771219133044468,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5671920162487306,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[551]学生出勤记录 I","frequency":20.424146076392923,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5788099826791246,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.693957820014365,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6026274303730951,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":5.5605738976163455,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5015896554435869,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[554]砖墙","frequency":59.809917236862134,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3411875589066918,"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.3255239019431159,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":47.97209243774956,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7454719618403433,"acs":0,"articleLive":2,"columnArticles":1238,"formTitle":"[557]反转字符串中的单词 III","frequency":59.447648777519454,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5033450704225352,"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.7275478448381485,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[559]N 叉树的最大深度","frequency":32.189666716451356,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465887950606088,"acs":0,"articleLive":2,"columnArticles":884,"formTitle":"[560]和为 K 的子数组","frequency":81.22347269184601,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7740256554044581,"acs":0,"articleLive":2,"columnArticles":732,"formTitle":"[561]数组拆分 I","frequency":15.594060827695694,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.462152388078314,"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.605094809423482,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[563]二叉树的坡度","frequency":5.5605738976163455,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17927228975646184,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[564]寻找最近的回文数","frequency":24.937244926792673,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6123771322783973,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[565]数组嵌套","frequency":16.183442713396072,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6948430038140618,"acs":0,"articleLive":2,"columnArticles":610,"formTitle":"[566]重塑矩阵","frequency":29.11716714389944,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.430647720297861,"acs":0,"articleLive":2,"columnArticles":1007,"formTitle":"[567]字符串的排列","frequency":55.409905402038326,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5035492457852706,"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.5636739407938727,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":24.27337559962882,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6628955566486309,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":16.183442713396072,"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.48865183840217885,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":6.126293813912077,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47416298911444543,"acs":0,"articleLive":2,"columnArticles":708,"formTitle":"[572]另一棵树的子树","frequency":48.96477832790934,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6591511936339522,"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.6479732282614562,"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.684584466051802,"acs":0,"articleLive":2,"columnArticles":415,"formTitle":"[575]分糖果","frequency":29.11716714389944,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4697994056463596,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":25.36536994206181,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7057710501419111,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[577]员工奖金","frequency":16.7954628814756,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49779829168656164,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[578]查询回答率最高的问题","frequency":5.5605738976163455,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41345392877331827,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":26.34571948574115,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5247261865250581,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[580]统计各专业学生人数","frequency":16.183442713396072,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40425058651211004,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[581]最短无序连续子数组","frequency":58.645171140667976,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4046418719680396,"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.5856828468214093,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[583]两个字符串的删除操作","frequency":44.440004346103564,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7742799333492025,"acs":0,"articleLive":2,"columnArticles":57,"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.5948217636022514,"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.748974344948307,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[586]订单最多的客户","frequency":24.27337559962882,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3825065274151436,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":10.8265203909425,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4284829721362229,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.661896872488112,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452985699367389,"acs":0,"articleLive":2,"columnArticles":555,"formTitle":"[589]N 叉树的前序遍历","frequency":41.4533539470012,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7599900534626384,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[590]N 叉树的后序遍历","frequency":16.183442713396072,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3399921660791226,"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.5209487117746208,"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.44064906490649064,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[593]有效的正方形","frequency":24.27337559962882,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5168298709618376,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[594]最长和谐子序列","frequency":5.018255598477773,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7962770720574367,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[595]大的国家","frequency":38.800710146713705,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42052969519556416,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[596]超过5名学生的课","frequency":23.017386824306058,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4413802472490151,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.183442713396072,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5177265053460889,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[598]范围求和 II","frequency":16.183442713396072,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220666380773031,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[599]两个列表的最小索引总和","frequency":16.183442713396072,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3425877422734416,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[600]不含连续1的非负整数","frequency":17.431734517438745,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4981656312674265,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[601]体育馆的人流量","frequency":53.344912676000725,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.627733639118683,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.431734517438745,"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.6720722742831491,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[603]连续空余座位","frequency":25.62736124123482,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37246769819747966,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":6.126293813912077,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33480567597540073,"acs":0,"articleLive":2,"columnArticles":1236,"formTitle":"[605]种花问题","frequency":53.344912676000725,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.568580134563079,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[606]根据二叉树创建字符串","frequency":5.018255598477773,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6636825690192908,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.5605738976163455,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6577894928194874,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[608]树节点","frequency":5.5605738976163455,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48406283361293273,"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.6662633595482961,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.5605738976163455,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318933733563901,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[611]有效三角形的个数","frequency":77.89549726765092,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6683229813664596,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[612]平面上的最近距离","frequency":5.5605738976163455,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8164705882352942,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.018255598477773,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34662949138822685,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[614]二级关注者","frequency":16.7954628814756,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42387178405735976,"acs":0,"articleLive":2,"columnArticles":86,"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.45888475836431225,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":34.11174318737981,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881446889415558,"acs":0,"articleLive":2,"columnArticles":1185,"formTitle":"[617]合并二叉树","frequency":63.995402294546054,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.620475113122172,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":17.431734517438745,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4663239296669115,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.5605738976163455,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7729125451940787,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[620]有趣的电影","frequency":36.38268815024056,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5693735742586145,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[621]任务调度器","frequency":62.67634598009314,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4364121396895787,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[622]设计循环队列","frequency":48.60159623618965,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5453249134243227,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[623]在二叉树中增加一行","frequency":6.126293813912077,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41614296936370776,"acs":0,"articleLive":2,"columnArticles":47,"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.340460983060261,"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.682900635039223,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[626]换座位","frequency":42.08612690382681,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.807306290988584,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[627]变更性别","frequency":27.876354625024913,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5252632001391249,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[628]三个数的最大乘积","frequency":33.44858233523286,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40285511795079476,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":24.937244926792673,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36717428087986465,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":7.3352351801640365,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2848567530695771,"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.59677522965247,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[632]最小区间","frequency":16.7954628814756,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39940524887347906,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[633]平方数之和","frequency":62.956231017328946,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43936904370686825,"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.556251821626348,"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.549232995658466,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":5.5605738976163455,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6892743430119279,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[637]二叉树的层平均值","frequency":22.422190473341242,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5930781888635278,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":5.5605738976163455,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3094631073785243,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[639]解码方法 II","frequency":29.771219133044468,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4242083717943573,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[640]求解方程","frequency":23.017386824306058,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5327212745825128,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[641]设计循环双端队列","frequency":22.422190473341242,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4906502337441564,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":8.661896872488112,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4516534540513439,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[643]子数组最大平均数 I","frequency":37.69846188927235,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.39811798769453494,"acs":0,"articleLive":2,"columnArticles":23,"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.4352507517702978,"acs":0,"articleLive":2,"columnArticles":688,"formTitle":"[645]错误的集合","frequency":40.08097302202694,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5753395301492058,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[646]最长数对链","frequency":3.997587297058907,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6562159832464899,"acs":0,"articleLive":2,"columnArticles":888,"formTitle":"[647]回文子串","frequency":58.934573086294726,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5829130065174271,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[648]单词替换","frequency":5.018255598477773,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.481659651232712,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":5.018255598477773,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5353728883395138,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[650]只有两个键的键盘","frequency":16.7954628814756,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5807275047862157,"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.5710655692426669,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[652]寻找重复的子树","frequency":54.00968496755861,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.595864633012845,"acs":0,"articleLive":2,"columnArticles":369,"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.8098073854570321,"acs":0,"articleLive":2,"columnArticles":579,"formTitle":"[654]最大二叉树","frequency":45.09699522101154,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5959328599096191,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.7954628814756,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3071401586701927,"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.7833315652937035,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":5.5605738976163455,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45220869256066126,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[658]找到 K 个最接近的元素","frequency":29.771219133044468,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420501121336324,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.648568608094768,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[660]移除 9","frequency":16.183442713396072,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5600194282542326,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[661]图片平滑器","frequency":5.5605738976163455,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4068350936149784,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[662]二叉树最大宽度","frequency":54.100026915826184,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46199945518932173,"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.6553836912449317,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":54.697477009938645,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27024248010546764,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[665]非递减数列","frequency":47.89480770437785,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6182318751911899,"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.6242053401144311,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":15.594060827695694,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5076111068614702,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[668]乘法表中第k小的数","frequency":34.11174318737981,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.666430296293457,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[669]修剪二叉搜索树","frequency":23.017386824306058,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44990823842924305,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[670]最大交换","frequency":61.628833854903405,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4866830103150007,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[671]二叉树中第二小的节点","frequency":47.21264610252666,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5517241379310345,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.018255598477773,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3913566410627887,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[673]最长递增子序列的个数","frequency":53.785611653509946,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49277580880436167,"acs":0,"articleLive":2,"columnArticles":746,"formTitle":"[674]最长连续递增序列","frequency":31.011536219289525,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40031374786081003,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":7.3352351801640365,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5871889239397126,"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.6157304332933722,"acs":0,"articleLive":2,"columnArticles":237,"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.3517533936651584,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[678]有效的括号字符串","frequency":70.98015101810226,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5413535448962941,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[679]24 点游戏","frequency":69.56461578061828,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40179642149016986,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":48.36315695657654,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.4996989765201686,"acs":0,"articleLive":2,"columnArticles":60,"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.6958738201535538,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":29.11716714389944,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4303361684892669,"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.6658578459425432,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[684]冗余连接","frequency":28.48603299997492,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43278731720170394,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":29.771219133044468,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35506700167504185,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[686]重复叠加字符串匹配","frequency":5.018255598477773,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4402925893924509,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[687]最长同值路径","frequency":50.88870073928404,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5113443734515583,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.7954628814756,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4872508113120074,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.25603468707768,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6467961073762399,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[690]员工的重要性","frequency":64.81619429096602,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4895194638528447,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.126293813912077,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5792764313312259,"acs":0,"articleLive":2,"columnArticles":720,"formTitle":"[692]前K个高频单词","frequency":63.45243883822881,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6099231340245683,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":5.5605738976163455,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5299507658643327,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":6.126293813912077,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6631892125867765,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[695]岛屿的最大面积","frequency":66.40548211712105,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6308220196214449,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[696]计数二进制子串","frequency":16.183442713396072,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.605630287061434,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[697]数组的度","frequency":24.27337559962882,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44385322259765686,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[698]划分为k个相等的子集","frequency":56.09864490080408,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4764342453662842,"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.7591984101999055,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[700]二叉搜索树中的搜索","frequency":23.017386824306058,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7242189687587504,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[701]二叉搜索树中的插入操作","frequency":31.011536219289525,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7398242782858168,"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.5127542586695899,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[703]数据流中的第 K 大元素","frequency":32.808377617599525,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5604499391443566,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[704]二分查找","frequency":66.42566605166846,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6463934082815446,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[705]设计哈希集合","frequency":53.194615449151314,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6446036805248586,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[706]设计哈希映射","frequency":45.09699522101154,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31913326343522325,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[707]设计链表","frequency":58.451020101829,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3363445717051137,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[708]循环有序列表的插入","frequency":6.717188864301861,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7594700260642919,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3501745884700349,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[710]黑名单中的随机数","frequency":25.62736124123482,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5746268656716418,"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.6723662695631861,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":34.11174318737981,"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.4074418064665931,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[713]乘积小于K的子数组","frequency":35.15311049539493,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7184753383492622,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":44.11967361024707,"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.4009811937857727,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":7.3352351801640365,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46032135410278424,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[716]最大栈","frequency":18.094047193227674,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5109850472193075,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[717]1比特与2比特字符","frequency":16.7954628814756,"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.5644443192064923,"acs":0,"articleLive":2,"columnArticles":568,"formTitle":"[718]最长重复子数组","frequency":69.56461578061828,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3682100362131402,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[719]找出第 k 小的距离对","frequency":16.183442713396072,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48600173891442056,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[720]词典中最长的单词","frequency":5.5605738976163455,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46929498305645095,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[721]账户合并","frequency":37.02908617571276,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32271312181228057,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[722]删除注释","frequency":38.392431737912304,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7216138328530259,"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.45854682877378333,"acs":0,"articleLive":2,"columnArticles":838,"formTitle":"[724]寻找数组的中心下标","frequency":33.44858233523286,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5628540950574848,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[725]分隔链表","frequency":16.183442713396072,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5543701799485862,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":50.524625007718235,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40858767205266305,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[727]最小窗口子序列","frequency":30.449805057568714,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7595992184304994,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[728]自除数","frequency":5.5605738976163455,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.509204078929943,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[729]我的日程安排表 I","frequency":24.937244926792673,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48880691935894177,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":39.112788599468395,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5103366021733369,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[731]我的日程安排表 II","frequency":5.5605738976163455,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6102079395085066,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":18.094047193227674,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805800153139357,"acs":0,"articleLive":2,"columnArticles":510,"formTitle":"[733]图像渲染","frequency":40.840790807905634,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47871819960861056,"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.41146493709158294,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[735]行星碰撞","frequency":33.44858233523286,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45979443772672307,"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.46157635467980296,"acs":0,"articleLive":2,"columnArticles":64,"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.5020335631781151,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[738]单调递增的数字","frequency":29.771219133044468,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6785033245724477,"acs":0,"articleLive":2,"columnArticles":1464,"formTitle":"[739]每日温度","frequency":84.07047093379515,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.629755087775896,"acs":0,"articleLive":2,"columnArticles":550,"formTitle":"[740]删除并获得点数","frequency":62.3423813730798,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36581894097551715,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":24.27337559962882,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4921952839588177,"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.5181524083393242,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[743]网络延迟时间","frequency":50.88870073928404,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45901166480137534,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":24.937244926792673,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3919863111364609,"acs":0,"articleLive":2,"columnArticles":53,"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.5827067146004871,"acs":0,"articleLive":2,"columnArticles":1226,"formTitle":"[746]使用最小花费爬楼梯","frequency":49.087347621680536,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41523889121047497,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.5605738976163455,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5992777997625643,"acs":0,"articleLive":2,"columnArticles":167,"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.5058548009367682,"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.7214043035107588,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":22.71720223657227,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5069648093841642,"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.5306940517723403,"acs":0,"articleLive":2,"columnArticles":568,"formTitle":"[752]打开转盘锁","frequency":41.4533539470012,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5902198635329795,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":17.431734517438745,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4284065299840598,"acs":0,"articleLive":2,"columnArticles":87,"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.501779359430605,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.571520123045373,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":7.3352351801640365,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41663741663741666,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":10.101159460372038,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4590818363273453,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[758]字符串中的加粗单词","frequency":12.277242252083424,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6578849721706864,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[759]员工空闲时间","frequency":6.717188864301861,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8392199349945829,"acs":0,"articleLive":2,"columnArticles":89,"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.5894402769763416,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":10.8265203909425,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.698488241881299,"acs":0,"articleLive":2,"columnArticles":137,"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.763034700684651,"acs":0,"articleLive":2,"columnArticles":947,"formTitle":"[763]划分字母区间","frequency":64.842338188506,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4911891558841651,"acs":0,"articleLive":2,"columnArticles":52,"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.6656592895666729,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[765]情侣牵手","frequency":56.09864490080408,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7082112773242719,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.477850752066818,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[767]重构字符串","frequency":36.25603468707768,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.4994773154923688,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":24.937244926792673,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5891813595724489,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[769]最多能完成排序的块","frequency":5.5605738976163455,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5536480686695279,"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.851473400067484,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[771]宝石与石头","frequency":42.08612690382681,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.48986657659179195,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[772]基本计算器 III","frequency":18.784393512347606,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7137592904877896,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":50.524625007718235,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5864022662889519,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4608582332681746,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5686338441473753,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3235710911667454,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.7954628814756,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5966429954809555,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[778]水位上升的泳池中游泳","frequency":6.717188864301861,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43576514532508465,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.11174318737981,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2843978102189781,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":19.505000983338796,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.62025800567789,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[781]森林中的兔子","frequency":91.2306436902954,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42270820850808866,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":32.393600002603414,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958167917757399,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[783]二叉搜索树节点最小距离","frequency":33.44858233523286,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6845005361709148,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[784]字母大小写全排列","frequency":28.48603299997492,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5117446819610554,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[785]判断二分图","frequency":42.08612690382681,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4661852361302155,"acs":0,"articleLive":2,"columnArticles":54,"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.39242286534321935,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[787]K 站中转内最便宜的航班","frequency":33.667008820176356,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6073293206078947,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[788]旋转数字","frequency":18.094047193227674,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6924000400173409,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[789]逃脱阻碍者","frequency":21.135107272050224,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44886769964243145,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[790]多米诺和托米诺平铺","frequency":7.3352351801640365,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6950399195322814,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[791]自定义字符串排序","frequency":34.79947650804195,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4511617900172117,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":15.02585801200021,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39476046682445115,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.5605738976163455,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3407956651932126,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.126293813912077,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5349015241144129,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[795]区间子数组个数","frequency":18.784393512347606,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5261172306187559,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[796]旋转字符串","frequency":42.17824861879155,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7950193821214613,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[797]所有可能的路径","frequency":24.69289937261101,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4547081990691013,"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.4071191113273332,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[799]香槟塔","frequency":53.020696403014625,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7057344064386318,"acs":0,"articleLive":2,"columnArticles":35,"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.41760534000834376,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[801]使序列递增的最小交换次数","frequency":4.497741382272873,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.576742261837602,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[802]找到最终的安全状态","frequency":45.77699202581343,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48292314420897775,"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.7700788020516045,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[804]唯一摩尔斯密码词","frequency":23.63396138377883,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2891043924700513,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[805]数组的均值分割","frequency":8.661896872488112,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.658299309441,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[806]写字符串需要的行数","frequency":16.7954628814756,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8444700460829493,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[807]保持城市天际线","frequency":5.018255598477773,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47962382445141066,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":31.88795185911469,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41959531416400425,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[809]情感丰富的文字","frequency":16.7954628814756,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7360681461555705,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":40.08097302202694,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7036884871724641,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[811]子域名访问计数","frequency":16.183442713396072,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6297849397951237,"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.5480729891170936,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":6.126293813912077,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000943099654197,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[814]二叉树剪枝","frequency":5.018255598477773,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4351399563209576,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[815]公交路线","frequency":72.72858392783964,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5100235849056604,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":8.661896872488112,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912594110571568,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":6.126293813912077,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4303612699185014,"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.4208908757084697,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[819]最常见的单词","frequency":24.937244926792673,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5063784616540788,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[820]单词的压缩编码","frequency":39.112788599468395,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6925047300247417,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[821]字符的最短距离","frequency":29.771219133044468,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5022657241254305,"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.4308239295099706,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":19.505000983338796,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6146405228758169,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[824]山羊拉丁文","frequency":5.5605738976163455,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39048672566371684,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[825]适龄的朋友","frequency":5.5605738976163455,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37172880670910374,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":5.018255598477773,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39121281464530894,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[827]最大人工岛","frequency":24.27337559962882,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4913406029506094,"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.3617273125822008,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[829]连续整数求和","frequency":29.771219133044468,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431057182882001,"acs":0,"articleLive":2,"columnArticles":575,"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.4038000780074664,"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.7954962375051476,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[832]翻转图像","frequency":46.55349485552583,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42540010325245226,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":6.126293813912077,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5296547299193969,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":24.937244926792673,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.573095401509952,"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.47791449857325463,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[836]矩形重叠","frequency":18.094047193227674,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39673610681832233,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[837]新21点","frequency":17.431734517438745,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5006554989075018,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":23.017386824306058,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748067441718911,"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.3589878329762723,"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.656864767776308,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[841]钥匙和房间","frequency":17.431734517438745,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4894021596915723,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.740437148292216,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3765102556898005,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":6.717188864301861,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5147666309824058,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[844]比较含退格的字符串","frequency":27.286804992756892,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4205040871934605,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[845]数组中的最长山脉","frequency":37.69846188927235,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5109365558912387,"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.6842105263157895,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":56.09864490080408,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44649503722084366,"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.42594749817137595,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[849]到最近的人的最大距离","frequency":5.5605738976163455,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.447877179681577,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":16.183442713396072,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47769301895515487,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":5.5605738976163455,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7151175366193405,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.525517953736085,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38223878279770224,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[853]车队","frequency":35.513575061270465,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36074292950612075,"acs":0,"articleLive":2,"columnArticles":64,"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.4093197839421404,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[855]考场就座","frequency":16.7954628814756,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6257502647993409,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[856]括号的分数","frequency":43.41774720360198,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46416111639708213,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.876354625024913,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5548451548451548,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[858]镜面反射","frequency":31.154717435598055,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3016021788750565,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":5.5605738976163455,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5870706090799463,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[860]柠檬水找零","frequency":32.808377617599525,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8091415253139972,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[861]翻转矩阵后的得分","frequency":5.5605738976163455,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18935254581499927,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[862]和至少为 K 的最短子数组","frequency":52.28420305414575,"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.6036652798988889,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":55.409905402038326,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45340362846953014,"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.6551905190519052,"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.22397179074079704,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.784393512347606,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6706583441671176,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[867]转置矩阵","frequency":43.41774720360198,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6247612365025533,"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.5514255728528948,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[869]重新排序得到 2 的幂","frequency":6.126293813912077,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4262359128474831,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[870]优势洗牌","frequency":5.5605738976163455,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3401115979477961,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":39.86152842853764,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520933679140423,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[872]叶子相似的树","frequency":53.47609781396088,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5089605734767025,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":39.112788599468395,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4144249994846742,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[874]模拟行走机器人","frequency":37.69846188927235,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47827751627215603,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.91589140570294,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7059831034586678,"acs":0,"articleLive":2,"columnArticles":1568,"formTitle":"[876]链表的中间结点","frequency":43.35518184071448,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567173861088666,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[877]石子游戏","frequency":60.59850061062865,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2799895914650013,"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.5555817548272158,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":63.41949819823921,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25219928764536753,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[880]索引处的解码字符串","frequency":7.3352351801640365,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5381071290401997,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[881]救生艇","frequency":42.15279161961221,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48477819657871846,"acs":0,"articleLive":2,"columnArticles":28,"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.686917701863354,"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.661104738067925,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[884]两句话中的不常见单词","frequency":6.126293813912077,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6892350400987045,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[885]螺旋矩阵 III","frequency":34.79947650804195,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4227499871207048,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[886]可能的二分法","frequency":5.018255598477773,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2917934545454545,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[887]鸡蛋掉落","frequency":63.45243883822881,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6396667658434989,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[888]公平的糖果棒交换","frequency":5.018255598477773,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.677638213991015,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":42.740437148292216,"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.7259663865546219,"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.32942847000354986,"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.6387251396432092,"acs":0,"articleLive":2,"columnArticles":679,"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.7239530306115523,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[893]特殊等价字符串组","frequency":7.3352351801640365,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7744760524249562,"acs":0,"articleLive":2,"columnArticles":119,"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.5429934995474368,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[895]最大频率栈","frequency":24.937244926792673,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5868908840055188,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[896]单调数列","frequency":16.7954628814756,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.745146427746508,"acs":0,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":56.72144306952094,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3352040816326531,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":24.937244926792673,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5376074025115665,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[899]有序队列","frequency":6.717188864301861,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49278663629460895,"acs":0,"articleLive":2,"columnArticles":40,"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.5423662748860638,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32692891091111337,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.717188864301861,"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.5317621064260726,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":12.277242252083424,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4532437818289173,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[904]水果成篮","frequency":34.11174318737981,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7013666584585078,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[905]按奇偶排序数组","frequency":29.11716714389944,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2736814824413632,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[906]超级回文数","frequency":37.83523365183195,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3162116439155291,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[907]子数组的最小值之和","frequency":38.392431737912304,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986159884321421,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[908]最小差值 I","frequency":5.5605738976163455,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4601374570446735,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":39.86152842853764,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3176813311608157,"acs":0,"articleLive":2,"columnArticles":65,"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.4249727263711197,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.564487768191472,"acs":0,"articleLive":2,"columnArticles":1005,"formTitle":"[912]排序数组","frequency":85.28334580382362,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4046997389033943,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.375798529801575,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38874389560483547,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[914]卡牌分组","frequency":16.183442713396072,"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.46762922618435926,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[915]分割数组","frequency":16.7954628814756,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44057175045768204,"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.5697035788638842,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[917]仅仅反转字母","frequency":24.27337559962882,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35777060626357343,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[918]环形子数组的最大和","frequency":31.154717435598055,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6277668470241023,"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.48056443024494144,"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.7356969894105316,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[921]使括号有效的最少添加","frequency":6.717188864301861,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7141974863046111,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[922]按奇偶排序数组 II","frequency":24.937244926792673,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3376889430264105,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.431734517438745,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35921294375629703,"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.38803854212916444,"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.5180654106516598,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.431734517438745,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33856614338566143,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":37.83523365183195,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4216163583252191,"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.6431200163565733,"acs":0,"articleLive":2,"columnArticles":225,"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.5450434953555807,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[930]和相同的二元子数组","frequency":53.90595227255533,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6599964707958356,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[931]下降路径最小和","frequency":23.017386824306058,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6276736408182313,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[932]漂亮数组","frequency":5.5605738976163455,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7243760399334442,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[933]最近的请求次数","frequency":34.11174318737981,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4753530166880616,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[934]最短的桥","frequency":40.754859727265256,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47427794223537884,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37797246558197745,"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.588638788679437,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.7954628814756,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8184521266597173,"acs":0,"articleLive":2,"columnArticles":785,"formTitle":"[938]二叉搜索树的范围和","frequency":47.21264610252666,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4505149240705184,"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.41907009264114664,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[940]不同的子序列 II","frequency":4.497741382272873,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3922605594575733,"acs":0,"articleLive":2,"columnArticles":607,"formTitle":"[941]有效的山脉数组","frequency":5.018255598477773,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7295587120587944,"acs":0,"articleLive":2,"columnArticles":206,"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.4746701846965699,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":10.8265203909425,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6901533894111825,"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.48649807708269927,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":24.27337559962882,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.622466856060606,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[946]验证栈序列","frequency":49.81605168619866,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127557217366453,"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.39149861837850547,"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.36914613076293534,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[949]给定数字能组成的最大时间","frequency":37.69846188927235,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7745875121319962,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.431734517438745,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6630737781081584,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":24.937244926792673,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3494432598910211,"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.552411335764004,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[953]验证外星语词典","frequency":23.63396138377883,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2995778754514992,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":29.771219133044468,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3280922431865828,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":8.661896872488112,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4358123063302346,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":24.937244926792673,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35994903928655003,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[957]N 天后的牢房","frequency":24.937244926792673,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5371330275229358,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":27.286804992756892,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437814741339844,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.62736124123482,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5529108115858905,"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.6770365076081027,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[961]重复 N 次的元素","frequency":16.7954628814756,"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.44138048863830515,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[962]最大宽度坡","frequency":17.431734517438745,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.500505152556072,"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.42558983666061706,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":13.947811659203424,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840417852138095,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[965]单值二叉树","frequency":6.126293813912077,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4028506118058357,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":7.982643366845061,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46089696071163827,"acs":0,"articleLive":2,"columnArticles":144,"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.49731132950120527,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[968]监控二叉树","frequency":38.800710146713705,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6526964560862866,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[969]煎饼排序","frequency":5.018255598477773,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41452097516449243,"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.44189754833565875,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":6.717188864301861,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40919465275513534,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":13.947811659203424,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.639088017586009,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[973]最接近原点的 K 个点","frequency":5.018255598477773,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4657748592389283,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[974]和可被 K 整除的子数组","frequency":55.409905402038326,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44574736529612585,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":6.717188864301861,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.597200586973699,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[976]三角形的最大周长","frequency":24.27337559962882,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7156748708881961,"acs":0,"articleLive":2,"columnArticles":1215,"formTitle":"[977]有序数组的平方","frequency":48.60159623618965,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733747467029864,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[978]最长湍流子数组","frequency":5.5605738976163455,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122637438508673,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[979]在二叉树中分配硬币","frequency":25.62736124123482,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7330381148189151,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[980]不同路径 III","frequency":30.449805057568714,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5334436664544876,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[981]基于时间的键值存储","frequency":53.785611653509946,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5432533568126788,"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.633688563702879,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[983]最低票价","frequency":45.77699202581343,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4168672424371136,"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.5993442867255319,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[985]查询后的偶数和","frequency":5.5605738976163455,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6767497379760102,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[986]区间列表的交集","frequency":43.804556856982224,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5324696698956081,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[987]二叉树的垂序遍历","frequency":51.574135507026064,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49730750013878866,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[988]从叶结点开始的最小字符串","frequency":5.018255598477773,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4724445713548815,"acs":0,"articleLive":2,"columnArticles":583,"formTitle":"[989]数组形式的整数加法","frequency":17.431734517438745,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5013511438661139,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[990]等式方程的可满足性","frequency":5.5605738976163455,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5169527506520288,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[991]坏了的计算器","frequency":16.7954628814756,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45155659004946175,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":18.094047193227674,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5572596228594274,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[993]二叉树的堂兄弟节点","frequency":49.81605168619866,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5091178018007286,"acs":0,"articleLive":2,"columnArticles":1355,"formTitle":"[994]腐烂的橘子","frequency":32.808377617599525,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402900170150088,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":25.62736124123482,"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.49545078577336643,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":18.094047193227674,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5117173630015387,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[997]找到小镇的法官","frequency":16.183442713396072,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6145739727146475,"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.6909132524605173,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.5605738976163455,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4073898626243487,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":34.79947650804195,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29199772985244044,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":10.101159460372038,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377365472037213,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[1002]查找常用字符","frequency":41.4533539470012,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5763888888888888,"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.5981645633704287,"acs":0,"articleLive":2,"columnArticles":686,"formTitle":"[1004]最大连续1的个数 III","frequency":48.471179185528726,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5351467875636153,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.290745689406364,"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.6278125890059812,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[1006]笨阶乘","frequency":50.524625007718235,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46467146714671465,"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.7263498731075523,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.08097302202694,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5929217521823281,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.5605738976163455,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45043344345363767,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":6.126293813912077,"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.6273215901229312,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":71.52034788352756,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3295505117935024,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":19.505000983338796,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39796277385416756,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":32.808377617599525,"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.5475679051841019,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[1014]最佳观光组合","frequency":15.594060827695694,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3541821977038915,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":17.431734517438745,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5835716737215422,"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.562358276643991,"acs":0,"articleLive":2,"columnArticles":53,"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.5167378622395248,"acs":0,"articleLive":2,"columnArticles":373,"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.5973755026758988,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.5605738976163455,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5369713013657421,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1020]飞地的数量","frequency":24.27337559962882,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.783478763522255,"acs":0,"articleLive":2,"columnArticles":647,"formTitle":"[1021]删除最外层的括号","frequency":24.937244926792673,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7027560494188172,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.5605738976163455,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.565382707885601,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.717188864301861,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5586260946604423,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[1024]视频拼接","frequency":16.183442713396072,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7098277376723579,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[1025]除数博弈","frequency":38.800710146713705,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6690121412803532,"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.4330660712473358,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1027]最长等差数列","frequency":35.513575061270465,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318943793141229,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[1028]从先序遍历还原二叉树","frequency":23.63396138377883,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6542782026768642,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1029]两地调度","frequency":6.126293813912077,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114415545378998,"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.5671318575553417,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.126293813912077,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3952664627274191,"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.3901017875768802,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.126293813912077,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43235117257967526,"acs":0,"articleLive":2,"columnArticles":92,"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.6301223663630509,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[1035]不相交的线","frequency":59.11895682166468,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2992028847978744,"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.43752929046771016,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7931023347434366,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":3.997587297058907,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5543175487465181,"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.5219591175875329,"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.48218457943925236,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":24.27337559962882,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5285232508431102,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1042]不邻接植花","frequency":16.183442713396072,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6910719231834549,"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.20916641033528144,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":54.697477009938645,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6436836645120102,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1045]买下所有产品的客户","frequency":5.5605738976163455,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6594196260445612,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[1046]最后一块石头的重量","frequency":27.876354625024913,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7256465195076984,"acs":0,"articleLive":2,"columnArticles":957,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":58.71552876665284,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4516928567887771,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":39.112788599468395,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6436868686868686,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1049]最后一块石头的重量 II","frequency":59.36011642423902,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7572986282096377,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.5605738976163455,"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.752743341107156,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1051]高度检查器","frequency":6.126293813912077,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811337455895551,"acs":0,"articleLive":2,"columnArticles":741,"formTitle":"[1052]爱生气的书店老板","frequency":26.34571948574115,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45846394984326017,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":17.431734517438745,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37607498309015364,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.7954628814756,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5838979673176564,"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.40768370011189853,"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.46425778194900674,"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.33856619570905283,"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.3593152733920558,"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.5279187817258884,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":16.7954628814756,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6000899685110211,"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.537109375,"acs":0,"articleLive":2,"columnArticles":42,"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.6990521327014217,"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.6507541165075411,"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.5386715195632393,"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.47378455672068637,"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.42063492063492064,"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.863704922528452,"acs":0,"articleLive":2,"columnArticles":58,"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.8197226502311248,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.5605738976163455,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48418792295679336,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1070]产品销售分析 III","frequency":5.5605738976163455,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5864666791943557,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1071]字符串的最大公因子","frequency":17.431734517438745,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5791360458863596,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":8.661896872488112,"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.3361738389433319,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":10.101159460372038,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6700823421774932,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":46.48161132199868,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6950779390309453,"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.4960224375318715,"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.7219315895372234,"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.6218733080671359,"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.7348734134712243,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1079]活字印刷","frequency":5.5605738976163455,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4899952358265841,"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.5710994341147938,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1081]不同字符的最小子序列","frequency":41.4533539470012,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.760086105131588,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":5.5605738976163455,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5281302876480541,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.431734517438745,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5379812695109261,"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.7721354166666666,"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.6886949293433084,"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.531985515992758,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44542642509942554,"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.5852860525987785,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[1089]复写零","frequency":5.018255598477773,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5424808836023789,"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.37860647120663476,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":40.08097302202694,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4873965749470849,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":19.505000983338796,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3825910931174089,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1093]大样本统计","frequency":7.982643366845061,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6131961259079903,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[1094]拼车","frequency":22.422190473341242,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37300789107225746,"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.5540494747543205,"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.5171269727403156,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1097]游戏玩法分析 V","frequency":35.513575061270465,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4723693143245078,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1098]小众书籍","frequency":16.7954628814756,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5793257312840853,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":6.126293813912077,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.701866894684338,"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.6684923609109253,"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.3680330286051312,"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.6366452314101984,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[1103]分糖果 II","frequency":16.183442713396072,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609570302022424,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1104]二叉树寻路","frequency":44.440004346103564,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5564232292124945,"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.5738802846379238,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1106]解析布尔表达式","frequency":18.784393512347606,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4103653355989805,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1107]每日新用户统计","frequency":5.5605738976163455,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8391477524182841,"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.5750113999088007,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[1109]航班预订统计","frequency":27.09454954407483,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6281073528555626,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1110]删点成林","frequency":24.937244926792673,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7718959299330242,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.937244926792673,"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.6434728516839954,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":17.431734517438745,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5403412856196156,"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.6528098202237409,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[1114]按序打印","frequency":78.13068798544502,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5618106153452479,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1115]交替打印FooBar","frequency":50.22628216013047,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5165490790283631,"acs":0,"articleLive":2,"columnArticles":356,"formTitle":"[1116]打印零与奇偶数","frequency":59.809917236862134,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5205998323449967,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[1117]H2O 生成","frequency":44.440004346103564,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6405633802816901,"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.866449168596085,"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.6070834323746137,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1120]子树的最大平均值","frequency":7.982643366845061,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5736475629351901,"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.7071126464270688,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[1122]数组的相对排序","frequency":52.28420305414575,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7045924328210659,"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.31643115849614856,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1124]表现良好的最长时间段","frequency":7.3352351801640365,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4894954507857734,"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.6927360774818402,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1126]查询活跃业务","frequency":16.7954628814756,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4140876317249029,"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.5446458965440687,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":15.594060827695694,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3792178631572382,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1129]颜色交替的最短路径","frequency":7.3352351801640365,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6280494475440324,"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.4535130224106602,"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.3886922668554238,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1132]报告的记录 II","frequency":16.7954628814756,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6440869959220662,"acs":0,"articleLive":2,"columnArticles":60,"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.7745,"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.5337423312883436,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":24.937244926792673,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5667248146532926,"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.6072818928087425,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[1137]第 N 个泰波那契数","frequency":31.67544100994623,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.431765890135174,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":6.126293813912077,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4767131880194449,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.094047193227674,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6533769711395419,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.126293813912077,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5112006446414182,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":16.7954628814756,"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.37148481439820025,"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.6336308356218124,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[1143]最长公共子序列","frequency":81.5286546389477,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4417926048517051,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.937244926792673,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4692624431120422,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":20.23036191390926,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28614970229656933,"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.561908856405847,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1147]段式回文","frequency":36.25603468707768,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7186051004636785,"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.44213753832676306,"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.6065310492505354,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":17.431734517438745,"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.4823947981842719,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":17.431734517438745,"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.38422769048324934,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1152]用户网站访问行为分析","frequency":15.02585801200021,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37088156723063226,"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.5666748526522594,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1154]一年中的第几天","frequency":5.018255598477773,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.48046713517982637,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1155]掷骰子的N种方法","frequency":6.126293813912077,"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.43357084874176965,"acs":0,"articleLive":2,"columnArticles":75,"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.31664338669818415,"acs":0,"articleLive":2,"columnArticles":43,"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.5495876506661028,"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.4866120218579235,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1159]市场分析 II","frequency":18.094047193227674,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6874019251938075,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[1160]拼写单词","frequency":23.63396138377883,"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.6329410314868446,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1161]最大层内元素和","frequency":6.126293813912077,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46921319131401173,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[1162]地图分析","frequency":25.62736124123482,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2671286671286671,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1163]按字典序排在最后的子串","frequency":8.661896872488112,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6109156927266538,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1164]指定日期的产品价格","frequency":17.431734517438745,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8387567324955116,"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.4880884314846579,"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.4237875288683603,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":10.8265203909425,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5708441799925623,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":11.551881321512962,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32215914652050504,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":18.094047193227674,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6171037628278221,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.717188864301861,"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.4724937272965584,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":16.7954628814756,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26978980322003576,"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.7559248697020357,"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.6175133689839573,"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.4886197536020046,"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.4467408585055644,"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.26305888529180155,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1177]构建回文串检测","frequency":6.126293813912077,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46210305572198923,"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.6342770693754052,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1179]重新格式化部门表","frequency":51.84422950385802,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7741689926414616,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1180]统计只含单一字母的子串","frequency":9.375798529801575,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3700887198986058,"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.3866201518571722,"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.6020892687559354,"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.5856657426450863,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":5.018255598477773,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6101101101101101,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1185]一周中的第几天","frequency":16.183442713396072,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3922610015174507,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":30.449805057568714,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4388454011741683,"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.6925787271526096,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":22.71720223657227,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6444747094036043,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[1189]“气球” 的最大数量","frequency":5.5605738976163455,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.651013442711296,"acs":0,"articleLive":2,"columnArticles":604,"formTitle":"[1190]反转每对括号间的子串","frequency":94.01423436892406,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2675228856401148,"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.4995673136358017,"acs":0,"articleLive":2,"columnArticles":43,"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.6073852525020131,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":6.126293813912077,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5124218869074836,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.717188864301861,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6355604374611968,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1195]交替打印字符串","frequency":24.937244926792673,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6903199343724364,"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.3679085861430756,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.784393512347606,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7475267115156312,"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.4335961188599151,"acs":0,"articleLive":2,"columnArticles":16,"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.68650183366852,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[1200]最小绝对差","frequency":23.63396138377883,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24702218106822676,"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.5032253182755424,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":6.717188864301861,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6232312237599129,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":8.661896872488112,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7272357171936491,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":6.717188864301861,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4619312906220984,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1205]每月交易II","frequency":25.62736124123482,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.618346327846761,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":18.094047193227674,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304331751802329,"acs":0,"articleLive":2,"columnArticles":820,"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.49647891109653697,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[1208]尽可能使字符串相等","frequency":16.7954628814756,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5323600309273662,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":34.11174318737981,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4499394777796991,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":13.222450728632962,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6550522648083623,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1211]查询结果的质量和占比","frequency":16.7954628814756,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5132365499573015,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.5605738976163455,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7725321888412017,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":18.784393512347606,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6331911593640946,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":18.094047193227674,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4099244875943905,"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.532068311195446,"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.6954795456764409,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":34.11174318737981,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42100884035361413,"acs":0,"articleLive":2,"columnArticles":107,"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.6307270380727038,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.11174318737981,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5264697687378099,"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.8425934450377462,"acs":0,"articleLive":2,"columnArticles":1079,"formTitle":"[1221]分割平衡字符串","frequency":0.7253609305704625,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6716382853787434,"acs":0,"articleLive":2,"columnArticles":126,"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.4722541690626797,"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.32563233008336867,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1224]最大相等频率","frequency":28.693957820014365,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5439236111111111,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1225]报告系统状态的连续日期","frequency":19.505000983338796,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6001680407498818,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1226]哲学家进餐","frequency":48.60159623618965,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625397469724646,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1227]飞机座位分配概率","frequency":4.497741382272873,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5396428571428571,"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.41422669301239445,"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.4897746967071057,"acs":0,"articleLive":2,"columnArticles":55,"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.5581441263573544,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":18.784393512347606,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46920952661311804,"acs":0,"articleLive":2,"columnArticles":415,"formTitle":"[1232]缀点成线","frequency":4.497741382272873,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4830212234706617,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.717188864301861,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.341766138131718,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1234]替换子串得到平衡字符串","frequency":5.5605738976163455,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45327984898537044,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1235]规划兼职工作","frequency":39.112788599468395,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5608308605341247,"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.7105839158370402,"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.6574923547400612,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":5.5605738976163455,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49070063330045316,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[1239]串联字符串的最大长度","frequency":41.4533539470012,"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.4949071300179748,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":26.34571948574115,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5950445597884634,"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.46944336317633323,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":16.183442713396072,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393900889453621,"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.6198193411264612,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.375798529801575,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5081822202565237,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.126293813912077,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4797274842140246,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":10.8265203909425,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6173848987108655,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1247]交换字符使得字符串相同","frequency":24.27337559962882,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5589175891758917,"acs":0,"articleLive":2,"columnArticles":466,"formTitle":"[1248]统计「优美子数组」","frequency":23.63396138377883,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5724924989284184,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1249]移除无效的括号","frequency":37.02908617571276,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5619535082107059,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":19.505000983338796,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7715776796467282,"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.7498419655274137,"acs":0,"articleLive":2,"columnArticles":307,"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.39361702127659576,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":19.505000983338796,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5982938792919599,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1254]统计封闭岛屿的数目","frequency":5.018255598477773,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6779701209390562,"acs":0,"articleLive":2,"columnArticles":62,"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.6638655462184874,"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.5643533123028391,"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.55746859004188,"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.47581441263573543,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":13.947811659203424,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6038046734571599,"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.7280894580904138,"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.525844389570167,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1262]可被三整除的最大和","frequency":40.754859727265256,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41612993559227107,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":7.982643366845061,"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.5702316412025629,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1264]页面推荐","frequency":6.717188864301861,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9199576868829337,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":7.982643366845061,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8239189715621348,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1266]访问所有点的最小时间","frequency":17.431734517438745,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6082851253407806,"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.5821439416945035,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1268]搜索推荐系统","frequency":6.126293813912077,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4916830065359477,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.21264610252666,"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.8051238975220496,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":5.5605738976163455,"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.5058848255569567,"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.5187645300564596,"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.5440396179695791,"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.5984848484848485,"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.5396911406123002,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.7954628814756,"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.5014892616397555,"acs":0,"articleLive":2,"columnArticles":95,"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.7242950278846909,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":22.422190473341242,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5971482563133482,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":58.12522309159364,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6233183856502242,"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.5047091412742383,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.183442713396072,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8317351386441622,"acs":0,"articleLive":2,"columnArticles":607,"formTitle":"[1281]整数的各位积和之差","frequency":5.5605738976163455,"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.8115932203389831,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[1282]用户分组","frequency":6.717188864301861,"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.4159707406278574,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.431734517438745,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6599317764366308,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":17.431734517438745,"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.8136186770428016,"acs":0,"articleLive":2,"columnArticles":56,"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.6454166666666666,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":5.5605738976163455,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6039303403099536,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.183442713396072,"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.5631970260223048,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":34.11174318737981,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6273055126223596,"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.8089664718548139,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1290]二进制链表转整数","frequency":3.997587297058907,"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.5188822902390742,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46810226631179935,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":5.018255598477773,"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.3556531595352791,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":56.054894486634424,"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.6598693328053851,"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.8093441027304862,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.5605738976163455,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4532490974729242,"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.4585683297180043,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":26.34571948574115,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5959944751381215,"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.7854072753957438,"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.46722304745524196,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":3.997587297058907,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3601410934744268,"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.8166924000686224,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.27337559962882,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8223429014740109,"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.7249497260938909,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.018255598477773,"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.7466333401346664,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.5605738976163455,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5759270057970021,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1306]跳跃游戏 III","frequency":29.771219133044468,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33235185866764816,"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.750886524822695,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1308]不同性别每日分数总计","frequency":6.126293813912077,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.755349698934692,"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.7127030162412993,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":52.507913391402326,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3773978315262719,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.717188864301861,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6667329488964009,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":32.808377617599525,"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.8314258979342115,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1313]解压缩编码列表","frequency":4.497741382272873,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7349488570055606,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1314]矩阵区域和","frequency":34.79947650804195,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8098763842389904,"acs":0,"articleLive":2,"columnArticles":256,"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.43891402714932126,"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.6142522788864252,"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.6516577540106951,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1318]或运算的最小翻转次数","frequency":64.81619429096602,"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.6175686944495291,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[1319]连通网络的操作次数","frequency":6.126293813912077,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5885505481120584,"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.616962062399297,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5926055926055926,"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.7554399543234156,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.27337559962882,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5926646859952873,"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.7282473015639915,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.018255598477773,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47498931167165453,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":6.717188864301861,"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.6918114797261716,"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.4585163299528867,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":16.183442713396072,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7708144796380091,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.717188864301861,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37842296271857473,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":13.222450728632962,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.535399673735726,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[1331]数组序号转换","frequency":16.7954628814756,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6846211552888222,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.5605738976163455,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5427579365079365,"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.4898032521786003,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":49.132108606911764,"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.5848268661910562,"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.4236111111111111,"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.7062303636062983,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":38.392431737912304,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6403744285610623,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":5.018255598477773,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.397187530730652,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":6.126293813912077,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5724267669981188,"acs":0,"articleLive":2,"columnArticles":94,"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.4800593031875463,"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.8205366683816836,"acs":0,"articleLive":2,"columnArticles":633,"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.5433983479652295,"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.5937722600997253,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1344]时钟指针的夹角","frequency":6.717188864301861,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3668957468879668,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":6.126293813912077,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4359282809188291,"acs":0,"articleLive":2,"columnArticles":262,"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.7388479441427463,"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.3031638750122441,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1348]推文计数","frequency":7.982643366845061,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5039774610540272,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":6.717188864301861,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.848310492729365,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":6.126293813912077,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7550245414621545,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.018255598477773,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4421778084079945,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.717188864301861,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28252367229312475,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.64371688866175,"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.2855982124720699,"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.6617221418234442,"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.7315086137497987,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.183442713396072,"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.5286301369863013,"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.4877960257689865,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.5605738976163455,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5466478190630049,"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.5035374481580873,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1360]日期之间隔几天","frequency":34.11174318737981,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4010698166824539,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1361]验证二叉树","frequency":5.5605738976163455,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5230784871899146,"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.3626145199784433,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":34.79947650804195,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6750157861502841,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.5605738976163455,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8251175667848062,"acs":0,"articleLive":2,"columnArticles":1077,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.27337559962882,"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.5364356743318831,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":18.094047193227674,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4177247191011236,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":16.7954628814756,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5207277065314644,"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.608415013148458,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":5.5605738976163455,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7904626428701391,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1370]上升下降字符串","frequency":5.018255598477773,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799004700027647,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.4533539470012,"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.5134559535333979,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.5605738976163455,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3981278511760175,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":29.771219133044468,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7393560404470463,"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.5725123619860462,"acs":0,"articleLive":2,"columnArticles":169,"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.5023680417324456,"acs":0,"articleLive":2,"columnArticles":151,"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.32535390488309207,"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.8620049504950495,"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.8367598684210527,"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.7274062861722019,"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.7319212526801377,"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.691046414046866,"acs":0,"articleLive":2,"columnArticles":170,"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.32369900533371776,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":9.375798529801575,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5420070011668612,"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.7030628694250403,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1385]两个数组间的距离值","frequency":5.5605738976163455,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3106289340361292,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":20.23036191390926,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6943939504108194,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":19.505000983338796,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5373134328358209,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":34.11174318737981,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307876251681363,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.183442713396072,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3524799727288222,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4003195673549656,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":20.23036191390926,"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.4008982197933012,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1392]最长快乐前缀","frequency":5.5605738976163455,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8573629760070438,"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.6640865020149224,"acs":0,"articleLive":2,"columnArticles":267,"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.7500268730517038,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.5605738976163455,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4121809225257501,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1396]设计地铁系统","frequency":19.505000983338796,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.36937941285767373,"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.7703375760929718,"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.6685005868544601,"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.6045272969374168,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.5605738976163455,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4177298004579653,"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.7515478009166198,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":5.5605738976163455,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915268903088392,"acs":0,"articleLive":2,"columnArticles":357,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.7954628814756,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49252485918920796,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":6.717188864301861,"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.5059949809461846,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1405]最长快乐字符串","frequency":17.431734517438745,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5693009848666827,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":6.717188864301861,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6678470254957507,"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.614409984871407,"acs":0,"articleLive":2,"columnArticles":197,"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.8050778879223144,"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.47598622213556896,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1410]HTML 实体解析器","frequency":7.982643366845061,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5491985912455977,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":45.09699522101154,"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.5501258389261745,"acs":0,"articleLive":2,"columnArticles":64,"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.6920179727765297,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.183442713396072,"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.6021550283995991,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.27337559962882,"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.6841602039732285,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.126293813912077,"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.4083184257602862,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":20.23036191390926,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5182418845159437,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.126293813912077,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7328074721644787,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1418]点菜展示表","frequency":49.33480470459832,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4185394772298572,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":34.79947650804195,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5935775213246363,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.63396138377883,"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.7483669412098836,"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.5406701085238648,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1422]分割字符串的最大得分","frequency":29.771219133044468,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5545169324319953,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":5.5605738976163455,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3975337280996276,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1424]对角线遍历 II","frequency":17.431734517438745,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43416219270980505,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.717188864301861,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7057318321392017,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":8.661896872488112,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6571613739468568,"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.592891760904685,"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.5004549590536852,"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.5783879539415412,"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.8463027613733999,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.5605738976163455,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39262877442273536,"acs":0,"articleLive":2,"columnArticles":97,"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.64257512612415,"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.45485455232338495,"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.6199465156520372,"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.7834142364842331,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5890450912909059,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":6.126293813912077,"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.4827073924411695,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":36.06764328403421,"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.5608555162332667,"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.6975916803503011,"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.6474719101123596,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1441]用栈操作构建数组","frequency":6.717188864301861,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7917126056596839,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":53.194615449151314,"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.4104132477994928,"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.5247687564234327,"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.8583788706739527,"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.5725148108410691,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6170371953826421,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7131950335466954,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":4.497741382272873,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6277276582620094,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":35.513575061270465,"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.8022831667116995,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":5.018255598477773,"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.5214013950538998,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":6.717188864301861,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49799265396771164,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.3352351801640365,"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.36308040770101924,"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.40255698544873414,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":16.7954628814756,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6333423545331529,"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.5194200530937308,"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.6361861373250894,"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.44093483289463187,"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.5934246575342466,"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.7441709844559585,"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.49969381506429883,"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.42633992548008026,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1462]课程表 IV","frequency":5.5605738976163455,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5901565995525727,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":10.101159460372038,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7687885377260135,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1464]数组中两元素的最大乘积","frequency":16.7954628814756,"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.3077572087944811,"acs":0,"articleLive":2,"columnArticles":78,"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.4846597103254945,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":17.431734517438745,"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.6140350877192983,"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.7115191146881288,"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.8030990173847317,"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.843522852532869,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[1470]重新排列数组","frequency":42.08612690382681,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5426651735722284,"acs":0,"articleLive":2,"columnArticles":103,"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.6158934921028695,"acs":0,"articleLive":2,"columnArticles":124,"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.6749277519922936,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":48.06912922707036,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7194552529182879,"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.7238836542400655,"acs":0,"articleLive":2,"columnArticles":223,"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.865249704799611,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1476]子矩形查询","frequency":18.784393512347606,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28888888888888886,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":17.431734517438745,"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.5755074726745483,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":27.09454954407483,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5734200743494424,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":6.126293813912077,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.869539320996529,"acs":0,"articleLive":2,"columnArticles":1274,"formTitle":"[1480]一维数组的动态和","frequency":31.192584180879035,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5120104438642298,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1481]不同整数的最少数目","frequency":34.11174318737981,"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.5870733008229199,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":47.89480770437785,"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.2994881340158213,"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.8053475935828877,"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.6605301914580265,"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.8586615949184985,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":47.89480770437785,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3079279500061267,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1487]保证文件名唯一","frequency":24.27337559962882,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23542254467284698,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1488]避免洪水泛滥","frequency":60.912645678109975,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6928709755507141,"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.8568111455108359,"acs":0,"articleLive":2,"columnArticles":28,"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.671759928419024,"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.6658211794546608,"acs":0,"articleLive":2,"columnArticles":74,"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.5660758706467661,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.27337559962882,"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.3661257606490872,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":28.693957820014365,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5422921478060047,"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.5384343076767473,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1496]判断路径是否相交","frequency":5.5605738976163455,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39087361152806965,"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.3331583437233414,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":20.23036191390926,"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.3772350632359355,"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.3003533568904594,"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.5911239896294037,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":23.63396138377883,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7169322077847244,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[1502]判断能否形成等差数列","frequency":33.44858233523286,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5119439366240097,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":17.431734517438745,"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.5933678076007551,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1504]统计全 1 子矩形","frequency":33.44858233523286,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.360884619680554,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":34.28130602249608,"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.8423566878980892,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":29.11716714389944,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5882905447714465,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1507]转变日期格式","frequency":29.771219133044468,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5531756379214007,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1508]子数组和排序后的区间和","frequency":6.717188864301861,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5445714285714286,"acs":0,"articleLive":2,"columnArticles":72,"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.5778947368421052,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":29.11716714389944,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6814220982920879,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.126293813912077,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.848730622002552,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[1512]好数对的数目","frequency":5.018255598477773,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37892610906051954,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":5.018255598477773,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31602737956864263,"acs":0,"articleLive":2,"columnArticles":130,"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.34117129985715855,"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.575682382133995,"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.7304932735426009,"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.674535506984753,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[1518]换酒问题","frequency":24.27337559962882,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2956892312735617,"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.3318230277185501,"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.395674687785562,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":12.277242252083424,"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.7034632034632035,"acs":0,"articleLive":2,"columnArticles":24,"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.5780736848390756,"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.4253677138187761,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.183442713396072,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6603628929210325,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.126293813912077,"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.6124546553808948,"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.5075847709696609,"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.7844290657439447,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[1528]重新排列字符串","frequency":15.594060827695694,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6888276947285602,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1529]灯泡开关 IV","frequency":6.126293813912077,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5661165241598728,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":16.7954628814756,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32431450880697293,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.84704592621567,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6178251392589005,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":6.126293813912077,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6137931034482759,"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.7893847669998593,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.5605738976163455,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4527139296593741,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1535]找出数组游戏的赢家","frequency":6.717188864301861,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4391891891891892,"acs":0,"articleLive":2,"columnArticles":76,"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.36481512464447047,"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.6042780748663101,"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.5381726304288446,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[1539]第 k 个缺失的正整数","frequency":37.69846188927235,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3166233939151854,"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.4582699847963511,"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.38111005991800695,"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.5474695959199686,"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.5444895857175555,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[1544]整理字符串","frequency":34.11174318737981,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5522455427668698,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":17.431734517438745,"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.4107914255440541,"acs":0,"articleLive":2,"columnArticles":76,"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.5346548004314995,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":27.09454954407483,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7127659574468085,"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.667528735632184,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":5.5605738976163455,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6603486046290122,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.5605738976163455,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8173127193965195,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.5605738976163455,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5075101097631427,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":16.7954628814756,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29423924490034714,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":60.22109842839297,"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.7053701015965167,"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.4346326836581709,"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.5793394862670966,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[1556]千位分隔数","frequency":45.09699522101154,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7628231859883235,"acs":0,"articleLive":2,"columnArticles":97,"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.621875,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":6.717188864301861,"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.36677358699258933,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":9.375798529801575,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5735542779844437,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.717188864301861,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7793401467864737,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.183442713396072,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30983316108076187,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":9.375798529801575,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37805593584979463,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":42.17824861879155,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5873642645607108,"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.7249940319885414,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":6.126293813912077,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4460772969220088,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.5605738976163455,"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.395257801140812,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":24.27337559962882,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4548736462093863,"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.4716361931551805,"acs":0,"articleLive":2,"columnArticles":44,"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.8972904851921865,"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.7571929824561403,"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.804751843387521,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1572]矩阵对角线元素的和","frequency":16.7954628814756,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29565572654228517,"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.3260281770314501,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":25.62736124123482,"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.5980361596009975,"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.47602934408922337,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":5.018255598477773,"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.3240411357609469,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.375798529801575,"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.5802827707145989,"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.6196126937497585,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":21.0193139246888,"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.6301020408163265,"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.808812729498164,"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.6715728715728716,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.126293813912077,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6860865381056372,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":25.62736124123482,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6663680910480004,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[1584]连接所有点的最小费用","frequency":18.784393512347606,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4293030912749223,"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.6197916666666666,"acs":0,"articleLive":2,"columnArticles":22,"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.8243174924165824,"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.8387753519215109,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[1588]所有奇数长度子数组的和","frequency":21.636286392235128,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2943574168797954,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":7.3352351801640365,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26437480985701245,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1590]使数组和能被 P 整除","frequency":6.717188864301861,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5810955961331902,"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.44461538461538463,"acs":0,"articleLive":2,"columnArticles":123,"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.5295251623376623,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.5605738976163455,"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.31334504621495685,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":6.717188864301861,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46188452886778303,"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.7623828647925034,"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.6650717703349283,"acs":0,"articleLive":2,"columnArticles":18,"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.671179641469224,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.5605738976163455,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4191597008358997,"acs":0,"articleLive":2,"columnArticles":67,"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.6813303407467863,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":17.431734517438745,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48408087380897047,"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.7818831942789034,"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.844928713228659,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1603]设计停车系统","frequency":60.912645678109975,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4141160347190498,"acs":0,"articleLive":2,"columnArticles":60,"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.734630002235636,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3413327619455753,"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.5468400731558626,"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.6396281075254329,"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.5116777531411678,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1609]奇偶树","frequency":5.5605738976163455,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2705937573339592,"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.6096908442330559,"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.7348353552859619,"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.7253100597152045,"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.8211797724652934,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[1614]括号的最大嵌套深度","frequency":4.497741382272873,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4950115118956255,"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.2750925199057979,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.126293813912077,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6176258992805755,"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.5881188118811881,"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.6773266947529683,"acs":0,"articleLive":2,"columnArticles":124,"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.3698334361505244,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":9.375798529801575,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43759551706571576,"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.14682764258316042,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":17.431734517438745,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7831325301204819,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":6.126293813912077,"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.6277825220609166,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.7954628814756,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5421141888072357,"acs":0,"articleLive":2,"columnArticles":64,"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.3841066341066341,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.126293813912077,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3787661406025825,"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.8356164383561644,"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.5234654689839224,"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.7688251423750264,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1630]等差子数组","frequency":6.126293813912077,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4923224568138196,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":23.63396138377883,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31677704194260486,"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.6557756624646257,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.126293813912077,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5193591455273698,"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.5442142496210207,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":6.717188864301861,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7062009863368097,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.5605738976163455,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8053275514945021,"acs":0,"articleLive":2,"columnArticles":68,"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.7118028534370947,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":8.661896872488112,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.401572224041926,"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.6625192747381294,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1640]能否连接形成数组","frequency":5.5605738976163455,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7696985379738647,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.392431737912304,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45356104651162793,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":5.5605738976163455,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45020576131687245,"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.5381615598885794,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":18.784393512347606,"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.4142857142857143,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":6.717188864301861,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5378775947333606,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.576433709659078,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5123674911660777,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.27337559962882,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27772277227722775,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.505000983338796,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474518037793472,"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.7956043956043956,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":7.3352351801640365,"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.6871287128712872,"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.6597600872410033,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1652]拆炸弹","frequency":16.7954628814756,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5037583116507661,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":6.126293813912077,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2733758603323821,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":16.7954628814756,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38368580060422963,"acs":0,"articleLive":2,"columnArticles":31,"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.7811123630031752,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":5.018255598477773,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46484985245617083,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.126293813912077,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2970922882427307,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"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.4107198504206918,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":13.222450728632962,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7397260273972602,"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.7287166454891995,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":18.094047193227674,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8132625349600746,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.183442713396072,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725442156037057,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.62736124123482,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5450612833453496,"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.666579016565869,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":7.3352351801640365,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6811145510835913,"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.6004749183734046,"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.44174153420870765,"acs":0,"articleLive":2,"columnArticles":124,"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.7644193796462445,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1669]合并两个链表","frequency":16.7954628814756,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5293586269196026,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":5.5605738976163455,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46450544249881687,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":8.661896872488112,"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.8505299007416369,"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.35129197115154986,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":5.018255598477773,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36202002091737634,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":19.505000983338796,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43590189598190987,"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.7667731629392971,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":10.101159460372038,"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.39766081871345027,"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.8303215777713009,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":5.018255598477773,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49646174259177356,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":5.5605738976163455,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4617270975652479,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.126293813912077,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38355481727574753,"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.5269784172661871,"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.8943912448700411,"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.8276388818167931,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[1684]统计一致字符串的数目","frequency":24.27337559962882,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5960532973519986,"acs":0,"articleLive":2,"columnArticles":81,"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.4711556297532925,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.126293813912077,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39842381786339753,"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.8050124275062137,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1688]比赛中的配对次数","frequency":16.7954628814756,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8689646742452023,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1689]十-二进制数的最少数目","frequency":15.594060827695694,"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.5131063204311612,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1690]石子游戏 VII","frequency":6.126293813912077,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4858192205672312,"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.6411290322580645,"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.801071155317521,"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.6337813847324373,"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.4568092181579151,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1695]删除子数组的最大得分","frequency":5.018255598477773,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3970666666666667,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":23.017386824306058,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5256283883686546,"acs":0,"articleLive":2,"columnArticles":42,"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.544766708701135,"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.800792864222002,"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.7168185419968305,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.018255598477773,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6108670896372214,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1701]平均等待时间","frequency":17.431734517438745,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4747440845779493,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":18.784393512347606,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38955317809943363,"acs":0,"articleLive":2,"columnArticles":22,"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.7817494528814908,"acs":0,"articleLive":2,"columnArticles":180,"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.3471438317930906,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":17.431734517438745,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5831352258425395,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1706]球会落何处","frequency":16.7954628814756,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032595458127374,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":39.86152842853764,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6967278531524341,"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.712358337830545,"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.6928791789964113,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":23.63396138377883,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3592776263493474,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":50.524625007718235,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26474234106605277,"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.49701980388386846,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":45.77699202581343,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.637883008356546,"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.7335870599429115,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1715]苹果和橘子的个数","frequency":17.431734517438745,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6759314519566886,"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.43057247259439707,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4872258064516129,"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.36577992744860943,"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.869425487267709,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":56.72144306952094,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6470921807069497,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1721]交换链表中的节点","frequency":6.126293813912077,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5140094495110428,"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.507513964003901,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":72.9371157462153,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5576271186440678,"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.78762995329215,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.5605738976163455,"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.47744095875925274,"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.5747991109591383,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":7.982643366845061,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35563612392880684,"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.6246819338422391,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.126293813912077,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.530060120240481,"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.47636674259681094,"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.7924528301886793,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1732]找到最高海拔","frequency":29.771219133044468,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4582493843743004,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":9.375798529801575,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231820425554025,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":55.409905402038326,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4840764331210191,"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.4490566636517986,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.09699522101154,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3096424512632223,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":18.784393512347606,"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.6542903525046382,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":40.08097302202694,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4717048710601719,"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.7032085561497327,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":12.277242252083424,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8447261204164781,"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.7073023536511768,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.018255598477773,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6973035753523559,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":42.17824861879155,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36274976519177077,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":56.14876317436218,"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.4842089728453365,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":6.126293813912077,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5892857142857143,"acs":0,"articleLive":2,"columnArticles":28,"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.7052194543297746,"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.748809100604337,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":24.937244926792673,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5307739183424741,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.27337559962882,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4580119342162713,"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.4711406321575813,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":18.784393512347606,"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.6841487566933177,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":5.018255598477773,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6286334056399132,"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.4201007090740931,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":6.717188864301861,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39923954372623577,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":7.982643366845061,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8287153652392947,"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.9240091713069112,"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.6359455481972038,"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.4288044521205143,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1759]统计同构子字符串的数目","frequency":6.126293813912077,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5373986980204597,"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.4292508917954816,"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.6705882352941176,"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.6086956521739131,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1763]最长的美好子字符串","frequency":6.126293813912077,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4770877944325482,"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.5532286212914486,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":6.126293813912077,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37465790914066777,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":15.02585801200021,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7966101694915254,"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.7696005655708731,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1768]交替合并字符串","frequency":16.183442713396072,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8553250827958864,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.5605738976163455,"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.368738023542294,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":10.8265203909425,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36480411046885036,"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.5247349823321554,"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.8415894895541676,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":22.422190473341242,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.552977937695294,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":5.5605738976163455,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47365426197792193,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":18.094047193227674,"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.4612868047982552,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":27.876354625024913,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.778267716535433,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1777]每家商店的产品价格","frequency":65.53422772513046,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5753424657534246,"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.645935960591133,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":5.5605738976163455,"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.662736736485639,"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.5177533892834086,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":6.126293813912077,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2867756315007429,"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.7905604719764012,"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.4209805934398983,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":5.5605738976163455,"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.3482570442142778,"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.3403707518022657,"acs":0,"articleLive":2,"columnArticles":86,"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.6542948038176034,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":54.41949805387198,"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.6854838709677419,"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.7110762800417972,"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.6496640195479536,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.5605738976163455,"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.8092336737320862,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1791]找出星型图的中心节点","frequency":5.018255598477773,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5120926175561018,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":38.392431737912304,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41239130434782606,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":18.094047193227674,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.685,"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.7849037987173162,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":24.937244926792673,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48690110927543073,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1796]字符串中第二大的数字","frequency":5.5605738976163455,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5740407258623078,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1797]设计一个验证系统","frequency":17.431734517438745,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5193920335429769,"acs":0,"articleLive":2,"columnArticles":49,"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.5160550458715596,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":7.3352351801640365,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.683008194937994,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1800]最大升序子数组和","frequency":16.7954628814756,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37707844058243306,"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.2621328224776501,"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.40713166144200624,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":22.71720223657227,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5737226277372263,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":9.375798529801575,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4930652183670721,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.5605738976163455,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6643146478505161,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.34571948574115,"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.5843379809204319,"acs":0,"articleLive":2,"columnArticles":84,"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.2670800575794486,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":10.8265203909425,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.637117903930131,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1809]没有广告的剧集","frequency":24.937244926792673,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6830357142857143,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":27.876354625024913,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6618049225159526,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":6.126293813912077,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7948266942576306,"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.517864231838031,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1813]句子相似性 III","frequency":25.62736124123482,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3422213311948677,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.126293813912077,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30227703984819737,"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.7526873580620742,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1816]截断句子","frequency":5.5605738976163455,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6969878795151806,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.5605738976163455,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37423582706601577,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":46.48161132199868,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3657115104419621,"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.4971751412429379,"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.9018947368421053,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":24.937244926792673,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8129646646061315,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1822]数组元素积的符号","frequency":16.183442713396072,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7086481947942905,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1823]找出游戏的获胜者","frequency":16.7954628814756,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6607065358909817,"acs":0,"articleLive":2,"columnArticles":151,"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.28725630576054634,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":11.551881321512962,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43907156673114117,"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.7961234106872944,"acs":0,"articleLive":2,"columnArticles":134,"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.8697208303507517,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.183442713396072,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.678464518401127,"acs":0,"articleLive":2,"columnArticles":82,"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.48548199767711964,"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.7326923076923076,"acs":0,"articleLive":2,"columnArticles":22,"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.8228257355318461,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":23.63396138377883,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6849835401367435,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1833]雪糕的最大数量","frequency":29.11716714389944,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3507793074170659,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.154717435598055,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5082928224192165,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":11.551881321512962,"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.7203389830508474,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.8265203909425,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7949462365591398,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":5.5605738976163455,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.43004220681338556,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":57.41101373667228,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5767521987487533,"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.38812322659100124,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":10.101159460372038,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5150273224043715,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1841]联赛信息统计","frequency":24.27337559962882,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6950354609929078,"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.5094517958412098,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":5.5605738976163455,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8027770951093635,"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.569977880554997,"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.6337257810327246,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":40.754859727265256,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3601138699984185,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":6.717188864301861,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6857676154923005,"acs":0,"articleLive":2,"columnArticles":97,"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.3287228309682055,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":7.3352351801640365,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6051592524348512,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":7.982643366845061,"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.40115559224102354,"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.7074235807860262,"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.6461880088823094,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":6.717188864301861,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7934035087719298,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1854]人口最多的年份","frequency":24.27337559962882,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6892208749246332,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.63396138377883,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35575250559098814,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":18.784393512347606,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4520043336944745,"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.647982062780269,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":11.551881321512962,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7712993812470252,"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.7715482841181165,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1860]增长的内存泄露","frequency":5.5605738976163455,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6178908810487758,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":6.126293813912077,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3105875592587272,"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.9178780729127026,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":40.754859727265256,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38673982624599906,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":7.3352351801640365,"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.5157641877689921,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.596340449126698,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.0193139246888,"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.7523277467411545,"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.526829268292683,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":17.431734517438745,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7955216219684332,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1869]哪种连续子字符串更长","frequency":24.27337559962882,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45991244527829894,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.126293813912077,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763208086973107,"acs":0,"articleLive":2,"columnArticles":124,"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.6263630532392559,"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.8017641597028784,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":34.11174318737981,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8825757575757576,"acs":0,"articleLive":2,"columnArticles":14,"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.7397849462365591,"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.7288778446246403,"acs":0,"articleLive":2,"columnArticles":87,"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.8191916997120974,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1877]数组中最大数对和的最小值","frequency":53.194615449151314,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42933333333333334,"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.4087607807535179,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":7.3352351801640365,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.774014978834256,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.5605738976163455,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3524431543299468,"acs":0,"articleLive":2,"columnArticles":62,"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.2779171894604768,"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.3727849485889302,"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.6926444833625219,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":34.11174318737981,"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.517948717948718,"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.5721825178669598,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":16.7954628814756,"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.6407513696843203,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.717188864301861,"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.314618520675597,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":7.3352351801640365,"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.27390491452991456,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":18.094047193227674,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7021660649819494,"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.5106382978723404,"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.3344623200677392,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.126293813912077,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5914399862366907,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.09699522101154,"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.43251902282739285,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5298013245033113,"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.503680981595092,"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.5302909701954541,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.7954628814756,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30822558030845926,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":10.101159460372038,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6275922671353251,"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.42766827817032355,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":25.62736124123482,"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.6617480136208853,"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.42857142857142855,"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.6448892595681587,"acs":0,"articleLive":2,"columnArticles":98,"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.2764710806060099,"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.5713545713545714,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1905]统计子岛屿","frequency":5.5605738976163455,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42300297150847754,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":21.0193139246888,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6182707993474714,"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.6842105263157895,"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.32782515991471217,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":6.126293813912077,"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.6745411948457634,"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.5697151424287856,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1911]最大子序列交替和","frequency":16.183442713396072,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2917647058823529,"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.8436965202509983,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":6.126293813912077,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4407867206025945,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.431734517438745,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3905434015525759,"acs":0,"articleLive":2,"columnArticles":55,"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.5524614619592243,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":19.505000983338796,"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.2907303370786517,"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.47115384615384615,"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.38341968911917096,"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.9297662337662338,"acs":0,"articleLive":2,"columnArticles":78,"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.342957972409368,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.7954628814756,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36242365798778525,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.5605738976163455,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23736372646184342,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":26.34571948574115,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.4666666666666667,"acs":0,"articleLive":2,"columnArticles":3,"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.6970423661071143,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.449805057568714,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34588477366255144,"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.41041162227602906,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.5605738976163455,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3954867087397208,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":31.88795185911469,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9300866998708726,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1929]数组串联","frequency":16.183442713396072,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4753395282344532,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.7954628814756,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5539033457249071,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":7.982643366845061,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3268987341772152,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":20.23036191390926,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5684830633284241,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"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.7416974169741697,"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.7399552256392129,"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.4487527784638182,"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.2406894915790306,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.431734517438745,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3387096774193548,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":18.784393512347606,"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.8323529411764706,"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.7719521044992743,"acs":0,"articleLive":2,"columnArticles":77,"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.39182833627278074,"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.4046216583597644,"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.5698717948717948,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.126293813912077,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6619884293979001,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.5605738976163455,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30268691588785046,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.431734517438745,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5402041672493357,"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.5178571428571429,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.661896872488112,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.4966887417218543,"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.5432692307692307,"acs":0,"articleLive":2,"columnArticles":6,"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.7181467181467182,"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.5424423569598633,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1952]三除数","frequency":5.018255598477773,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3213919356111418,"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.4794487427466151,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":5.5605738976163455,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49346534653465346,"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.4357142857142857,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":21.84704592621567,"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.6101060511540861,"acs":0,"articleLive":2,"columnArticles":50,"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.42040673211781204,"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.40446051838456903,"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.2786471479050984,"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.5350276425447644,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":4.497741382272873,"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.4231479251946384,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1962]移除石子使总数最小","frequency":15.594060827695694,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6116919452216169,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":5.5605738976163455,"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.38152914458743376,"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.7654723127035831,"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.75,"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.7741801577418016,"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.3527255339496334,"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.27633124510571655,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":21.84704592621567,"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.4755813953488372,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":16.7954628814756,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5555555555555556,"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.4936708860759494,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":12.277242252083424,"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.5051546391752577,"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.7453834455789702,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":2.176082791711387,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3763425461835887,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1975]最大方阵和","frequency":13.947811659203424,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.27921141208527006,"acs":0,"articleLive":2,"columnArticles":30,"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.24059616749467708,"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.6010362694300518,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1978]","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8297221852984182,"acs":0,"articleLive":2,"columnArticles":66,"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.579229797979798,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1980]找出不同的二进制字符串","frequency":12.277242252083424,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2950980392156863,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":23.017386824306058,"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.45720984759671746,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1982]从子集的和还原数组","frequency":11.551881321512962,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6956521739130435,"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.5793033479878255,"acs":0,"articleLive":2,"columnArticles":55,"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.4066661286417561,"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.26214315266859745,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1986]完成任务的最少工作时间段","frequency":7.3352351801640365,"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.45043782837127844,"acs":0,"articleLive":2,"columnArticles":24,"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.6571428571428571,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1988]","frequency":25.62736124123482,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.3548387096774194,"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.6533333333333333,"acs":0,"articleLive":2,"columnArticles":4,"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.6642712777902537,"acs":0,"articleLive":2,"columnArticles":35,"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.5867568873852103,"acs":0,"articleLive":2,"columnArticles":48,"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.378076062639821,"acs":0,"articleLive":2,"columnArticles":40,"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.3525046382189239,"acs":0,"articleLive":2,"columnArticles":28,"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.5357186173438447,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.22525872219123752,"acs":0,"articleLive":2,"columnArticles":80,"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.3291382252559727,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1997]访问完所有房间的第一天","frequency":15.02585801200021,"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.4207165661582121,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1998]数组的最大公因数排序","frequency":30.449805057568714,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.8446350576224807,"acs":0,"articleLive":2,"columnArticles":620,"formTitle":"[LCP 01]猜数字","frequency":43.41774720360198,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6890520068717788,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[LCP 02]分式化简","frequency":28.48603299997492,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2182689018132056,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":23.017386824306058,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37610818933132983,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 04]覆盖","frequency":40.640882130761085,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19638602065131056,"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.8395190491183879,"acs":0,"articleLive":2,"columnArticles":646,"formTitle":"[LCP 06]拿硬币","frequency":34.11174318737981,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.770527977973925,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[LCP 07]传递信息","frequency":66.63175827085747,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2839005159719404,"acs":0,"articleLive":2,"columnArticles":100,"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.2688158009223005,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":62.67634598009314,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5840248962655602,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":18.094047193227674,"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.6850629255209408,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":6.126293813912077,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4064370262002926,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 12]小张刷题计划","frequency":41.4533539470012,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6134057733848268,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":7.3352351801640365,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.203453214513049,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":29.771219133044468,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5691340782122905,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":10.8265203909425,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2988691437802908,"acs":0,"articleLive":2,"columnArticles":14,"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.7983178734597812,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[LCP 17]速算机器人","frequency":29.771219133044468,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2849369988545246,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[LCP 18]早餐组合","frequency":34.11174318737981,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162076271186441,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":33.44858233523286,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.30335032774945375,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":18.784393512347606,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.32726484612050283,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":9.375798529801575,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3323872237359976,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[LCP 22]黑白方格画","frequency":50.524625007718235,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33677575107296137,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":16.7954628814756,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2730168843580758,"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.3260998810939358,"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.33484455958549225,"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.3265524625267666,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":25.62736124123482,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.27365505614594937,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[LCP 28]采购方案","frequency":27.286804992756892,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.17851035908855928,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[LCP 29]乐团站位","frequency":49.81605168619866,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34063094914332337,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[LCP 30]魔塔游戏","frequency":4.497741382272873,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2373988799004356,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":16.7954628814756,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3827054794520548,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":17.431734517438745,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2051373893465691,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[LCP 33]蓄水","frequency":29.771219133044468,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4631111111111111,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[LCP 34]二叉树染色","frequency":29.771219133044468,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.37964338781575035,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 35]电动车游城市","frequency":18.094047193227674,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.24439624005784527,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 36]最多牌组数","frequency":37.02908617571276,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.18504672897196262,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 37]最小矩形面积","frequency":34.28130602249608,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5340599455040872,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":20.23036191390926,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5402074252217045,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[LCS 01]下载插件","frequency":25.62736124123482,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6986622858483924,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[LCS 02]完成一半题目","frequency":17.431734517438745,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4170168067226891,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[LCS 03]主题空间","frequency":6.717188864301861,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786710239264686,"acs":0,"articleLive":2,"columnArticles":2708,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":95.2412466114497,"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.40301773822241127,"acs":0,"articleLive":2,"columnArticles":2010,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":74.14605711246726,"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.7619219018359701,"acs":0,"articleLive":2,"columnArticles":1863,"formTitle":"[剑指 Offer 05]替换空格","frequency":61.92612693316397,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523325725395719,"acs":0,"articleLive":2,"columnArticles":2001,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":75.55965969668803,"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.6964264481955807,"acs":0,"articleLive":2,"columnArticles":1409,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":81.71296529634347,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.717140867896489,"acs":0,"articleLive":2,"columnArticles":1587,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":89.71209805260229,"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.35927954527829875,"acs":0,"articleLive":2,"columnArticles":1811,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":56.891617058545194,"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.44242021977600676,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":70.51897044168722,"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.49326743338719387,"acs":0,"articleLive":2,"columnArticles":1576,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":81.19672142464296,"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.45314038113667915,"acs":0,"articleLive":2,"columnArticles":1086,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":62.47607008450393,"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.5257708755345487,"acs":0,"articleLive":2,"columnArticles":1662,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":76.15596047026474,"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.5686728133828381,"acs":0,"articleLive":2,"columnArticles":1266,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":64.9933255617794,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31132717549829847,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":38.392431737912304,"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.7463762496025313,"acs":0,"articleLive":2,"columnArticles":1228,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":51.40053346942231,"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.3389056315414402,"acs":0,"articleLive":2,"columnArticles":735,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":35.15311049539493,"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.7774493922782325,"acs":0,"articleLive":2,"columnArticles":1095,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":65.58650498475569,"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.5956547958277557,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":58.615928238671536,"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.3751826702427974,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":56.72144306952094,"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.23990737418870878,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":69.56461578061828,"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.6425209690005214,"acs":0,"articleLive":2,"columnArticles":1571,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":55.409905402038326,"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.7977007823726648,"acs":0,"articleLive":2,"columnArticles":2389,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":63.62702100509402,"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.7427424460819312,"acs":0,"articleLive":2,"columnArticles":1766,"formTitle":"[剑指 Offer 24]反转链表","frequency":93.52810594370469,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7287998271578265,"acs":0,"articleLive":2,"columnArticles":1139,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":79.16250021794193,"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.46550751240736965,"acs":0,"articleLive":2,"columnArticles":1138,"formTitle":"[剑指 Offer 26]树的子结构","frequency":69.08205550439399,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7913496630953468,"acs":0,"articleLive":2,"columnArticles":1355,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":64.9933255617794,"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.5803349748850777,"acs":0,"articleLive":2,"columnArticles":1050,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":49.58541719627019,"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.4400487683157559,"acs":0,"articleLive":2,"columnArticles":1437,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":82.49054404331886,"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.5724675417161831,"acs":0,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":54.613674571267666,"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.6143545213252791,"acs":0,"articleLive":2,"columnArticles":905,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":38.19154405126015,"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.6455263923295255,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":61.04928662671588,"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.6859377485550665,"acs":0,"articleLive":2,"columnArticles":1045,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":55.87690840547423,"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.5887798021754408,"acs":0,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":54.4655588544232,"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.5503621443865059,"acs":0,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.26755201022692,"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.5774118808351956,"acs":0,"articleLive":2,"columnArticles":835,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":63.96760238712464,"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.720673821172198,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":56.66729227171354,"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.6543777885322956,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":68.98690472401461,"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.5596588774513487,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":70.17699782235186,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5790185220546115,"acs":0,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":92.75343536429857,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.689658575517157,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":59.11895682166468,"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.5697925659414593,"acs":0,"articleLive":2,"columnArticles":1766,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":74.25117951356212,"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.5809343014266982,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":46.612506335453844,"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.6053831095394189,"acs":0,"articleLive":2,"columnArticles":1479,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":90.34848363720384,"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.48317157730029353,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":53.344912676000725,"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.4133841394518861,"acs":0,"articleLive":2,"columnArticles":444,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":49.58541719627019,"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.5621533801459452,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":65.34714075383448,"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.5379552162411684,"acs":0,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":69.0319205527274,"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.6890956576502041,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":54.07123716231773,"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.4646599981046557,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":69.56461578061828,"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.6514057411135553,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[剑指 Offer 49]丑数","frequency":68.04521240809358,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.613717931676193,"acs":0,"articleLive":2,"columnArticles":1010,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":64.41706097832508,"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.4813553761730555,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":91.0738445677743,"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.6480270181091206,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":66.82774247538966,"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.5388642213157935,"acs":0,"articleLive":2,"columnArticles":1523,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":58.391388591970184,"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.4470092059317038,"acs":0,"articleLive":2,"columnArticles":1412,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":57.46505646303098,"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.7554393336173588,"acs":0,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":47.697465233081225,"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.7894452868452143,"acs":0,"articleLive":2,"columnArticles":1229,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":61.521109348466766,"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.5871048826303769,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.11482045953906,"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.6993253973295389,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":63.47781444733709,"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.7992597978893985,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":48.96477832790934,"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.6637999748290473,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.48820145795808,"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.7063228922809657,"acs":0,"articleLive":2,"columnArticles":1822,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":60.467322118447406,"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.4413146556390326,"acs":0,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":58.12522309159364,"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.8566850529141684,"acs":0,"articleLive":2,"columnArticles":1720,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":53.61306400372832,"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.4438848388018326,"acs":0,"articleLive":2,"columnArticles":1159,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":75.77290339252512,"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.47453309361191337,"acs":0,"articleLive":2,"columnArticles":1042,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":45.09699522101154,"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.5597236110735746,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":59.55257549843934,"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.45965037459864433,"acs":0,"articleLive":2,"columnArticles":940,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":61.503519659114794,"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.6552552590031763,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":72.95307004215124,"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.6334804320657952,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":61.503519659114794,"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.8570714804817275,"acs":0,"articleLive":2,"columnArticles":1260,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":53.020696403014625,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5819338444384902,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.440004346103564,"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.5978484362122066,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":55.9516563579218,"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.2852960945238432,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":47.21264610252666,"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.693097084251988,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":48.36315695657654,"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.6999962289765442,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":62.3423813730798,"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.20662930204045887,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 001]整数除法","frequency":13.222450728632962,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5928656048440174,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.450721861140925,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7868325412356724,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":3.516484022321481,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6997661730319563,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":3.997587297058907,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7224041159962582,"acs":0,"articleLive":2,"columnArticles":58,"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.6700251889168766,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4642607357672402,"acs":0,"articleLive":2,"columnArticles":48,"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.520381071372794,"acs":0,"articleLive":2,"columnArticles":60,"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.5426727726894255,"acs":0,"articleLive":2,"columnArticles":49,"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.44130735000767224,"acs":0,"articleLive":2,"columnArticles":35,"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.5747599451303155,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":14.477510063836926,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6632548618219037,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5164247517188694,"acs":0,"articleLive":2,"columnArticles":44,"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.6489795918367347,"acs":0,"articleLive":2,"columnArticles":33,"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.5001009489198466,"acs":0,"articleLive":2,"columnArticles":49,"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.5306451612903226,"acs":0,"articleLive":2,"columnArticles":29,"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.5535260115606936,"acs":0,"articleLive":2,"columnArticles":36,"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.4761083743842365,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":15.02585801200021,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7093488541287741,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5388209920920202,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5189555981708217,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":12.74246225087164,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7118451025056948,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":3.053240749443787,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7723193741371376,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 024]反转链表","frequency":21.84704592621567,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6107466416744767,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":23.017386824306058,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.666860465116279,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 026]重排链表","frequency":16.183442713396072,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6217228464419475,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 027]回文链表","frequency":2.6067714007646106,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6048387096774194,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30013679890560874,"acs":0,"articleLive":2,"columnArticles":31,"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.5320476460578559,"acs":0,"articleLive":2,"columnArticles":17,"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.5889456572224803,"acs":0,"articleLive":2,"columnArticles":17,"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.5983847283406755,"acs":0,"articleLive":2,"columnArticles":31,"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.786046511627907,"acs":0,"articleLive":2,"columnArticles":29,"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.5741308793456033,"acs":0,"articleLive":2,"columnArticles":27,"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.700625,"acs":0,"articleLive":2,"columnArticles":22,"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.596642685851319,"acs":0,"articleLive":2,"columnArticles":29,"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.4565121412803532,"acs":0,"articleLive":2,"columnArticles":26,"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.7831102907245039,"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.5187246963562753,"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.5696920583468396,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":16.183442713396072,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7858892699657031,"acs":0,"articleLive":2,"columnArticles":36,"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.8619572261827608,"acs":0,"articleLive":2,"columnArticles":29,"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.6468468468468469,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6458149779735682,"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.8110787172011662,"acs":0,"articleLive":2,"columnArticles":38,"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.7206733298264072,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6959161147902869,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6818551668022783,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7449591280653951,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":15.02585801200021,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6230769230769231,"acs":0,"articleLive":2,"columnArticles":21,"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.417331206804891,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7366548042704626,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":2.6067714007646106,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6514067715784454,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8620188816267248,"acs":0,"articleLive":2,"columnArticles":30,"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.8869047619047619,"acs":0,"articleLive":2,"columnArticles":15,"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.7364077669902913,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.352258064516129,"acs":0,"articleLive":2,"columnArticles":8,"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.6,"acs":0,"articleLive":2,"columnArticles":11,"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.6283354510800508,"acs":0,"articleLive":2,"columnArticles":16,"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.6712871287128713,"acs":0,"articleLive":2,"columnArticles":30,"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.5294117647058824,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":3.516484022321481,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7141444114737884,"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.7196029776674938,"acs":0,"articleLive":2,"columnArticles":19,"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.6060606060606061,"acs":0,"articleLive":2,"columnArticles":11,"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.6220238095238095,"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.644640234948605,"acs":0,"articleLive":2,"columnArticles":17,"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.6485225505443235,"acs":0,"articleLive":2,"columnArticles":13,"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.5194664744051911,"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.7217300677436165,"acs":0,"articleLive":2,"columnArticles":25,"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.6765484383271573,"acs":0,"articleLive":2,"columnArticles":25,"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.5208333333333334,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":6.126293813912077,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42059980334316616,"acs":0,"articleLive":2,"columnArticles":35,"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.5520059435364042,"acs":0,"articleLive":2,"columnArticles":19,"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.5459825750242013,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 074]合并区间","frequency":16.183442713396072,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7130952380952381,"acs":0,"articleLive":2,"columnArticles":28,"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.6745134965473949,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5582201675816238,"acs":0,"articleLive":2,"columnArticles":34,"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.646416083916084,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8694624926166569,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 079]所有子集","frequency":3.997587297058907,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8077232502011263,"acs":0,"articleLive":2,"columnArticles":21,"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.7896092743666809,"acs":0,"articleLive":2,"columnArticles":32,"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.6475287069395906,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8597308488612836,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6785518376302797,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8610206297502715,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7691740412979351,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6352793471437539,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7427113702623906,"acs":0,"articleLive":2,"columnArticles":31,"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.6195536663124336,"acs":0,"articleLive":2,"columnArticles":17,"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.5204949729311679,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7460191082802548,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6424632352941176,"acs":0,"articleLive":2,"columnArticles":21,"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.5539070227497527,"acs":0,"articleLive":2,"columnArticles":10,"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.613941018766756,"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.6756689791873142,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":33.44858233523286,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5061855670103093,"acs":0,"articleLive":2,"columnArticles":10,"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.5215252152521526,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7573221757322176,"acs":0,"articleLive":2,"columnArticles":24,"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.6825787401574803,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":23.63396138377883,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7319679430097952,"acs":0,"articleLive":2,"columnArticles":25,"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.46516567544604925,"acs":0,"articleLive":2,"columnArticles":25,"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.5898174831892411,"acs":0,"articleLive":2,"columnArticles":11,"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.4978821717366192,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":24.937244926792673,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5561172901921132,"acs":0,"articleLive":2,"columnArticles":8,"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.6889699918896999,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5389527458492975,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5510996119016818,"acs":0,"articleLive":2,"columnArticles":8,"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.5651041666666666,"acs":0,"articleLive":2,"columnArticles":6,"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.6013143483023001,"acs":0,"articleLive":2,"columnArticles":17,"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.8453837597330367,"acs":0,"articleLive":2,"columnArticles":22,"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.6734104046242775,"acs":0,"articleLive":2,"columnArticles":11,"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.5880469583778015,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":6.126293813912077,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5761316872427984,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.40134907251264756,"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.26559865092748736,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 115]重建序列","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6451612903225806,"acs":0,"articleLive":2,"columnArticles":40,"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.6252723311546841,"acs":0,"articleLive":2,"columnArticles":10,"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.6968085106382979,"acs":0,"articleLive":2,"columnArticles":16,"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.4483910139647845,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7214804742276802,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":76.4760808202096,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6505261397704335,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":45.91589140570294,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5800169348010161,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 01.03]URL化","frequency":40.08097302202694,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5511951020174067,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[面试题 01.04]回文排列","frequency":45.77699202581343,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.333578856152513,"acs":0,"articleLive":2,"columnArticles":531,"formTitle":"[面试题 01.05]一次编辑","frequency":39.43007732492623,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.473166476548346,"acs":0,"articleLive":2,"columnArticles":1141,"formTitle":"[面试题 01.06]字符串压缩","frequency":67.4781126523476,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7551586634317423,"acs":0,"articleLive":2,"columnArticles":941,"formTitle":"[面试题 01.07]旋转矩阵","frequency":54.00968496755861,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219965955139117,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[面试题 01.08]零矩阵","frequency":41.4533539470012,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5514409119875381,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 01.09]字符串轮转","frequency":29.771219133044468,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6839368388092416,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[面试题 02.01]移除重复节点","frequency":47.83180085519276,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.780347390870203,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":58.645171140667976,"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.853996508320209,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[面试题 02.03]删除中间节点","frequency":61.59414518357179,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6569656748082467,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[面试题 02.04]分割链表","frequency":47.21264610252666,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4664973679337619,"acs":0,"articleLive":2,"columnArticles":505,"formTitle":"[面试题 02.05]链表求和","frequency":73.42499810475532,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48337948354691224,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[面试题 02.06]回文链表","frequency":32.189666716451356,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6864176597114282,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 02.07]链表相交","frequency":27.876354625024913,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5314632606082829,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 02.08]环路检测","frequency":49.81605168619866,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5422888169572935,"acs":0,"articleLive":2,"columnArticles":166,"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.6134065227604283,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.41774720360198,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38682676498430574,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 03.03]堆盘子","frequency":29.11716714389944,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7120328023970982,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 03.04]化栈为队","frequency":35.757805382622024,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5446485368956743,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.05]栈排序","frequency":16.183442713396072,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5891131568414432,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.06]动物收容所","frequency":34.11174318737981,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.534586778178568,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.01]节点间通路","frequency":34.11174318737981,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7895107687248984,"acs":0,"articleLive":2,"columnArticles":409,"formTitle":"[面试题 04.02]最小高度树","frequency":47.21264610252666,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8051489670922869,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":35.757805382622024,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5840310246094741,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 04.04]检查平衡性","frequency":17.431734517438745,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3512490320360226,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":38.392431737912304,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5908531330789117,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 04.06]后继者","frequency":17.431734517438745,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168723538419962,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.771219133044468,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47846532805852054,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":24.937244926792673,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7177088613427952,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[面试题 04.10]检查子树","frequency":6.126293813912077,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48849659962378816,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.12]求和路径","frequency":34.11174318737981,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5066185996732947,"acs":0,"articleLive":2,"columnArticles":171,"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.6876574307304786,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":17.431734517438745,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3903091444075051,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 05.03]翻转数位","frequency":38.392431737912304,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3934947989442633,"acs":0,"articleLive":2,"columnArticles":132,"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.5273526077097506,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 05.06]整数转换","frequency":5.018255598477773,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7034359204043765,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":16.183442713396072,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5537855148628674,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":23.63396138377883,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36374125812531927,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[面试题 08.01]三步问题","frequency":45.29850824883108,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.361361237036577,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 08.02]迷路的机器人","frequency":36.38268815024056,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6767928812843261,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":5.5605738976163455,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8228681219851198,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.04]幂集","frequency":40.08097302202694,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6798026294002716,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[面试题 08.05]递归乘法","frequency":5.5605738976163455,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6564169193012849,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":53.90595227255533,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133197603852629,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":37.02908617571276,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7184312663597797,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":45.09699522101154,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8117728906582151,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.09]括号","frequency":63.21408872240231,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5593169944357134,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 08.10]颜色填充","frequency":16.183442713396072,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4945439510949013,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":45.09699522101154,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7599943160287987,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 08.12]八皇后","frequency":46.55349485552583,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5005023572146224,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":17.431734517438745,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5358200915701589,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.55425556551245,"acs":0,"articleLive":2,"columnArticles":2360,"formTitle":"[面试题 10.01]合并排序的数组","frequency":71.98173390257003,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7393216757584251,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":60.912645678109975,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3963843958135109,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":59.809917236862134,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534018047969603,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.27337559962882,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4563248080910976,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":43.41774720360198,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6306670516892867,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":7.3352351801640365,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6668183058866345,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":42.08612690382681,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8330418992534804,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[面试题 16.01]交换数字","frequency":29.771219133044468,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7659252043080587,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.02]单词频率","frequency":6.126293813912077,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44332587621178227,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":7.982643366845061,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46074747874233735,"acs":0,"articleLive":2,"columnArticles":152,"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.46423637416997193,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":29.771219133044468,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4242550386790162,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 16.06]最小差","frequency":34.79947650804195,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.733102253032929,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 16.07]最大数值","frequency":43.41774720360198,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3758480325644505,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":7.982643366845061,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.548353371667538,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6842796873919358,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.10]生存人数","frequency":16.7954628814756,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409534607685085,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[面试题 16.11]跳水板","frequency":23.63396138377883,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4327458256029685,"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.5503280524883981,"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.5029891462069767,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.126293813912077,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4520444458434323,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.16]部分排序","frequency":34.79947650804195,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.600903882424113,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[面试题 16.17]连续数列","frequency":40.754859727265256,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3442465314345895,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 16.18]模式匹配","frequency":34.79947650804195,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6099600368890256,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[面试题 16.19]水域大小","frequency":47.21264610252666,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7203983458519706,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[面试题 16.20]T9键盘","frequency":34.11174318737981,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4661734693877551,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":5.5605738976163455,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.581909767849321,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.982643366845061,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4718287550346201,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.24]数对和","frequency":24.27337559962882,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5446163266041167,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.99099340364926,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.387121864496236,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.26]计算器","frequency":59.36011642423902,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.597552993303459,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":16.7954628814756,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6449070525105405,"acs":0,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 17.04]消失的数字","frequency":37.02908617571276,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38716096698113206,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.431734517438745,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4488032575230907,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.5605738976163455,"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.4113571393962886,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 17.07]婴儿名字","frequency":34.11174318737981,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27209693705822957,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":40.754859727265256,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5503339404978749,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[面试题 17.09]第 k 个数","frequency":52.507913391402326,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5711846133942817,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 17.10]主要元素","frequency":59.809917236862134,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6867604810829235,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 17.11]单词距离","frequency":34.79947650804195,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6317829457364341,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":5.5605738976163455,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530774471950942,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":29.771219133044468,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.598519814086058,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[面试题 17.14]最小K个数","frequency":47.939168027777924,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.402266695359013,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.15]最长单词","frequency":31.154717435598055,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5191193410647935,"acs":0,"articleLive":2,"columnArticles":1127,"formTitle":"[面试题 17.16]按摩师","frequency":50.88870073928404,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4424975176683605,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.17]多次搜索","frequency":16.183442713396072,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44562776672868415,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.18]最短超串","frequency":24.937244926792673,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5819067501739735,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":34.79947650804195,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5720775287704422,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":16.7954628814756,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.635674202108377,"acs":0,"articleLive":2,"columnArticles":532,"formTitle":"[面试题 17.21]直方图的水量","frequency":88.2656324730788,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3714160070360598,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.08097302202694,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3797267518730718,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.23]最大黑方阵","frequency":5.5605738976163455,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5177301142487605,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.24]最大子矩阵","frequency":73.684259658545,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.49213161659513593,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":27.876354625024913,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3413223140495868,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.7954628814756,"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.42789730913993596,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[502]IPO","frequency":29.771219133044468,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.5196206386496128,"acs":0,"articleLive":2,"columnArticles":13960,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4082300523084888,"acs":0,"articleLive":2,"columnArticles":7000,"formTitle":"[2]两数相加","frequency":99.27463906942954,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37946216938391675,"acs":0,"articleLive":2,"columnArticles":7207,"formTitle":"[3]无重复字符的最长子串","frequency":96.9203360351677,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4077630176301763,"acs":0,"articleLive":2,"columnArticles":3708,"formTitle":"[4]寻找两个正序数组的中位数","frequency":94.73959529949452,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3532358823369451,"acs":0,"articleLive":2,"columnArticles":3877,"formTitle":"[5]最长回文子串","frequency":97.82391720828862,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5064705650543226,"acs":0,"articleLive":2,"columnArticles":2388,"formTitle":"[6]Z 字形变换","frequency":79.44968489477911,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3535731684093036,"acs":0,"articleLive":2,"columnArticles":5152,"formTitle":"[7]整数反转","frequency":98.54927813885908,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21710591668915094,"acs":0,"articleLive":2,"columnArticles":2629,"formTitle":"[8]字符串转换整数 (atoi)","frequency":69.94099560939304,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5852517652118293,"acs":0,"articleLive":2,"columnArticles":4813,"formTitle":"[9]回文数","frequency":79.85740808504671,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31649967065261453,"acs":0,"articleLive":2,"columnArticles":1218,"formTitle":"[10]正则表达式匹配","frequency":86.75214884853298,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6307117219094058,"acs":0,"articleLive":2,"columnArticles":2935,"formTitle":"[11]盛最多水的容器","frequency":86.57388042621189,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6653660237602809,"acs":0,"articleLive":2,"columnArticles":1728,"formTitle":"[12]整数转罗马数字","frequency":75.80172398777341,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6329701119932465,"acs":0,"articleLive":2,"columnArticles":3791,"formTitle":"[13]罗马数字转整数","frequency":82.45529102111982,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4077679212653232,"acs":0,"articleLive":2,"columnArticles":3790,"formTitle":"[14]最长公共前缀","frequency":89.56210296936796,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33386805367757466,"acs":0,"articleLive":2,"columnArticles":2979,"formTitle":"[15]三数之和","frequency":95.70095210060153,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45955303288743077,"acs":0,"articleLive":2,"columnArticles":1392,"formTitle":"[16]最接近的三数之和","frequency":83.28523414071563,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.572113981065714,"acs":0,"articleLive":2,"columnArticles":2986,"formTitle":"[17]电话号码的字母组合","frequency":74.0545175207128,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4010075247406612,"acs":0,"articleLive":2,"columnArticles":1474,"formTitle":"[18]四数之和","frequency":67.15031791128484,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42836797772447505,"acs":0,"articleLive":2,"columnArticles":3728,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":75.22648535882391,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4449248454199939,"acs":0,"articleLive":2,"columnArticles":5415,"formTitle":"[20]有效的括号","frequency":92.40071213107535,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6671604928720765,"acs":0,"articleLive":2,"columnArticles":3358,"formTitle":"[21]合并两个有序链表","frequency":86.31840353549384,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724537400700815,"acs":0,"articleLive":2,"columnArticles":2563,"formTitle":"[22]括号生成","frequency":91.66625165587287,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.558907508662478,"acs":0,"articleLive":2,"columnArticles":2045,"formTitle":"[23]合并K个升序链表","frequency":81.50285603180713,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7029861740188678,"acs":0,"articleLive":2,"columnArticles":2446,"formTitle":"[24]两两交换链表中的节点","frequency":60.99725360452004,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6566243312343165,"acs":0,"articleLive":2,"columnArticles":2116,"formTitle":"[25]K 个一组翻转链表","frequency":89.24214331639038,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5401410765648541,"acs":0,"articleLive":2,"columnArticles":4412,"formTitle":"[26]删除有序数组中的重复项","frequency":80.14340493194885,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5981836502852889,"acs":0,"articleLive":2,"columnArticles":3967,"formTitle":"[27]移除元素","frequency":74.34086178206253,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40699398786866464,"acs":0,"articleLive":2,"columnArticles":3156,"formTitle":"[28]实现 strStr()","frequency":71.6819981451233,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2075416465534121,"acs":0,"articleLive":2,"columnArticles":870,"formTitle":"[29]两数相除","frequency":66.19760945911813,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3564239685676252,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[30]串联所有单词的子串","frequency":54.24972677169939,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37326133466983547,"acs":0,"articleLive":2,"columnArticles":1689,"formTitle":"[31]下一个排列","frequency":81.20882746761659,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35614593229059277,"acs":0,"articleLive":2,"columnArticles":1268,"formTitle":"[32]最长有效括号","frequency":74.77575227891113,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4262516555010972,"acs":0,"articleLive":2,"columnArticles":2331,"formTitle":"[33]搜索旋转排序数组","frequency":71.31942122678112,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4243012281835811,"acs":0,"articleLive":2,"columnArticles":3165,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.56461578061828,"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.46533605380546195,"acs":0,"articleLive":2,"columnArticles":3802,"formTitle":"[35]搜索插入位置","frequency":73.1751495265567,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6282906129353306,"acs":0,"articleLive":2,"columnArticles":1130,"formTitle":"[36]有效的数独","frequency":52.77214370728621,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706703546352412,"acs":0,"articleLive":2,"columnArticles":826,"formTitle":"[37]解数独","frequency":65.15766895372907,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5798481636003009,"acs":0,"articleLive":2,"columnArticles":2237,"formTitle":"[38]外观数列","frequency":65.15766895372907,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7271861281234414,"acs":0,"articleLive":2,"columnArticles":1886,"formTitle":"[39]组合总和","frequency":71.05745497848979,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6266553831444851,"acs":0,"articleLive":2,"columnArticles":1350,"formTitle":"[40]组合总和 II","frequency":71.34999021368358,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41912278452194346,"acs":0,"articleLive":2,"columnArticles":1384,"formTitle":"[41]缺失的第一个正数","frequency":87.4690808328411,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.576706189347673,"acs":0,"articleLive":2,"columnArticles":2369,"formTitle":"[42]接雨水","frequency":95.16553058900486,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4489533761883598,"acs":0,"articleLive":2,"columnArticles":1110,"formTitle":"[43]字符串相乘","frequency":80.59928036825728,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32803749453866626,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[44]通配符匹配","frequency":60.31844529881909,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4265806323879462,"acs":0,"articleLive":2,"columnArticles":1547,"formTitle":"[45]跳跃游戏 II","frequency":96.22957532100939,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7825621036754294,"acs":0,"articleLive":2,"columnArticles":2607,"formTitle":"[46]全排列","frequency":93.0460450446726,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6368210889544701,"acs":0,"articleLive":2,"columnArticles":1435,"formTitle":"[47]全排列 II","frequency":66.09988371634661,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352742532132486,"acs":0,"articleLive":2,"columnArticles":1821,"formTitle":"[48]旋转图像","frequency":72.30511505440981,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6644547711726361,"acs":0,"articleLive":2,"columnArticles":1275,"formTitle":"[49]字母异位词分组","frequency":68.39261910635852,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767707951728381,"acs":0,"articleLive":2,"columnArticles":1255,"formTitle":"[50]Pow(x, n)","frequency":66.58913841032383,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7393833480202382,"acs":0,"articleLive":2,"columnArticles":1503,"formTitle":"[51]N 皇后","frequency":67.51292783323733,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.823317539852973,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[52]N皇后 II","frequency":28.48603299997492,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5516696647421231,"acs":0,"articleLive":2,"columnArticles":3652,"formTitle":"[53]最大子序和","frequency":78.93185894496196,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4799123790648551,"acs":0,"articleLive":2,"columnArticles":1949,"formTitle":"[54]螺旋矩阵","frequency":86.925376033259,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43230168031128924,"acs":0,"articleLive":2,"columnArticles":2405,"formTitle":"[55]跳跃游戏","frequency":74.4857724315505,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.467380185793315,"acs":0,"articleLive":2,"columnArticles":2243,"formTitle":"[56]合并区间","frequency":84.01059507128609,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4107424730321089,"acs":0,"articleLive":2,"columnArticles":909,"formTitle":"[57]插入区间","frequency":37.60137052337985,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35451584846681533,"acs":0,"articleLive":2,"columnArticles":2341,"formTitle":"[58]最后一个单词的长度","frequency":54.312436076429634,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7927413817673045,"acs":0,"articleLive":2,"columnArticles":1520,"formTitle":"[59]螺旋矩阵 II","frequency":79.04562476175751,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233998236655089,"acs":0,"articleLive":2,"columnArticles":928,"formTitle":"[60]排列序列","frequency":43.18932526293026,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41797859215624944,"acs":0,"articleLive":2,"columnArticles":1955,"formTitle":"[61]旋转链表","frequency":68.97015961284075,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6607025913477177,"acs":0,"articleLive":2,"columnArticles":2364,"formTitle":"[62]不同路径","frequency":67.56302368465924,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39033020175915345,"acs":0,"articleLive":2,"columnArticles":1666,"formTitle":"[63]不同路径 II","frequency":70.19584609026657,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6879770942098082,"acs":0,"articleLive":2,"columnArticles":2029,"formTitle":"[64]最小路径和","frequency":73.092148470307,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2691885672259687,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[65]有效数字","frequency":43.804556856982224,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45835293800430066,"acs":0,"articleLive":2,"columnArticles":3096,"formTitle":"[66]加一","frequency":63.26866034486089,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.543663084612434,"acs":0,"articleLive":2,"columnArticles":1743,"formTitle":"[67]二进制求和","frequency":54.85360516522901,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.4709395763870565,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[68]文本左右对齐","frequency":45.91589140570294,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3928305549534947,"acs":0,"articleLive":2,"columnArticles":1890,"formTitle":"[69]x 的平方根","frequency":79.28361977991985,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5285169830866767,"acs":0,"articleLive":2,"columnArticles":3473,"formTitle":"[70]爬楼梯","frequency":93.01409153565463,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42125623349956,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[71]简化路径","frequency":58.451020101829,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6131886271982855,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[72]编辑距离","frequency":92.94201541859753,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6022756112004061,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[73]矩阵置零","frequency":54.24972677169939,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45934593039526267,"acs":0,"articleLive":2,"columnArticles":1649,"formTitle":"[74]搜索二维矩阵","frequency":75.33332405294894,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5944284152654822,"acs":0,"articleLive":2,"columnArticles":1802,"formTitle":"[75]颜色分类","frequency":49.087347621680536,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4247562170932019,"acs":0,"articleLive":2,"columnArticles":1217,"formTitle":"[76]最小覆盖子串","frequency":76.29539606454848,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.770139564127121,"acs":0,"articleLive":2,"columnArticles":1229,"formTitle":"[77]组合","frequency":73.73090542449428,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8007474153868126,"acs":0,"articleLive":2,"columnArticles":1988,"formTitle":"[78]子集","frequency":71.87280854956579,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4575875271548127,"acs":0,"articleLive":2,"columnArticles":1357,"formTitle":"[79]单词搜索","frequency":72.64912933555247,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.61637697134136,"acs":0,"articleLive":2,"columnArticles":1306,"formTitle":"[80]删除有序数组中的重复项 II","frequency":68.19721907712427,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4158497235752307,"acs":0,"articleLive":2,"columnArticles":970,"formTitle":"[81]搜索旋转排序数组 II","frequency":71.34999021368358,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5295938104448743,"acs":0,"articleLive":2,"columnArticles":1643,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":80.99359190182246,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386492869342743,"acs":0,"articleLive":2,"columnArticles":1883,"formTitle":"[83]删除排序链表中的重复元素","frequency":70.0057605584441,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4329917484117518,"acs":0,"articleLive":2,"columnArticles":1125,"formTitle":"[84]柱状图中最大的矩形","frequency":75.60754989719504,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5161225411017387,"acs":0,"articleLive":2,"columnArticles":668,"formTitle":"[85]最大矩形","frequency":59.70973951936234,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6321437066188077,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[86]分隔链表","frequency":57.081406529966074,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48822160480634513,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[87]扰乱字符串","frequency":67.98674060709189,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5156899032090433,"acs":0,"articleLive":2,"columnArticles":3140,"formTitle":"[88]合并两个有序数组","frequency":97.09855627771815,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7097785543452668,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[89]格雷编码","frequency":45.91589140570294,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336500801350441,"acs":0,"articleLive":2,"columnArticles":1177,"formTitle":"[90]子集 II","frequency":72.81224872615874,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3054932013288933,"acs":0,"articleLive":2,"columnArticles":1484,"formTitle":"[91]解码方法","frequency":70.12665177145549,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5476366757873277,"acs":0,"articleLive":2,"columnArticles":1977,"formTitle":"[92]反转链表 II","frequency":87.22461399739058,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5380811800038682,"acs":0,"articleLive":2,"columnArticles":1289,"formTitle":"[93]复原 IP 地址","frequency":82.17108604329304,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559552373724974,"acs":0,"articleLive":2,"columnArticles":2225,"formTitle":"[94]二叉树的中序遍历","frequency":60.8190526578316,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.700261358347356,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[95]不同的二叉搜索树 II","frequency":61.26755201022692,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993231938824223,"acs":0,"articleLive":2,"columnArticles":1245,"formTitle":"[96]不同的二叉搜索树","frequency":65.55399242074793,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4573775549556498,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[97]交错字符串","frequency":44.440004346103564,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.349038973936005,"acs":0,"articleLive":2,"columnArticles":1872,"formTitle":"[98]验证二叉搜索树","frequency":73.57408880957361,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6131045241809673,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[99]恢复二叉搜索树","frequency":54.785148283296095,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6036484369356916,"acs":0,"articleLive":2,"columnArticles":1835,"formTitle":"[100]相同的树","frequency":56.35511387858786,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5620170818384604,"acs":0,"articleLive":2,"columnArticles":2192,"formTitle":"[101]对称二叉树","frequency":73.30726334109073,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.642082382276942,"acs":0,"articleLive":2,"columnArticles":2424,"formTitle":"[102]二叉树的层序遍历","frequency":86.0957451951369,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716820799870204,"acs":0,"articleLive":2,"columnArticles":1543,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":79.87191363560451,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7660379675901404,"acs":0,"articleLive":2,"columnArticles":2479,"formTitle":"[104]二叉树的最大深度","frequency":76.71950754501107,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7039619475287527,"acs":0,"articleLive":2,"columnArticles":1393,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.90446325276024,"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.721331414097457,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":72.3804766622097,"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.6957742677022744,"acs":0,"articleLive":2,"columnArticles":1280,"formTitle":"[107]二叉树的层序遍历 II","frequency":60.94617764811285,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7599225832739126,"acs":0,"articleLive":2,"columnArticles":1159,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.38981146471504,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7633992678857503,"acs":0,"articleLive":2,"columnArticles":709,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.287582662412085,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5627874599109962,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[110]平衡二叉树","frequency":62.78084792145688,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48479901005642306,"acs":0,"articleLive":2,"columnArticles":1737,"formTitle":"[111]二叉树的最小深度","frequency":43.18932526293026,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5256960293959243,"acs":0,"articleLive":2,"columnArticles":1614,"formTitle":"[112]路径总和","frequency":61.26755201022692,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6266403222350151,"acs":0,"articleLive":2,"columnArticles":1205,"formTitle":"[113]路径总和 II","frequency":63.3463712658148,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7254177146583335,"acs":0,"articleLive":2,"columnArticles":1283,"formTitle":"[114]二叉树展开为链表","frequency":44.79100183010633,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5234250635427385,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[115]不同的子序列","frequency":63.87889911414967,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.702824002157999,"acs":0,"articleLive":2,"columnArticles":1133,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":46.12611622495805,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6110836464306901,"acs":0,"articleLive":2,"columnArticles":732,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":28.362425163178255,"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.7270992835785235,"acs":0,"articleLive":2,"columnArticles":1683,"formTitle":"[118]杨辉三角","frequency":73.39487343532683,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6640216964225819,"acs":0,"articleLive":2,"columnArticles":1177,"formTitle":"[119]杨辉三角 II","frequency":55.409905402038326,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6794798323153978,"acs":0,"articleLive":2,"columnArticles":1531,"formTitle":"[120]三角形最小路径和","frequency":52.46577469520965,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733778213521405,"acs":0,"articleLive":2,"columnArticles":3300,"formTitle":"[121]买卖股票的最佳时机","frequency":84.82641245270685,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6879035490734174,"acs":0,"articleLive":2,"columnArticles":2571,"formTitle":"[122]买卖股票的最佳时机 II","frequency":66.82774247538966,"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.5345391917933626,"acs":0,"articleLive":2,"columnArticles":802,"formTitle":"[123]买卖股票的最佳时机 III","frequency":62.5685429895862,"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.44363981940709374,"acs":0,"articleLive":2,"columnArticles":1069,"formTitle":"[124]二叉树中的最大路径和","frequency":81.64947957118645,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47371879566968184,"acs":0,"articleLive":2,"columnArticles":1800,"formTitle":"[125]验证回文串","frequency":66.82774247538966,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3938722535379536,"acs":0,"articleLive":2,"columnArticles":321,"formTitle":"[126]单词接龙 II","frequency":37.69846188927235,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4673079297465815,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[127]单词接龙","frequency":50.58020098113215,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433037066122716,"acs":0,"articleLive":2,"columnArticles":1065,"formTitle":"[128]最长连续序列","frequency":77.23169885610702,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6807813594954449,"acs":0,"articleLive":2,"columnArticles":1089,"formTitle":"[129]求根节点到叶节点数字之和","frequency":60.99725360452004,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44328138740836476,"acs":0,"articleLive":2,"columnArticles":1140,"formTitle":"[130]被围绕的区域","frequency":53.69407610664481,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7232651104185367,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[131]分割回文串","frequency":74.41827359077716,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923336942991023,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[132]分割回文串 II","frequency":45.09699522101154,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6752759109100069,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[133]克隆图","frequency":16.183442713396072,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5763237217767161,"acs":0,"articleLive":2,"columnArticles":948,"formTitle":"[134]加油站","frequency":74.72506003312003,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48665359291172167,"acs":0,"articleLive":2,"columnArticles":763,"formTitle":"[135]分发糖果","frequency":85.78562898581812,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7194514923205051,"acs":0,"articleLive":2,"columnArticles":2201,"formTitle":"[136]只出现一次的数字","frequency":74.5400472294296,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7196148865656573,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[137]只出现一次的数字 II","frequency":73.30726334109073,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6595766444439096,"acs":0,"articleLive":2,"columnArticles":846,"formTitle":"[138]复制带随机指针的链表","frequency":68.93357777311871,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5134699529216283,"acs":0,"articleLive":2,"columnArticles":1169,"formTitle":"[139]单词拆分","frequency":76.54592369117523,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4847039979139699,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[140]单词拆分 II","frequency":41.4533539470012,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.512494095204855,"acs":0,"articleLive":2,"columnArticles":2658,"formTitle":"[141]环形链表","frequency":74.38643316657867,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5519960771519197,"acs":0,"articleLive":2,"columnArticles":1662,"formTitle":"[142]环形链表 II","frequency":69.56461578061828,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6181537292642776,"acs":0,"articleLive":2,"columnArticles":1052,"formTitle":"[143]重排链表","frequency":90.03296290838603,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.702729958776384,"acs":0,"articleLive":2,"columnArticles":1785,"formTitle":"[144]二叉树的前序遍历","frequency":50.444624228960755,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7494023398750029,"acs":0,"articleLive":2,"columnArticles":1502,"formTitle":"[145]二叉树的后序遍历","frequency":68.18184885033645,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5266911681874508,"acs":0,"articleLive":2,"columnArticles":1349,"formTitle":"[146]LRU 缓存机制","frequency":92.1109115589459,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6810040082391583,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[147]对链表进行插入排序","frequency":44.11967361024707,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670593008493986,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[148]排序链表","frequency":77.41132029011523,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3378335274351119,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[149]直线上最多的点数","frequency":66.63175827085747,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362869600932637,"acs":0,"articleLive":2,"columnArticles":1022,"formTitle":"[150]逆波兰表达式求值","frequency":68.93357777311871,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48084018801410106,"acs":0,"articleLive":2,"columnArticles":1389,"formTitle":"[151]翻转字符串里的单词","frequency":54.882499728525005,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4207511850990298,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[152]乘积最大子数组","frequency":76.74762822359588,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5660117210489813,"acs":0,"articleLive":2,"columnArticles":1446,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":55.9516563579218,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5318840510144817,"acs":0,"articleLive":2,"columnArticles":876,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":64.3225951485854,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5730250331755108,"acs":0,"articleLive":2,"columnArticles":1563,"formTitle":"[155]最小栈","frequency":71.25201024667808,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7249681676119921,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[156]上下翻转二叉树","frequency":16.7954628814756,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5308253903873453,"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.59,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.717188864301861,"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.5427412344248044,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":39.112788599468395,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6127070268759642,"acs":0,"articleLive":2,"columnArticles":1911,"formTitle":"[160]相交链表","frequency":68.3461907936223,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3361464018713021,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":5.5605738976163455,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49462603922769716,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[162]寻找峰值","frequency":57.444451527870335,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32366953502973,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[163]缺失的区间","frequency":17.431734517438745,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6107323949588672,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[164]最大间距","frequency":56.09864490080408,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5181717888100866,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[165]比较版本号","frequency":55.409905402038326,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2986275926117016,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[166]分数到小数","frequency":50.22628216013047,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865952114934257,"acs":0,"articleLive":2,"columnArticles":1832,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":62.78084792145688,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325683152071018,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[168]Excel表列名称","frequency":59.95101147462879,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646763784210853,"acs":0,"articleLive":2,"columnArticles":2121,"formTitle":"[169]多数元素","frequency":70.45669660580673,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4161966156325544,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.018255598477773,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174290005461497,"acs":0,"articleLive":2,"columnArticles":897,"formTitle":"[171]Excel 表列序号","frequency":48.96477832790934,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43814035365322995,"acs":0,"articleLive":2,"columnArticles":582,"formTitle":"[172]阶乘后的零","frequency":44.7001368019501,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.803364844678508,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[173]二叉搜索树迭代器","frequency":48.36315695657654,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.47961633774604845,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[174]地下城游戏","frequency":62.956231017328946,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7399517725103308,"acs":0,"articleLive":2,"columnArticles":1439,"formTitle":"[175]组合两个表","frequency":93.01409153565463,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35615835968646187,"acs":0,"articleLive":2,"columnArticles":990,"formTitle":"[176]第二高的薪水","frequency":93.1288942313645,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4625169107151509,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[177]第N高的薪水","frequency":76.75850340740806,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6027468824608054,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[178]分数排名","frequency":66.99914322077328,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4099366773538862,"acs":0,"articleLive":2,"columnArticles":942,"formTitle":"[179]最大数","frequency":82.2466970476615,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48720509371770965,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[180]连续出现的数字","frequency":70.21589154857165,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7028349473141552,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[181]超过经理收入的员工","frequency":70.11166040006901,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7973890315730245,"acs":0,"articleLive":2,"columnArticles":559,"formTitle":"[182]查找重复的电子邮箱","frequency":60.97392022076764,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6774075021511128,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[183]从不订购的客户","frequency":46.612506335453844,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47498454356796754,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[184]部门工资最高的员工","frequency":73.62580435731155,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49390314378178457,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[185]部门工资前三高的所有员工","frequency":73.42499810475532,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7538287593791757,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.126293813912077,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48321631911697926,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[187]重复的DNA序列","frequency":31.59112236575192,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38999012921751613,"acs":0,"articleLive":2,"columnArticles":675,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":49.977320218435665,"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.45245275293193266,"acs":0,"articleLive":2,"columnArticles":1628,"formTitle":"[189]旋转数组","frequency":63.097644481530764,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6964019332895758,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[190]颠倒二进制位","frequency":48.194601299975886,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7477310172857609,"acs":0,"articleLive":2,"columnArticles":1175,"formTitle":"[191]位1的个数","frequency":60.97392022076764,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35599671367012625,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[192]统计词频","frequency":56.09864490080408,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3242426934351959,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[193]有效电话号码","frequency":36.38268815024056,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34510702318265746,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[194]转置文件","frequency":29.11716714389944,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4365150945759739,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[195]第十行","frequency":52.507913391402326,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.665278349680372,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[196]删除重复的电子邮箱","frequency":58.451020101829,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339345899752916,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[197]上升的温度","frequency":56.64186027511783,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.512813702811267,"acs":0,"articleLive":2,"columnArticles":2578,"formTitle":"[198]打家劫舍","frequency":78.10875193978319,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524391997469252,"acs":0,"articleLive":2,"columnArticles":1539,"formTitle":"[199]二叉树的右视图","frequency":84.1049361392743,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5531823610376602,"acs":0,"articleLive":2,"columnArticles":2059,"formTitle":"[200]岛屿数量","frequency":89.44694254754734,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5228629088829173,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[201]数字范围按位与","frequency":37.02908617571276,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6183205819452393,"acs":0,"articleLive":2,"columnArticles":1341,"formTitle":"[202]快乐数","frequency":62.175072331320315,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5140947098269725,"acs":0,"articleLive":2,"columnArticles":1598,"formTitle":"[203]移除链表元素","frequency":56.40126087006008,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37899278988654067,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[204]计数质数","frequency":53.59160062730145,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5009198221677142,"acs":0,"articleLive":2,"columnArticles":855,"formTitle":"[205]同构字符串","frequency":50.88870073928404,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7227027897154791,"acs":0,"articleLive":2,"columnArticles":7241,"formTitle":"[206]反转链表","frequency":92.39691574212195,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.544690117785443,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[207]课程表","frequency":70.14248800485817,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7164152206374543,"acs":0,"articleLive":2,"columnArticles":938,"formTitle":"[208]实现 Trie (前缀树)","frequency":68.869403694828,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.470138404502937,"acs":0,"articleLive":2,"columnArticles":1312,"formTitle":"[209]长度最小的子数组","frequency":55.924216225811286,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5414753635021826,"acs":0,"articleLive":2,"columnArticles":658,"formTitle":"[210]课程表 II","frequency":48.824296466419774,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48175356661950947,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":31.154717435598055,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4498997995991984,"acs":0,"articleLive":2,"columnArticles":394,"formTitle":"[212]单词搜索 II","frequency":41.4533539470012,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4327723154514017,"acs":0,"articleLive":2,"columnArticles":1465,"formTitle":"[213]打家劫舍 II","frequency":72.11047054698605,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3711073187853261,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[214]最短回文串","frequency":57.55182983125098,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6468402054148727,"acs":0,"articleLive":2,"columnArticles":2224,"formTitle":"[215]数组中的第K个最大元素","frequency":90.302768440328,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7385696179052801,"acs":0,"articleLive":2,"columnArticles":990,"formTitle":"[216]组合总和 III","frequency":66.08304057702925,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5611728560930049,"acs":0,"articleLive":2,"columnArticles":1606,"formTitle":"[217]存在重复元素","frequency":71.84709560263556,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5433375769149162,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[218]天际线问题","frequency":64.19108103575208,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4252130681818182,"acs":0,"articleLive":2,"columnArticles":858,"formTitle":"[219]存在重复元素 II","frequency":49.132108606911764,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28688342685815477,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":60.65841150614939,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47400692677410233,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[221]最大正方形","frequency":73.30726334109073,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7803978039780398,"acs":0,"articleLive":2,"columnArticles":862,"formTitle":"[222]完全二叉树的节点个数","frequency":40.754859727265256,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4617340452580727,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[223]矩形面积","frequency":45.77699202581343,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41795243320581765,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[224]基本计算器","frequency":74.79860495328833,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6756822197837298,"acs":0,"articleLive":2,"columnArticles":4731,"formTitle":"[225]用队列实现栈","frequency":48.7046785344134,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7877808420369908,"acs":0,"articleLive":2,"columnArticles":1806,"formTitle":"[226]翻转二叉树","frequency":73.37057444142592,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43676803361362104,"acs":0,"articleLive":2,"columnArticles":692,"formTitle":"[227]基本计算器 II","frequency":79.04562476175751,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5816041375570895,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[228]汇总区间","frequency":16.183442713396072,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4636260689601312,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[229]求众数 II","frequency":38.800710146713705,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7406717351768324,"acs":0,"articleLive":2,"columnArticles":830,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":40.840790807905634,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.503555544543416,"acs":0,"articleLive":2,"columnArticles":1179,"formTitle":"[231]2 的幂","frequency":45.464951181090974,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6915463861847346,"acs":0,"articleLive":2,"columnArticles":1232,"formTitle":"[232]用栈实现队列","frequency":57.347332850663754,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.476445941737678,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[233]数字 1 的个数","frequency":40.08097302202694,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4939329085876219,"acs":0,"articleLive":2,"columnArticles":1928,"formTitle":"[234]回文链表","frequency":78.040930158621,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6661663091726394,"acs":0,"articleLive":2,"columnArticles":941,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":53.15355586244086,"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.6801121627124573,"acs":0,"articleLive":2,"columnArticles":1339,"formTitle":"[236]二叉树的最近公共祖先","frequency":73.37702389162844,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481757942649445,"acs":0,"articleLive":2,"columnArticles":1003,"formTitle":"[237]删除链表中的节点","frequency":53.785611653509946,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7227272483207062,"acs":0,"articleLive":2,"columnArticles":842,"formTitle":"[238]除自身以外数组的乘积","frequency":56.508539079287225,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4961302189983688,"acs":0,"articleLive":2,"columnArticles":1283,"formTitle":"[239]滑动窗口最大值","frequency":65.82873618149235,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4752157346675595,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[240]搜索二维矩阵 II","frequency":63.83896700169065,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7369401180226371,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[241]为运算表达式设计优先级","frequency":55.409905402038326,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6441843070131562,"acs":0,"articleLive":2,"columnArticles":1620,"formTitle":"[242]有效的字母异位词","frequency":57.081406529966074,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6566130645533584,"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.5473166266163176,"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.6091987695913286,"acs":0,"articleLive":2,"columnArticles":56,"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.4743821579264617,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5221608092606111,"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.4631956912028725,"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.6387216303844372,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6339351240275943,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[250]统计同值子树","frequency":6.126293813912077,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5433932759968726,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":16.183442713396072,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5617668711656442,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[252]会议室","frequency":6.126293813912077,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4979761049813932,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[253]会议室 II","frequency":52.507913391402326,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5694572217111316,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[254]因子的组合","frequency":17.431734517438745,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47228485531754977,"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.6338903781440712,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[256]粉刷房子","frequency":6.717188864301861,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6809737853586812,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[257]二叉树的所有路径","frequency":62.43459535564136,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917986440616924,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[258]各位相加","frequency":47.21264610252666,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5656037203122405,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.018255598477773,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7255435951094357,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[260]只出现一次的数字 III","frequency":51.84422950385802,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49643202709240447,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[261]以图判树","frequency":23.63396138377883,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43721356553620533,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[262]行程和用户","frequency":62.67634598009314,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152445011783189,"acs":0,"articleLive":2,"columnArticles":825,"formTitle":"[263]丑数","frequency":56.72144306952094,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5790520660861693,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[264]丑数 II","frequency":62.26367544289448,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5827239488117002,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[265]粉刷房子 II","frequency":5.5605738976163455,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6714970809007507,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44600431965442766,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.717188864301861,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6236934681865846,"acs":0,"articleLive":2,"columnArticles":1065,"formTitle":"[268]丢失的数字","frequency":32.189666716451356,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33949831109142253,"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.550491668138727,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.7954628814756,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5516198704103672,"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.6452742123687282,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":7.982643366845061,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30902051877661635,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[273]整数转换英文表示","frequency":29.771219133044468,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404692375723797,"acs":0,"articleLive":2,"columnArticles":558,"formTitle":"[274]H 指数","frequency":56.72144306952094,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4626498248202102,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[275]H 指数 II","frequency":32.808377617599525,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4864558218692384,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[276]栅栏涂色","frequency":24.937244926792673,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5694901645925331,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":6.126293813912077,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45493496185184584,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[278]第一个错误的版本","frequency":68.74426008484677,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6310295511883145,"acs":0,"articleLive":2,"columnArticles":1166,"formTitle":"[279]完全平方数","frequency":72.10146245170522,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6863613360323887,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.7954628814756,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7576042646597679,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3887294403355779,"acs":0,"articleLive":2,"columnArticles":70,"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.6390899988446875,"acs":0,"articleLive":2,"columnArticles":3235,"formTitle":"[283]移动零","frequency":75.79152127876134,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7340292582518562,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[284]顶端迭代器","frequency":24.27337559962882,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6356008883770667,"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.5070236850479611,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[286]墙与门","frequency":6.126293813912077,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6618284121843523,"acs":0,"articleLive":2,"columnArticles":1198,"formTitle":"[287]寻找重复数","frequency":61.541532672516006,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42800713557594294,"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.753539234947417,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[289]生命游戏","frequency":16.183442713396072,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45710072646944955,"acs":0,"articleLive":2,"columnArticles":1067,"formTitle":"[290]单词规律","frequency":27.876354625024913,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.532941943900848,"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.6963069755318803,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[292]Nim 游戏","frequency":40.08097302202694,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7104517668107947,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":5.5605738976163455,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5848897863032139,"acs":0,"articleLive":2,"columnArticles":52,"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.5232620410349098,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[295]数据流的中位数","frequency":39.20109709668201,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6208080274623713,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":19.505000983338796,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5584886755265852,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[297]二叉树的序列化与反序列化","frequency":56.571385362260884,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5787916152897657,"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.5037178200132718,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[299]猜数字游戏","frequency":23.017386824306058,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5125056857628498,"acs":0,"articleLive":2,"columnArticles":1928,"formTitle":"[300]最长递增子序列","frequency":78.39746939119182,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220902849182394,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[301]删除无效的括号","frequency":50.22628216013047,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6650535776011062,"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.724613871629726,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":47.89480770437785,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5420162130658236,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":38.800710146713705,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3781302170283806,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":5.5605738976163455,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3374263463677943,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[306]累加数","frequency":40.640882130761085,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5424528301886793,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[307]区域和检索 - 数组可修改","frequency":20.23036191390926,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6056338028169014,"acs":0,"articleLive":2,"columnArticles":41,"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.605837413245817,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":70.59059301383121,"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.37983717677437867,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[310]最小高度树","frequency":45.60475044229772,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7624383684446436,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.431734517438745,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6831016751948555,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[312]戳气球","frequency":51.84422950385802,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6440691609247214,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[313]超级丑数","frequency":53.59160062730145,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5440895788268227,"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.41861664792091263,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":55.409905402038326,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4765826791132195,"acs":0,"articleLive":2,"columnArticles":513,"formTitle":"[316]去除重复字母","frequency":56.571385362260884,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4866738376957093,"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.6833918004323022,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[318]最大单词长度乘积","frequency":6.717188864301861,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5172524917708261,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[319]灯泡开关","frequency":16.7954628814756,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.674081011472723,"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.42569335001381015,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[321]拼接最大数","frequency":31.154717435598055,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4434573960628954,"acs":0,"articleLive":2,"columnArticles":1768,"formTitle":"[322]零钱兑换","frequency":80.23886905191195,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6334184785994642,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[323]无向图中连通分量的数目","frequency":33.44858233523286,"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.37815667213542065,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":39.112788599468395,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5389324774132193,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":32.808377617599525,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48944753207578356,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[326]3的幂","frequency":29.11716714389944,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.423530027750144,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[327]区间和的个数","frequency":40.640882130761085,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6567142342078724,"acs":0,"articleLive":2,"columnArticles":1041,"formTitle":"[328]奇偶链表","frequency":61.26755201022692,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48348814590750505,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[329]矩阵中的最长递增路径","frequency":57.954865421749645,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533989699228865,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":32.808377617599525,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.48017330797821767,"acs":0,"articleLive":2,"columnArticles":496,"formTitle":"[331]验证二叉树的前序序列化","frequency":58.12522309159364,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4492544661696441,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[332]重新安排行程","frequency":50.524625007718235,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4671427093035289,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[333]最大 BST 子树","frequency":18.094047193227674,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4128100182115164,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[334]递增的三元子序列","frequency":16.7954628814756,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36799589690986023,"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.4010136495041534,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[336]回文对","frequency":35.513575061270465,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6085934262890621,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[337]打家劫舍 III","frequency":71.58460158239042,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7871934854214957,"acs":0,"articleLive":2,"columnArticles":1339,"formTitle":"[338]比特位计数","frequency":58.71552876665284,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8094175407275161,"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.4941258986498334,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":30.449805057568714,"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.7270394107241249,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":70.8887326177279,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5156168756575049,"acs":0,"articleLive":2,"columnArticles":756,"formTitle":"[342]4的幂","frequency":48.471179185528726,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6046752681521695,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[343]整数拆分","frequency":66.82774247538966,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7660373170381396,"acs":0,"articleLive":2,"columnArticles":1859,"formTitle":"[344]反转字符串","frequency":64.10387846583967,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5389520854877629,"acs":0,"articleLive":2,"columnArticles":1018,"formTitle":"[345]反转字符串中的元音字母","frequency":28.934571198288612,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7067960009521542,"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.6219522688090147,"acs":0,"articleLive":2,"columnArticles":1439,"formTitle":"[347]前 K 个高频元素","frequency":78.973319206617,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6003335899409803,"acs":0,"articleLive":2,"columnArticles":76,"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.7384943636428292,"acs":0,"articleLive":2,"columnArticles":1454,"formTitle":"[349]两个数组的交集","frequency":65.71143475874568,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5498354359677426,"acs":0,"articleLive":2,"columnArticles":1326,"formTitle":"[350]两个数组的交集 II","frequency":64.72235536850118,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5892757815107353,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":11.551881321512962,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.591963545981773,"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.42449733278621254,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":7.982643366845061,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45171834204739475,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[354]俄罗斯套娃信封问题","frequency":69.56461578061828,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4071202757875673,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[355]设计推特","frequency":34.79947650804195,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35142658315935976,"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.5197792285886093,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[357]计算各个位数不同的数字个数","frequency":44.440004346103564,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3502875192354418,"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.7247403210576016,"acs":0,"articleLive":2,"columnArticles":53,"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.6074517631403858,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5695050946142649,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6937735430977177,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[362]敲击计数器","frequency":5.5605738976163455,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4906427007023639,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":55.409905402038326,"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.7192339038304808,"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.3642835953722931,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[365]水壶问题","frequency":45.91589140570294,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7629684327118331,"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.43962254123288236,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[367]有效的完全平方数","frequency":17.431734517438745,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4590011536350705,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[368]最大整除子集","frequency":69.56461578061828,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6162692847124824,"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.7187951807228916,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":16.7954628814756,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5799095586418759,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[371]两整数之和","frequency":47.89480770437785,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5088556620306499,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":7.3352351801640365,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4237770816447239,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[373]查找和最小的K对数字","frequency":44.84800934009212,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5146984287886467,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[374]猜数字大小","frequency":33.44858233523286,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4684527531843465,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":34.11174318737981,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4625987399661006,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[376]摆动序列","frequency":27.286804992756892,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.50696442771998,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[377]组合总和 Ⅳ","frequency":59.95101147462879,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.638906391928053,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":55.409905402038326,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6446886446886447,"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.502473082606991,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":24.27337559962882,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44247187678749234,"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.6287922625444325,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.27337559962882,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5965767198241594,"acs":0,"articleLive":2,"columnArticles":705,"formTitle":"[383]赎金信","frequency":3.516484022321481,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5768252013153766,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[384]打乱数组","frequency":51.2021012085766,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41512808677590585,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.5605738976163455,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7475120050107871,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[386]字典序排数","frequency":57.41101373667228,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5314952094987728,"acs":0,"articleLive":2,"columnArticles":1153,"formTitle":"[387]字符串中的第一个唯一字符","frequency":63.87889911414967,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5255932357487044,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6921806477004385,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[389]找不同","frequency":23.017386824306058,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4669570543796366,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":34.79947650804195,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35746678335587556,"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.5146892573482521,"acs":0,"articleLive":2,"columnArticles":1541,"formTitle":"[392]判断子序列","frequency":54.785148283296095,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3916129264689988,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":33.44858233523286,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5514933714398902,"acs":0,"articleLive":2,"columnArticles":1261,"formTitle":"[394]字符串解码","frequency":85.24295549328733,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204489291598023,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.09864490080408,"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.42515753756665053,"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.37785784972975717,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[397]整数替换","frequency":23.017386824306058,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.654746302190601,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[398]随机数索引","frequency":37.69846188927235,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5927106470130095,"acs":0,"articleLive":2,"columnArticles":518,"formTitle":"[399]除法求值","frequency":29.771219133044468,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41426089280940925,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":44.11967361024707,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140821924149664,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":46.55349485552583,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.327794158181803,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[402]移掉 K 位数字","frequency":67.4781126523476,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4563139240506329,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[403]青蛙过河","frequency":68.65310156353523,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5822576760987357,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[404]左叶子之和","frequency":54.17941451933008,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5220460981749528,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[405]数字转换为十六进制数","frequency":47.21264610252666,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.736181959267787,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[406]根据身高重建队列","frequency":56.01637072587099,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48375557406772185,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":47.89480770437785,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3259763938201708,"acs":0,"articleLive":2,"columnArticles":79,"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.5558212013832557,"acs":0,"articleLive":2,"columnArticles":1289,"formTitle":"[409]最长回文串","frequency":64.9933255617794,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5625796131172793,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[410]分割数组的最大值","frequency":73.1751495265567,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49743297204791787,"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.673163376166036,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[412]Fizz Buzz","frequency":24.27337559962882,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6870452698024024,"acs":0,"articleLive":2,"columnArticles":892,"formTitle":"[413]等差数列划分","frequency":34.37618070300181,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36452516523554074,"acs":0,"articleLive":2,"columnArticles":825,"formTitle":"[414]第三大的数","frequency":32.808377617599525,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5369646882043576,"acs":0,"articleLive":2,"columnArticles":1048,"formTitle":"[415]字符串相加","frequency":87.54027154250834,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5067319349591515,"acs":0,"articleLive":2,"columnArticles":952,"formTitle":"[416]分割等和子集","frequency":73.79072462836389,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4781407354892658,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[417]太平洋大西洋水流问题","frequency":58.12522309159364,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3594557354460903,"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.756167894905479,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[419]甲板上的战舰","frequency":4.497741382272873,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20642730837241485,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[420]强密码检验器","frequency":20.23036191390926,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223101657185258,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":59.809917236862134,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4271758436944938,"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.5688814598133445,"acs":0,"articleLive":2,"columnArticles":135,"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.5304836942782506,"acs":0,"articleLive":2,"columnArticles":444,"formTitle":"[424]替换后的最长重复字符","frequency":63.67342851566546,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6107216494845361,"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.6686390532544378,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.11716714389944,"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.6129327436327588,"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.6497553438063353,"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.6981875200632146,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[429]N 叉树的层序遍历","frequency":32.808377617599525,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5420582110021842,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[430]扁平化多级双向链表","frequency":30.449805057568714,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.721565059144677,"acs":0,"articleLive":2,"columnArticles":27,"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.37699156513589505,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":20.23036191390926,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5328675218131887,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":5.018255598477773,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3738205338039695,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[434]字符串中的单词数","frequency":24.27337559962882,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5093111220208872,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[435]无重叠区间","frequency":60.06719448195682,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48642861276694255,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":5.018255598477773,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5669108419670218,"acs":0,"articleLive":2,"columnArticles":804,"formTitle":"[437]路径总和 III","frequency":51.4747476279205,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5172153140417184,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[438]找到字符串中所有字母异位词","frequency":47.697465233081225,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5893338866984852,"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.37966710573584,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":69.56461578061828,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4259171520674823,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[441]排列硬币","frequency":16.183442713396072,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6969606377678127,"acs":0,"articleLive":2,"columnArticles":416,"formTitle":"[442]数组中重复的数据","frequency":63.907080619448585,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4770678776953477,"acs":0,"articleLive":2,"columnArticles":686,"formTitle":"[443]压缩字符串","frequency":43.41774720360198,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25013345534965303,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.784393512347606,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5880612102876649,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[445]两数相加 II","frequency":68.84500970248341,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5522258036414321,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":26.591826165111137,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.604290514344792,"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.6477773990944058,"acs":0,"articleLive":2,"columnArticles":1045,"formTitle":"[448]找到所有数组中消失的数字","frequency":59.95101147462879,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.556034159862162,"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.4855478605415107,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.11967361024707,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7114596201013302,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[451]根据字符出现频率排序","frequency":60.94617764811285,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093007215038813,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[452]用最少数量的箭引爆气球","frequency":47.83180085519276,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5545652355845677,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.017386824306058,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6005778572047141,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[454]四数相加 II","frequency":55.409905402038326,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5776751401751402,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[455]分发饼干","frequency":57.6711858649747,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36239813736903376,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[456]132 模式","frequency":73.05206607727231,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43539299898402145,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":52.507913391402326,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6085386182626412,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":17.431734517438745,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5117722659458886,"acs":0,"articleLive":2,"columnArticles":621,"formTitle":"[459]重复的子字符串","frequency":50.88870073928404,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4392343596572643,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[460]LFU 缓存","frequency":62.67634598009314,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.811952124898383,"acs":0,"articleLive":2,"columnArticles":1326,"formTitle":"[461]汉明距离","frequency":58.12522309159364,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6025086123133999,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":37.69846188927235,"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.71462870538415,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[463]岛屿的周长","frequency":37.02908617571276,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3583797770700637,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":37.02908617571276,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5304498269896194,"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.3733606025191534,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[466]统计重复个数","frequency":7.3352351801640365,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44114285714285717,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.431734517438745,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24966940240549107,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[468]验证IP地址","frequency":50.88870073928404,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4352506920947401,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":25.62736124123482,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5465069787728991,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":45.798629822891506,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6153846153846154,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":15.02585801200021,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40368722186904005,"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.42032462655428526,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[473]火柴拼正方形","frequency":40.08097302202694,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6103913483493781,"acs":0,"articleLive":2,"columnArticles":583,"formTitle":"[474]一和零","frequency":63.87889911414967,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3302250219069821,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":29.11716714389944,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7013225014169658,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[476]数字的补数","frequency":5.5605738976163455,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039641162932694,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":47.89480770437785,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43761153054221,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":29.771219133044468,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4142300194931774,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":10.8265203909425,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44835337408200027,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[480]滑动窗口中位数","frequency":41.4533539470012,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5355261850342841,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.5605738976163455,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42608203036483117,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[482]密钥格式化","frequency":15.594060827695694,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5899806576402321,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":33.44858233523286,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6402550091074681,"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.6065906828386258,"acs":0,"articleLive":2,"columnArticles":966,"formTitle":"[485]最大连续 1 的个数","frequency":47.83180085519276,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5870201144218075,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[486]预测赢家","frequency":41.4533539470012,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5754665502564662,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[487]最大连续1的个数 II","frequency":36.38268815024056,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3869364161849711,"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.4816247582205029,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[490]迷宫","frequency":18.094047193227674,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5474401411002924,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[491]递增子序列","frequency":50.22628216013047,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5510393144577616,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[492]构造矩形","frequency":6.126293813912077,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34437330869249555,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":36.25603468707768,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4964578164413909,"acs":0,"articleLive":2,"columnArticles":1006,"formTitle":"[494]目标和","frequency":74.47666380886051,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5424167081054202,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[495]提莫攻击","frequency":29.771219133044468,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.687463197151109,"acs":0,"articleLive":2,"columnArticles":1007,"formTitle":"[496]下一个更大元素 I","frequency":45.91589140570294,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4055207740466705,"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.4631322634200332,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[498]对角线遍历","frequency":52.078712073361345,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3698058950395399,"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.708349173160996,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[500]键盘行","frequency":16.183442713396072,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5117233814313252,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[501]二叉搜索树中的众数","frequency":48.471179185528726,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.6346240646912608,"acs":0,"articleLive":2,"columnArticles":952,"formTitle":"[503]下一个更大元素 II","frequency":52.078712073361345,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5045595290755044,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[504]七进制数","frequency":23.63396138377883,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48388239461565713,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[505]迷宫 II","frequency":18.094047193227674,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5643112455320319,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[506]相对名次","frequency":15.594060827695694,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4104435790955987,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[507]完美数","frequency":16.7954628814756,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6755654606666983,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[508]出现次数最多的子树元素和","frequency":6.126293813912077,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6766849790715372,"acs":0,"articleLive":2,"columnArticles":1410,"formTitle":"[509]斐波那契数","frequency":62.26367544289448,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6091799500672173,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":7.982643366845061,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.733815842380378,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[511]游戏玩法分析 I","frequency":38.392431737912304,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5377373195747732,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[512]游戏玩法分析 II","frequency":5.5605738976163455,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7311715163124449,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[513]找树左下角的值","frequency":5.018255598477773,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5012592496429963,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[514]自由之路","frequency":49.81605168619866,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6435499174192642,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[515]在每个树行中找最大值","frequency":29.771219133044468,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6524394585485874,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[516]最长回文子序列","frequency":35.43710766706429,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4398764258555133,"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.6528121423685035,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[518]零钱兑换 II","frequency":68.51284797492686,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39493248368988015,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":19.505000983338796,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5634795111430625,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[520]检测大写字母","frequency":5.5605738976163455,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7124846687013321,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.183442713396072,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36001745010360997,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.183442713396072,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2743969042233962,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[523]连续的子数组和","frequency":57.954865421749645,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4725602452929622,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":32.65173886821021,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5364368779847618,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[525]连续数组","frequency":68.28271129386266,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7347775175644028,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[526]优美的排列","frequency":35.15311049539493,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5769117212872749,"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.47647543404261933,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[528]按权重随机选择","frequency":24.155349038118242,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464653191701908,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":34.11174318737981,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206270210391704,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":16.7954628814756,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6626898047722343,"acs":0,"articleLive":2,"columnArticles":74,"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.3731151844173664,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.7954628814756,"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.5216528925619834,"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.6755831265508685,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[534]游戏玩法分析 III","frequency":16.183442713396072,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8414594418503638,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[535]TinyURL 的加密与解密","frequency":29.11716714389944,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5346174813737962,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7122913693615437,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":4.497741382272873,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6972324042087498,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":35.934227637035384,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5954844366505918,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[539]最小时间差","frequency":33.44858233523286,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5802307206068268,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[540]有序数组中的单一元素","frequency":43.804556856982224,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6083401471790678,"acs":0,"articleLive":2,"columnArticles":779,"formTitle":"[541]反转字符串 II","frequency":28.331655939689593,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45898051100728204,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[542]01 矩阵","frequency":45.77699202581343,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5499716375120732,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[543]二叉树的直径","frequency":71.77328601872371,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7080037962670042,"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.4167604752970607,"acs":0,"articleLive":2,"columnArticles":77,"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.6308076743890559,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":24.937244926792673,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6182687577480863,"acs":0,"articleLive":2,"columnArticles":1100,"formTitle":"[547]省份数量","frequency":50.621056500657055,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35647621215570224,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":10.8265203909425,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4823952095808383,"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.43954673805420075,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":29.771219133044468,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5671920162487306,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[551]学生出勤记录 I","frequency":20.424146076392923,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5788099826791246,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.693957820014365,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6026274303730951,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":5.5605738976163455,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5015896554435869,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[554]砖墙","frequency":59.809917236862134,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3411875589066918,"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.3255239019431159,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":47.97209243774956,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7454719618403433,"acs":0,"articleLive":2,"columnArticles":1238,"formTitle":"[557]反转字符串中的单词 III","frequency":59.447648777519454,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5033450704225352,"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.7275478448381485,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[559]N 叉树的最大深度","frequency":32.189666716451356,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465887950606088,"acs":0,"articleLive":2,"columnArticles":884,"formTitle":"[560]和为 K 的子数组","frequency":81.22347269184601,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7740256554044581,"acs":0,"articleLive":2,"columnArticles":732,"formTitle":"[561]数组拆分 I","frequency":15.594060827695694,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.462152388078314,"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.605094809423482,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[563]二叉树的坡度","frequency":5.5605738976163455,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17927228975646184,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[564]寻找最近的回文数","frequency":24.937244926792673,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6123771322783973,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[565]数组嵌套","frequency":16.183442713396072,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6948430038140618,"acs":0,"articleLive":2,"columnArticles":610,"formTitle":"[566]重塑矩阵","frequency":29.11716714389944,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.430647720297861,"acs":0,"articleLive":2,"columnArticles":1007,"formTitle":"[567]字符串的排列","frequency":55.409905402038326,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5035492457852706,"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.5636739407938727,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":24.27337559962882,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6628955566486309,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":16.183442713396072,"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.48865183840217885,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":6.126293813912077,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47416298911444543,"acs":0,"articleLive":2,"columnArticles":708,"formTitle":"[572]另一棵树的子树","frequency":48.96477832790934,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6591511936339522,"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.6479732282614562,"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.684584466051802,"acs":0,"articleLive":2,"columnArticles":415,"formTitle":"[575]分糖果","frequency":29.11716714389944,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4697994056463596,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":25.36536994206181,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7057710501419111,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[577]员工奖金","frequency":16.7954628814756,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49779829168656164,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[578]查询回答率最高的问题","frequency":5.5605738976163455,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41345392877331827,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":26.34571948574115,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5247261865250581,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[580]统计各专业学生人数","frequency":16.183442713396072,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40425058651211004,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[581]最短无序连续子数组","frequency":58.645171140667976,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4046418719680396,"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.5856828468214093,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[583]两个字符串的删除操作","frequency":44.440004346103564,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7742799333492025,"acs":0,"articleLive":2,"columnArticles":57,"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.5948217636022514,"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.748974344948307,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[586]订单最多的客户","frequency":24.27337559962882,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3825065274151436,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":10.8265203909425,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4284829721362229,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.661896872488112,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452985699367389,"acs":0,"articleLive":2,"columnArticles":555,"formTitle":"[589]N 叉树的前序遍历","frequency":41.4533539470012,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7599900534626384,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[590]N 叉树的后序遍历","frequency":16.183442713396072,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3399921660791226,"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.5209487117746208,"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.44064906490649064,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[593]有效的正方形","frequency":24.27337559962882,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5168298709618376,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[594]最长和谐子序列","frequency":5.018255598477773,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7962770720574367,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[595]大的国家","frequency":38.800710146713705,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42052969519556416,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[596]超过5名学生的课","frequency":23.017386824306058,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4413802472490151,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.183442713396072,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5177265053460889,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[598]范围求和 II","frequency":16.183442713396072,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220666380773031,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[599]两个列表的最小索引总和","frequency":16.183442713396072,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3425877422734416,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[600]不含连续1的非负整数","frequency":17.431734517438745,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4981656312674265,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[601]体育馆的人流量","frequency":53.344912676000725,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.627733639118683,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.431734517438745,"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.6720722742831491,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[603]连续空余座位","frequency":25.62736124123482,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37246769819747966,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":6.126293813912077,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33480567597540073,"acs":0,"articleLive":2,"columnArticles":1236,"formTitle":"[605]种花问题","frequency":53.344912676000725,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.568580134563079,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[606]根据二叉树创建字符串","frequency":5.018255598477773,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6636825690192908,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.5605738976163455,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6577894928194874,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[608]树节点","frequency":5.5605738976163455,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48406283361293273,"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.6662633595482961,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.5605738976163455,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318933733563901,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[611]有效三角形的个数","frequency":77.89549726765092,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6683229813664596,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[612]平面上的最近距离","frequency":5.5605738976163455,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8164705882352942,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.018255598477773,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34662949138822685,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[614]二级关注者","frequency":16.7954628814756,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42387178405735976,"acs":0,"articleLive":2,"columnArticles":86,"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.45888475836431225,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":34.11174318737981,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881446889415558,"acs":0,"articleLive":2,"columnArticles":1185,"formTitle":"[617]合并二叉树","frequency":63.995402294546054,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.620475113122172,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":17.431734517438745,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4663239296669115,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.5605738976163455,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7729125451940787,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[620]有趣的电影","frequency":36.38268815024056,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5693735742586145,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[621]任务调度器","frequency":62.67634598009314,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4364121396895787,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[622]设计循环队列","frequency":48.60159623618965,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5453249134243227,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[623]在二叉树中增加一行","frequency":6.126293813912077,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41614296936370776,"acs":0,"articleLive":2,"columnArticles":47,"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.340460983060261,"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.682900635039223,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[626]换座位","frequency":42.08612690382681,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.807306290988584,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[627]变更性别","frequency":27.876354625024913,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5252632001391249,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[628]三个数的最大乘积","frequency":33.44858233523286,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40285511795079476,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":24.937244926792673,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36717428087986465,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":7.3352351801640365,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2848567530695771,"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.59677522965247,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[632]最小区间","frequency":16.7954628814756,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39940524887347906,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[633]平方数之和","frequency":62.956231017328946,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43936904370686825,"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.556251821626348,"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.549232995658466,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":5.5605738976163455,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6892743430119279,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[637]二叉树的层平均值","frequency":22.422190473341242,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5930781888635278,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":5.5605738976163455,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3094631073785243,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[639]解码方法 II","frequency":29.771219133044468,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4242083717943573,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[640]求解方程","frequency":23.017386824306058,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5327212745825128,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[641]设计循环双端队列","frequency":22.422190473341242,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4906502337441564,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":8.661896872488112,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4516534540513439,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[643]子数组最大平均数 I","frequency":37.69846188927235,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.39811798769453494,"acs":0,"articleLive":2,"columnArticles":23,"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.4352507517702978,"acs":0,"articleLive":2,"columnArticles":688,"formTitle":"[645]错误的集合","frequency":40.08097302202694,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5753395301492058,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[646]最长数对链","frequency":3.997587297058907,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6562159832464899,"acs":0,"articleLive":2,"columnArticles":888,"formTitle":"[647]回文子串","frequency":58.934573086294726,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5829130065174271,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[648]单词替换","frequency":5.018255598477773,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.481659651232712,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":5.018255598477773,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5353728883395138,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[650]只有两个键的键盘","frequency":16.7954628814756,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5807275047862157,"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.5710655692426669,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[652]寻找重复的子树","frequency":54.00968496755861,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.595864633012845,"acs":0,"articleLive":2,"columnArticles":369,"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.8098073854570321,"acs":0,"articleLive":2,"columnArticles":579,"formTitle":"[654]最大二叉树","frequency":45.09699522101154,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5959328599096191,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.7954628814756,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3071401586701927,"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.7833315652937035,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":5.5605738976163455,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45220869256066126,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[658]找到 K 个最接近的元素","frequency":29.771219133044468,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420501121336324,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.648568608094768,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[660]移除 9","frequency":16.183442713396072,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5600194282542326,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[661]图片平滑器","frequency":5.5605738976163455,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4068350936149784,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[662]二叉树最大宽度","frequency":54.100026915826184,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46199945518932173,"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.6553836912449317,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":54.697477009938645,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27024248010546764,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[665]非递减数列","frequency":47.89480770437785,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6182318751911899,"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.6242053401144311,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":15.594060827695694,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5076111068614702,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[668]乘法表中第k小的数","frequency":34.11174318737981,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.666430296293457,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[669]修剪二叉搜索树","frequency":23.017386824306058,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44990823842924305,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[670]最大交换","frequency":61.628833854903405,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4866830103150007,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[671]二叉树中第二小的节点","frequency":47.21264610252666,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5517241379310345,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.018255598477773,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3913566410627887,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[673]最长递增子序列的个数","frequency":53.785611653509946,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49277580880436167,"acs":0,"articleLive":2,"columnArticles":746,"formTitle":"[674]最长连续递增序列","frequency":31.011536219289525,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40031374786081003,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":7.3352351801640365,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5871889239397126,"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.6157304332933722,"acs":0,"articleLive":2,"columnArticles":237,"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.3517533936651584,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[678]有效的括号字符串","frequency":70.98015101810226,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5413535448962941,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[679]24 点游戏","frequency":69.56461578061828,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40179642149016986,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":48.36315695657654,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.4996989765201686,"acs":0,"articleLive":2,"columnArticles":60,"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.6958738201535538,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":29.11716714389944,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4303361684892669,"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.6658578459425432,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[684]冗余连接","frequency":28.48603299997492,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43278731720170394,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":29.771219133044468,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35506700167504185,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[686]重复叠加字符串匹配","frequency":5.018255598477773,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4402925893924509,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[687]最长同值路径","frequency":50.88870073928404,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5113443734515583,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.7954628814756,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4872508113120074,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.25603468707768,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6467961073762399,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[690]员工的重要性","frequency":64.81619429096602,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4895194638528447,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.126293813912077,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5792764313312259,"acs":0,"articleLive":2,"columnArticles":720,"formTitle":"[692]前K个高频单词","frequency":63.45243883822881,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6099231340245683,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":5.5605738976163455,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5299507658643327,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":6.126293813912077,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6631892125867765,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[695]岛屿的最大面积","frequency":66.40548211712105,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6308220196214449,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[696]计数二进制子串","frequency":16.183442713396072,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.605630287061434,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[697]数组的度","frequency":24.27337559962882,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44385322259765686,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[698]划分为k个相等的子集","frequency":56.09864490080408,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4764342453662842,"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.7591984101999055,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[700]二叉搜索树中的搜索","frequency":23.017386824306058,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7242189687587504,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[701]二叉搜索树中的插入操作","frequency":31.011536219289525,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7398242782858168,"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.5127542586695899,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[703]数据流中的第 K 大元素","frequency":32.808377617599525,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5604499391443566,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[704]二分查找","frequency":66.42566605166846,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6463934082815446,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[705]设计哈希集合","frequency":53.194615449151314,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6446036805248586,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[706]设计哈希映射","frequency":45.09699522101154,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31913326343522325,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[707]设计链表","frequency":58.451020101829,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3363445717051137,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[708]循环有序列表的插入","frequency":6.717188864301861,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7594700260642919,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3501745884700349,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[710]黑名单中的随机数","frequency":25.62736124123482,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5746268656716418,"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.6723662695631861,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":34.11174318737981,"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.4074418064665931,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[713]乘积小于K的子数组","frequency":35.15311049539493,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7184753383492622,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":44.11967361024707,"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.4009811937857727,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":7.3352351801640365,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46032135410278424,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[716]最大栈","frequency":18.094047193227674,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5109850472193075,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[717]1比特与2比特字符","frequency":16.7954628814756,"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.5644443192064923,"acs":0,"articleLive":2,"columnArticles":568,"formTitle":"[718]最长重复子数组","frequency":69.56461578061828,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3682100362131402,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[719]找出第 k 小的距离对","frequency":16.183442713396072,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48600173891442056,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[720]词典中最长的单词","frequency":5.5605738976163455,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46929498305645095,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[721]账户合并","frequency":37.02908617571276,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32271312181228057,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[722]删除注释","frequency":38.392431737912304,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7216138328530259,"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.45854682877378333,"acs":0,"articleLive":2,"columnArticles":838,"formTitle":"[724]寻找数组的中心下标","frequency":33.44858233523286,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5628540950574848,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[725]分隔链表","frequency":16.183442713396072,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5543701799485862,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":50.524625007718235,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40858767205266305,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[727]最小窗口子序列","frequency":30.449805057568714,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7595992184304994,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[728]自除数","frequency":5.5605738976163455,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.509204078929943,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[729]我的日程安排表 I","frequency":24.937244926792673,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48880691935894177,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":39.112788599468395,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5103366021733369,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[731]我的日程安排表 II","frequency":5.5605738976163455,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6102079395085066,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":18.094047193227674,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805800153139357,"acs":0,"articleLive":2,"columnArticles":510,"formTitle":"[733]图像渲染","frequency":40.840790807905634,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47871819960861056,"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.41146493709158294,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[735]行星碰撞","frequency":33.44858233523286,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45979443772672307,"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.46157635467980296,"acs":0,"articleLive":2,"columnArticles":64,"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.5020335631781151,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[738]单调递增的数字","frequency":29.771219133044468,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6785033245724477,"acs":0,"articleLive":2,"columnArticles":1464,"formTitle":"[739]每日温度","frequency":84.07047093379515,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.629755087775896,"acs":0,"articleLive":2,"columnArticles":550,"formTitle":"[740]删除并获得点数","frequency":62.3423813730798,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36581894097551715,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":24.27337559962882,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4921952839588177,"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.5181524083393242,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[743]网络延迟时间","frequency":50.88870073928404,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45901166480137534,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":24.937244926792673,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3919863111364609,"acs":0,"articleLive":2,"columnArticles":53,"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.5827067146004871,"acs":0,"articleLive":2,"columnArticles":1226,"formTitle":"[746]使用最小花费爬楼梯","frequency":49.087347621680536,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41523889121047497,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.5605738976163455,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5992777997625643,"acs":0,"articleLive":2,"columnArticles":167,"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.5058548009367682,"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.7214043035107588,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":22.71720223657227,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5069648093841642,"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.5306940517723403,"acs":0,"articleLive":2,"columnArticles":568,"formTitle":"[752]打开转盘锁","frequency":41.4533539470012,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5902198635329795,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":17.431734517438745,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4284065299840598,"acs":0,"articleLive":2,"columnArticles":87,"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.501779359430605,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.571520123045373,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":7.3352351801640365,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41663741663741666,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":10.101159460372038,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4590818363273453,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[758]字符串中的加粗单词","frequency":12.277242252083424,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6578849721706864,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[759]员工空闲时间","frequency":6.717188864301861,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8392199349945829,"acs":0,"articleLive":2,"columnArticles":89,"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.5894402769763416,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":10.8265203909425,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.698488241881299,"acs":0,"articleLive":2,"columnArticles":137,"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.763034700684651,"acs":0,"articleLive":2,"columnArticles":947,"formTitle":"[763]划分字母区间","frequency":64.842338188506,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4911891558841651,"acs":0,"articleLive":2,"columnArticles":52,"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.6656592895666729,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[765]情侣牵手","frequency":56.09864490080408,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7082112773242719,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.477850752066818,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[767]重构字符串","frequency":36.25603468707768,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.4994773154923688,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":24.937244926792673,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5891813595724489,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[769]最多能完成排序的块","frequency":5.5605738976163455,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5536480686695279,"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.851473400067484,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[771]宝石与石头","frequency":42.08612690382681,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.48986657659179195,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[772]基本计算器 III","frequency":18.784393512347606,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7137592904877896,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":50.524625007718235,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5864022662889519,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4608582332681746,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5686338441473753,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3235710911667454,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.7954628814756,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5966429954809555,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[778]水位上升的泳池中游泳","frequency":6.717188864301861,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43576514532508465,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.11174318737981,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2843978102189781,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":19.505000983338796,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.62025800567789,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[781]森林中的兔子","frequency":91.2306436902954,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42270820850808866,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":32.393600002603414,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958167917757399,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[783]二叉搜索树节点最小距离","frequency":33.44858233523286,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6845005361709148,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[784]字母大小写全排列","frequency":28.48603299997492,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5117446819610554,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[785]判断二分图","frequency":42.08612690382681,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4661852361302155,"acs":0,"articleLive":2,"columnArticles":54,"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.39242286534321935,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[787]K 站中转内最便宜的航班","frequency":33.667008820176356,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6073293206078947,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[788]旋转数字","frequency":18.094047193227674,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6924000400173409,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[789]逃脱阻碍者","frequency":21.135107272050224,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44886769964243145,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[790]多米诺和托米诺平铺","frequency":7.3352351801640365,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6950399195322814,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[791]自定义字符串排序","frequency":34.79947650804195,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4511617900172117,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":15.02585801200021,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39476046682445115,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.5605738976163455,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3407956651932126,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.126293813912077,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5349015241144129,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[795]区间子数组个数","frequency":18.784393512347606,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5261172306187559,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[796]旋转字符串","frequency":42.17824861879155,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7950193821214613,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[797]所有可能的路径","frequency":24.69289937261101,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4547081990691013,"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.4071191113273332,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[799]香槟塔","frequency":53.020696403014625,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7057344064386318,"acs":0,"articleLive":2,"columnArticles":35,"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.41760534000834376,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[801]使序列递增的最小交换次数","frequency":4.497741382272873,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.576742261837602,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[802]找到最终的安全状态","frequency":45.77699202581343,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48292314420897775,"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.7700788020516045,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[804]唯一摩尔斯密码词","frequency":23.63396138377883,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2891043924700513,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[805]数组的均值分割","frequency":8.661896872488112,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.658299309441,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[806]写字符串需要的行数","frequency":16.7954628814756,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8444700460829493,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[807]保持城市天际线","frequency":5.018255598477773,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47962382445141066,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":31.88795185911469,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41959531416400425,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[809]情感丰富的文字","frequency":16.7954628814756,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7360681461555705,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":40.08097302202694,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7036884871724641,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[811]子域名访问计数","frequency":16.183442713396072,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6297849397951237,"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.5480729891170936,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":6.126293813912077,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000943099654197,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[814]二叉树剪枝","frequency":5.018255598477773,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4351399563209576,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[815]公交路线","frequency":72.72858392783964,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5100235849056604,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":8.661896872488112,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912594110571568,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":6.126293813912077,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4303612699185014,"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.4208908757084697,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[819]最常见的单词","frequency":24.937244926792673,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5063784616540788,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[820]单词的压缩编码","frequency":39.112788599468395,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6925047300247417,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[821]字符的最短距离","frequency":29.771219133044468,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5022657241254305,"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.4308239295099706,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":19.505000983338796,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6146405228758169,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[824]山羊拉丁文","frequency":5.5605738976163455,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39048672566371684,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[825]适龄的朋友","frequency":5.5605738976163455,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37172880670910374,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":5.018255598477773,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39121281464530894,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[827]最大人工岛","frequency":24.27337559962882,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4913406029506094,"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.3617273125822008,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[829]连续整数求和","frequency":29.771219133044468,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431057182882001,"acs":0,"articleLive":2,"columnArticles":575,"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.4038000780074664,"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.7954962375051476,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[832]翻转图像","frequency":46.55349485552583,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42540010325245226,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":6.126293813912077,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5296547299193969,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":24.937244926792673,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.573095401509952,"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.47791449857325463,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[836]矩形重叠","frequency":18.094047193227674,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39673610681832233,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[837]新21点","frequency":17.431734517438745,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5006554989075018,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":23.017386824306058,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748067441718911,"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.3589878329762723,"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.656864767776308,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[841]钥匙和房间","frequency":17.431734517438745,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4894021596915723,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.740437148292216,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3765102556898005,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":6.717188864301861,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5147666309824058,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[844]比较含退格的字符串","frequency":27.286804992756892,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4205040871934605,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[845]数组中的最长山脉","frequency":37.69846188927235,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5109365558912387,"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.6842105263157895,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":56.09864490080408,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44649503722084366,"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.42594749817137595,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[849]到最近的人的最大距离","frequency":5.5605738976163455,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.447877179681577,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":16.183442713396072,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47769301895515487,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":5.5605738976163455,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7151175366193405,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.525517953736085,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38223878279770224,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[853]车队","frequency":35.513575061270465,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36074292950612075,"acs":0,"articleLive":2,"columnArticles":64,"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.4093197839421404,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[855]考场就座","frequency":16.7954628814756,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6257502647993409,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[856]括号的分数","frequency":43.41774720360198,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46416111639708213,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.876354625024913,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5548451548451548,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[858]镜面反射","frequency":31.154717435598055,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3016021788750565,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":5.5605738976163455,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5870706090799463,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[860]柠檬水找零","frequency":32.808377617599525,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8091415253139972,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[861]翻转矩阵后的得分","frequency":5.5605738976163455,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18935254581499927,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[862]和至少为 K 的最短子数组","frequency":52.28420305414575,"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.6036652798988889,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":55.409905402038326,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45340362846953014,"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.6551905190519052,"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.22397179074079704,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.784393512347606,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6706583441671176,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[867]转置矩阵","frequency":43.41774720360198,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6247612365025533,"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.5514255728528948,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[869]重新排序得到 2 的幂","frequency":6.126293813912077,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4262359128474831,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[870]优势洗牌","frequency":5.5605738976163455,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3401115979477961,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":39.86152842853764,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520933679140423,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[872]叶子相似的树","frequency":53.47609781396088,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5089605734767025,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":39.112788599468395,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4144249994846742,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[874]模拟行走机器人","frequency":37.69846188927235,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47827751627215603,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.91589140570294,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7059831034586678,"acs":0,"articleLive":2,"columnArticles":1568,"formTitle":"[876]链表的中间结点","frequency":43.35518184071448,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567173861088666,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[877]石子游戏","frequency":60.59850061062865,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2799895914650013,"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.5555817548272158,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":63.41949819823921,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25219928764536753,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[880]索引处的解码字符串","frequency":7.3352351801640365,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5381071290401997,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[881]救生艇","frequency":42.15279161961221,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48477819657871846,"acs":0,"articleLive":2,"columnArticles":28,"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.686917701863354,"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.661104738067925,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[884]两句话中的不常见单词","frequency":6.126293813912077,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6892350400987045,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[885]螺旋矩阵 III","frequency":34.79947650804195,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4227499871207048,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[886]可能的二分法","frequency":5.018255598477773,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2917934545454545,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[887]鸡蛋掉落","frequency":63.45243883822881,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6396667658434989,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[888]公平的糖果棒交换","frequency":5.018255598477773,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.677638213991015,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":42.740437148292216,"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.7259663865546219,"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.32942847000354986,"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.6387251396432092,"acs":0,"articleLive":2,"columnArticles":679,"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.7239530306115523,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[893]特殊等价字符串组","frequency":7.3352351801640365,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7744760524249562,"acs":0,"articleLive":2,"columnArticles":119,"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.5429934995474368,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[895]最大频率栈","frequency":24.937244926792673,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5868908840055188,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[896]单调数列","frequency":16.7954628814756,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.745146427746508,"acs":0,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":56.72144306952094,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3352040816326531,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":24.937244926792673,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5376074025115665,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[899]有序队列","frequency":6.717188864301861,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49278663629460895,"acs":0,"articleLive":2,"columnArticles":40,"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.5423662748860638,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32692891091111337,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.717188864301861,"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.5317621064260726,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":12.277242252083424,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4532437818289173,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[904]水果成篮","frequency":34.11174318737981,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7013666584585078,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[905]按奇偶排序数组","frequency":29.11716714389944,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2736814824413632,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[906]超级回文数","frequency":37.83523365183195,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3162116439155291,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[907]子数组的最小值之和","frequency":38.392431737912304,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986159884321421,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[908]最小差值 I","frequency":5.5605738976163455,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4601374570446735,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":39.86152842853764,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3176813311608157,"acs":0,"articleLive":2,"columnArticles":65,"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.4249727263711197,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.564487768191472,"acs":0,"articleLive":2,"columnArticles":1005,"formTitle":"[912]排序数组","frequency":85.28334580382362,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4046997389033943,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.375798529801575,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38874389560483547,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[914]卡牌分组","frequency":16.183442713396072,"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.46762922618435926,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[915]分割数组","frequency":16.7954628814756,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44057175045768204,"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.5697035788638842,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[917]仅仅反转字母","frequency":24.27337559962882,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35777060626357343,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[918]环形子数组的最大和","frequency":31.154717435598055,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6277668470241023,"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.48056443024494144,"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.7356969894105316,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[921]使括号有效的最少添加","frequency":6.717188864301861,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7141974863046111,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[922]按奇偶排序数组 II","frequency":24.937244926792673,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3376889430264105,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.431734517438745,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35921294375629703,"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.38803854212916444,"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.5180654106516598,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.431734517438745,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33856614338566143,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":37.83523365183195,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4216163583252191,"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.6431200163565733,"acs":0,"articleLive":2,"columnArticles":225,"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.5450434953555807,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[930]和相同的二元子数组","frequency":53.90595227255533,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6599964707958356,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[931]下降路径最小和","frequency":23.017386824306058,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6276736408182313,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[932]漂亮数组","frequency":5.5605738976163455,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7243760399334442,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[933]最近的请求次数","frequency":34.11174318737981,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4753530166880616,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[934]最短的桥","frequency":40.754859727265256,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47427794223537884,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37797246558197745,"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.588638788679437,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.7954628814756,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8184521266597173,"acs":0,"articleLive":2,"columnArticles":785,"formTitle":"[938]二叉搜索树的范围和","frequency":47.21264610252666,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4505149240705184,"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.41907009264114664,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[940]不同的子序列 II","frequency":4.497741382272873,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3922605594575733,"acs":0,"articleLive":2,"columnArticles":607,"formTitle":"[941]有效的山脉数组","frequency":5.018255598477773,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7295587120587944,"acs":0,"articleLive":2,"columnArticles":206,"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.4746701846965699,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":10.8265203909425,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6901533894111825,"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.48649807708269927,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":24.27337559962882,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.622466856060606,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[946]验证栈序列","frequency":49.81605168619866,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127557217366453,"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.39149861837850547,"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.36914613076293534,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[949]给定数字能组成的最大时间","frequency":37.69846188927235,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7745875121319962,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.431734517438745,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6630737781081584,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":24.937244926792673,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3494432598910211,"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.552411335764004,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[953]验证外星语词典","frequency":23.63396138377883,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2995778754514992,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":29.771219133044468,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3280922431865828,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":8.661896872488112,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4358123063302346,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":24.937244926792673,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35994903928655003,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[957]N 天后的牢房","frequency":24.937244926792673,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5371330275229358,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":27.286804992756892,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437814741339844,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.62736124123482,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5529108115858905,"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.6770365076081027,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[961]重复 N 次的元素","frequency":16.7954628814756,"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.44138048863830515,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[962]最大宽度坡","frequency":17.431734517438745,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.500505152556072,"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.42558983666061706,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":13.947811659203424,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840417852138095,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[965]单值二叉树","frequency":6.126293813912077,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4028506118058357,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":7.982643366845061,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46089696071163827,"acs":0,"articleLive":2,"columnArticles":144,"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.49731132950120527,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[968]监控二叉树","frequency":38.800710146713705,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6526964560862866,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[969]煎饼排序","frequency":5.018255598477773,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41452097516449243,"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.44189754833565875,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":6.717188864301861,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40919465275513534,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":13.947811659203424,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.639088017586009,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[973]最接近原点的 K 个点","frequency":5.018255598477773,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4657748592389283,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[974]和可被 K 整除的子数组","frequency":55.409905402038326,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44574736529612585,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":6.717188864301861,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.597200586973699,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[976]三角形的最大周长","frequency":24.27337559962882,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7156748708881961,"acs":0,"articleLive":2,"columnArticles":1215,"formTitle":"[977]有序数组的平方","frequency":48.60159623618965,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733747467029864,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[978]最长湍流子数组","frequency":5.5605738976163455,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122637438508673,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[979]在二叉树中分配硬币","frequency":25.62736124123482,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7330381148189151,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[980]不同路径 III","frequency":30.449805057568714,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5334436664544876,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[981]基于时间的键值存储","frequency":53.785611653509946,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5432533568126788,"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.633688563702879,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[983]最低票价","frequency":45.77699202581343,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4168672424371136,"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.5993442867255319,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[985]查询后的偶数和","frequency":5.5605738976163455,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6767497379760102,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[986]区间列表的交集","frequency":43.804556856982224,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5324696698956081,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[987]二叉树的垂序遍历","frequency":51.574135507026064,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49730750013878866,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[988]从叶结点开始的最小字符串","frequency":5.018255598477773,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4724445713548815,"acs":0,"articleLive":2,"columnArticles":583,"formTitle":"[989]数组形式的整数加法","frequency":17.431734517438745,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5013511438661139,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[990]等式方程的可满足性","frequency":5.5605738976163455,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5169527506520288,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[991]坏了的计算器","frequency":16.7954628814756,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45155659004946175,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":18.094047193227674,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5572596228594274,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[993]二叉树的堂兄弟节点","frequency":49.81605168619866,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5091178018007286,"acs":0,"articleLive":2,"columnArticles":1355,"formTitle":"[994]腐烂的橘子","frequency":32.808377617599525,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402900170150088,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":25.62736124123482,"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.49545078577336643,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":18.094047193227674,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5117173630015387,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[997]找到小镇的法官","frequency":16.183442713396072,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6145739727146475,"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.6909132524605173,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.5605738976163455,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4073898626243487,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":34.79947650804195,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29199772985244044,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":10.101159460372038,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377365472037213,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[1002]查找常用字符","frequency":41.4533539470012,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5763888888888888,"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.5981645633704287,"acs":0,"articleLive":2,"columnArticles":686,"formTitle":"[1004]最大连续1的个数 III","frequency":48.471179185528726,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5351467875636153,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.290745689406364,"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.6278125890059812,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[1006]笨阶乘","frequency":50.524625007718235,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46467146714671465,"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.7263498731075523,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.08097302202694,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5929217521823281,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.5605738976163455,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45043344345363767,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":6.126293813912077,"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.6273215901229312,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":71.52034788352756,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3295505117935024,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":19.505000983338796,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39796277385416756,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":32.808377617599525,"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.5475679051841019,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[1014]最佳观光组合","frequency":15.594060827695694,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3541821977038915,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":17.431734517438745,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5835716737215422,"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.562358276643991,"acs":0,"articleLive":2,"columnArticles":53,"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.5167378622395248,"acs":0,"articleLive":2,"columnArticles":373,"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.5973755026758988,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.5605738976163455,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5369713013657421,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1020]飞地的数量","frequency":24.27337559962882,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.783478763522255,"acs":0,"articleLive":2,"columnArticles":647,"formTitle":"[1021]删除最外层的括号","frequency":24.937244926792673,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7027560494188172,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.5605738976163455,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.565382707885601,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.717188864301861,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5586260946604423,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[1024]视频拼接","frequency":16.183442713396072,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7098277376723579,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[1025]除数博弈","frequency":38.800710146713705,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6690121412803532,"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.4330660712473358,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1027]最长等差数列","frequency":35.513575061270465,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318943793141229,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[1028]从先序遍历还原二叉树","frequency":23.63396138377883,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6542782026768642,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1029]两地调度","frequency":6.126293813912077,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114415545378998,"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.5671318575553417,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.126293813912077,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3952664627274191,"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.3901017875768802,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.126293813912077,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43235117257967526,"acs":0,"articleLive":2,"columnArticles":92,"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.6301223663630509,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[1035]不相交的线","frequency":59.11895682166468,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2992028847978744,"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.43752929046771016,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7931023347434366,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":3.997587297058907,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5543175487465181,"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.5219591175875329,"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.48218457943925236,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":24.27337559962882,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5285232508431102,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1042]不邻接植花","frequency":16.183442713396072,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6910719231834549,"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.20916641033528144,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":54.697477009938645,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6436836645120102,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1045]买下所有产品的客户","frequency":5.5605738976163455,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6594196260445612,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[1046]最后一块石头的重量","frequency":27.876354625024913,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7256465195076984,"acs":0,"articleLive":2,"columnArticles":957,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":58.71552876665284,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4516928567887771,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":39.112788599468395,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6436868686868686,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1049]最后一块石头的重量 II","frequency":59.36011642423902,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7572986282096377,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.5605738976163455,"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.752743341107156,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1051]高度检查器","frequency":6.126293813912077,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811337455895551,"acs":0,"articleLive":2,"columnArticles":741,"formTitle":"[1052]爱生气的书店老板","frequency":26.34571948574115,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45846394984326017,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":17.431734517438745,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37607498309015364,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.7954628814756,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5838979673176564,"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.40768370011189853,"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.46425778194900674,"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.33856619570905283,"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.3593152733920558,"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.5279187817258884,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":16.7954628814756,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6000899685110211,"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.537109375,"acs":0,"articleLive":2,"columnArticles":42,"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.6990521327014217,"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.6507541165075411,"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.5386715195632393,"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.47378455672068637,"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.42063492063492064,"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.863704922528452,"acs":0,"articleLive":2,"columnArticles":58,"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.8197226502311248,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.5605738976163455,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48418792295679336,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1070]产品销售分析 III","frequency":5.5605738976163455,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5864666791943557,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1071]字符串的最大公因子","frequency":17.431734517438745,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5791360458863596,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":8.661896872488112,"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.3361738389433319,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":10.101159460372038,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6700823421774932,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":46.48161132199868,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6950779390309453,"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.4960224375318715,"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.7219315895372234,"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.6218733080671359,"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.7348734134712243,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1079]活字印刷","frequency":5.5605738976163455,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4899952358265841,"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.5710994341147938,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1081]不同字符的最小子序列","frequency":41.4533539470012,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.760086105131588,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":5.5605738976163455,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5281302876480541,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.431734517438745,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5379812695109261,"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.7721354166666666,"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.6886949293433084,"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.531985515992758,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44542642509942554,"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.5852860525987785,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[1089]复写零","frequency":5.018255598477773,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5424808836023789,"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.37860647120663476,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":40.08097302202694,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4873965749470849,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":19.505000983338796,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3825910931174089,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1093]大样本统计","frequency":7.982643366845061,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6131961259079903,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[1094]拼车","frequency":22.422190473341242,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37300789107225746,"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.5540494747543205,"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.5171269727403156,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1097]游戏玩法分析 V","frequency":35.513575061270465,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4723693143245078,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1098]小众书籍","frequency":16.7954628814756,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5793257312840853,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":6.126293813912077,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.701866894684338,"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.6684923609109253,"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.3680330286051312,"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.6366452314101984,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[1103]分糖果 II","frequency":16.183442713396072,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609570302022424,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1104]二叉树寻路","frequency":44.440004346103564,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5564232292124945,"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.5738802846379238,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1106]解析布尔表达式","frequency":18.784393512347606,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4103653355989805,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1107]每日新用户统计","frequency":5.5605738976163455,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8391477524182841,"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.5750113999088007,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[1109]航班预订统计","frequency":27.09454954407483,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6281073528555626,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1110]删点成林","frequency":24.937244926792673,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7718959299330242,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.937244926792673,"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.6434728516839954,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":17.431734517438745,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5403412856196156,"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.6528098202237409,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[1114]按序打印","frequency":78.13068798544502,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5618106153452479,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1115]交替打印FooBar","frequency":50.22628216013047,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5165490790283631,"acs":0,"articleLive":2,"columnArticles":356,"formTitle":"[1116]打印零与奇偶数","frequency":59.809917236862134,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5205998323449967,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[1117]H2O 生成","frequency":44.440004346103564,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6405633802816901,"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.866449168596085,"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.6070834323746137,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1120]子树的最大平均值","frequency":7.982643366845061,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5736475629351901,"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.7071126464270688,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[1122]数组的相对排序","frequency":52.28420305414575,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7045924328210659,"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.31643115849614856,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1124]表现良好的最长时间段","frequency":7.3352351801640365,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4894954507857734,"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.6927360774818402,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1126]查询活跃业务","frequency":16.7954628814756,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4140876317249029,"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.5446458965440687,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":15.594060827695694,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3792178631572382,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1129]颜色交替的最短路径","frequency":7.3352351801640365,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6280494475440324,"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.4535130224106602,"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.3886922668554238,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1132]报告的记录 II","frequency":16.7954628814756,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6440869959220662,"acs":0,"articleLive":2,"columnArticles":60,"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.7745,"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.5337423312883436,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":24.937244926792673,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5667248146532926,"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.6072818928087425,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[1137]第 N 个泰波那契数","frequency":31.67544100994623,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.431765890135174,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":6.126293813912077,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4767131880194449,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.094047193227674,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6533769711395419,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.126293813912077,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5112006446414182,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":16.7954628814756,"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.37148481439820025,"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.6336308356218124,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[1143]最长公共子序列","frequency":81.5286546389477,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4417926048517051,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.937244926792673,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4692624431120422,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":20.23036191390926,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28614970229656933,"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.561908856405847,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1147]段式回文","frequency":36.25603468707768,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7186051004636785,"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.44213753832676306,"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.6065310492505354,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":17.431734517438745,"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.4823947981842719,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":17.431734517438745,"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.38422769048324934,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1152]用户网站访问行为分析","frequency":15.02585801200021,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37088156723063226,"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.5666748526522594,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1154]一年中的第几天","frequency":5.018255598477773,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.48046713517982637,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1155]掷骰子的N种方法","frequency":6.126293813912077,"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.43357084874176965,"acs":0,"articleLive":2,"columnArticles":75,"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.31664338669818415,"acs":0,"articleLive":2,"columnArticles":43,"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.5495876506661028,"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.4866120218579235,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1159]市场分析 II","frequency":18.094047193227674,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6874019251938075,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[1160]拼写单词","frequency":23.63396138377883,"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.6329410314868446,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1161]最大层内元素和","frequency":6.126293813912077,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46921319131401173,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[1162]地图分析","frequency":25.62736124123482,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2671286671286671,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1163]按字典序排在最后的子串","frequency":8.661896872488112,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6109156927266538,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1164]指定日期的产品价格","frequency":17.431734517438745,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8387567324955116,"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.4880884314846579,"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.4237875288683603,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":10.8265203909425,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5708441799925623,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":11.551881321512962,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32215914652050504,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":18.094047193227674,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6171037628278221,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.717188864301861,"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.4724937272965584,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":16.7954628814756,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26978980322003576,"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.7559248697020357,"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.6175133689839573,"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.4886197536020046,"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.4467408585055644,"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.26305888529180155,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1177]构建回文串检测","frequency":6.126293813912077,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46210305572198923,"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.6342770693754052,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1179]重新格式化部门表","frequency":51.84422950385802,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7741689926414616,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1180]统计只含单一字母的子串","frequency":9.375798529801575,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3700887198986058,"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.3866201518571722,"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.6020892687559354,"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.5856657426450863,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":5.018255598477773,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6101101101101101,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1185]一周中的第几天","frequency":16.183442713396072,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3922610015174507,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":30.449805057568714,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4388454011741683,"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.6925787271526096,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":22.71720223657227,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6444747094036043,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[1189]“气球” 的最大数量","frequency":5.5605738976163455,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.651013442711296,"acs":0,"articleLive":2,"columnArticles":604,"formTitle":"[1190]反转每对括号间的子串","frequency":94.01423436892406,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2675228856401148,"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.4995673136358017,"acs":0,"articleLive":2,"columnArticles":43,"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.6073852525020131,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":6.126293813912077,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5124218869074836,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.717188864301861,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6355604374611968,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1195]交替打印字符串","frequency":24.937244926792673,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6903199343724364,"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.3679085861430756,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.784393512347606,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7475267115156312,"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.4335961188599151,"acs":0,"articleLive":2,"columnArticles":16,"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.68650183366852,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[1200]最小绝对差","frequency":23.63396138377883,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24702218106822676,"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.5032253182755424,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":6.717188864301861,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6232312237599129,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":8.661896872488112,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7272357171936491,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":6.717188864301861,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4619312906220984,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1205]每月交易II","frequency":25.62736124123482,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.618346327846761,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":18.094047193227674,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304331751802329,"acs":0,"articleLive":2,"columnArticles":820,"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.49647891109653697,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[1208]尽可能使字符串相等","frequency":16.7954628814756,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5323600309273662,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":34.11174318737981,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4499394777796991,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":13.222450728632962,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6550522648083623,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1211]查询结果的质量和占比","frequency":16.7954628814756,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5132365499573015,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.5605738976163455,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7725321888412017,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":18.784393512347606,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6331911593640946,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":18.094047193227674,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4099244875943905,"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.532068311195446,"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.6954795456764409,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":34.11174318737981,"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.42100884035361413,"acs":0,"articleLive":2,"columnArticles":107,"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.6307270380727038,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.11174318737981,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5264697687378099,"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.8425934450377462,"acs":0,"articleLive":2,"columnArticles":1079,"formTitle":"[1221]分割平衡字符串","frequency":0.7253609305704625,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6716382853787434,"acs":0,"articleLive":2,"columnArticles":126,"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.4722541690626797,"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.32563233008336867,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1224]最大相等频率","frequency":28.693957820014365,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5439236111111111,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1225]报告系统状态的连续日期","frequency":19.505000983338796,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6001680407498818,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1226]哲学家进餐","frequency":48.60159623618965,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625397469724646,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1227]飞机座位分配概率","frequency":4.497741382272873,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5396428571428571,"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.41422669301239445,"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.4897746967071057,"acs":0,"articleLive":2,"columnArticles":55,"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.5581441263573544,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":18.784393512347606,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46920952661311804,"acs":0,"articleLive":2,"columnArticles":415,"formTitle":"[1232]缀点成线","frequency":4.497741382272873,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4830212234706617,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.717188864301861,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.341766138131718,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1234]替换子串得到平衡字符串","frequency":5.5605738976163455,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45327984898537044,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1235]规划兼职工作","frequency":39.112788599468395,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5608308605341247,"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.7105839158370402,"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.6574923547400612,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":5.5605738976163455,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49070063330045316,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[1239]串联字符串的最大长度","frequency":41.4533539470012,"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.4949071300179748,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":26.34571948574115,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5950445597884634,"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.46944336317633323,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":16.183442713396072,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393900889453621,"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.6198193411264612,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.375798529801575,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5081822202565237,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.126293813912077,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4797274842140246,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":10.8265203909425,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6173848987108655,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1247]交换字符使得字符串相同","frequency":24.27337559962882,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5589175891758917,"acs":0,"articleLive":2,"columnArticles":466,"formTitle":"[1248]统计「优美子数组」","frequency":23.63396138377883,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5724924989284184,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1249]移除无效的括号","frequency":37.02908617571276,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5619535082107059,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":19.505000983338796,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7715776796467282,"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.7498419655274137,"acs":0,"articleLive":2,"columnArticles":307,"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.39361702127659576,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":19.505000983338796,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5982938792919599,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1254]统计封闭岛屿的数目","frequency":5.018255598477773,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6779701209390562,"acs":0,"articleLive":2,"columnArticles":62,"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.6638655462184874,"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.5643533123028391,"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.55746859004188,"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.47581441263573543,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":13.947811659203424,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6038046734571599,"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.7280894580904138,"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.525844389570167,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1262]可被三整除的最大和","frequency":40.754859727265256,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41612993559227107,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":7.982643366845061,"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.5702316412025629,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1264]页面推荐","frequency":6.717188864301861,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9199576868829337,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":7.982643366845061,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8239189715621348,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1266]访问所有点的最小时间","frequency":17.431734517438745,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6082851253407806,"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.5821439416945035,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1268]搜索推荐系统","frequency":6.126293813912077,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4916830065359477,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.21264610252666,"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.8051238975220496,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":5.5605738976163455,"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.5058848255569567,"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.5187645300564596,"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.5440396179695791,"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.5984848484848485,"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.5396911406123002,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.7954628814756,"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.5014892616397555,"acs":0,"articleLive":2,"columnArticles":95,"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.7242950278846909,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":22.422190473341242,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5971482563133482,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":58.12522309159364,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6233183856502242,"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.5047091412742383,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.183442713396072,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8317351386441622,"acs":0,"articleLive":2,"columnArticles":607,"formTitle":"[1281]整数的各位积和之差","frequency":5.5605738976163455,"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.8115932203389831,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[1282]用户分组","frequency":6.717188864301861,"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.4159707406278574,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.431734517438745,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6599317764366308,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":17.431734517438745,"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.8136186770428016,"acs":0,"articleLive":2,"columnArticles":56,"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.6454166666666666,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":5.5605738976163455,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6039303403099536,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.183442713396072,"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.5631970260223048,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":34.11174318737981,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6273055126223596,"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.8089664718548139,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1290]二进制链表转整数","frequency":3.997587297058907,"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.5188822902390742,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46810226631179935,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":5.018255598477773,"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.3556531595352791,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":56.054894486634424,"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.6598693328053851,"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.8093441027304862,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.5605738976163455,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4532490974729242,"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.4585683297180043,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":26.34571948574115,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5959944751381215,"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.7854072753957438,"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.46722304745524196,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":3.997587297058907,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3601410934744268,"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.8166924000686224,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.27337559962882,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8223429014740109,"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.7249497260938909,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.018255598477773,"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.7466333401346664,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.5605738976163455,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5759270057970021,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1306]跳跃游戏 III","frequency":29.771219133044468,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33235185866764816,"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.750886524822695,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1308]不同性别每日分数总计","frequency":6.126293813912077,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.755349698934692,"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.7127030162412993,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":52.507913391402326,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3773978315262719,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.717188864301861,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6667329488964009,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":32.808377617599525,"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.8314258979342115,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1313]解压缩编码列表","frequency":4.497741382272873,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7349488570055606,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1314]矩阵区域和","frequency":34.79947650804195,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8098763842389904,"acs":0,"articleLive":2,"columnArticles":256,"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.43891402714932126,"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.6142522788864252,"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.6516577540106951,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1318]或运算的最小翻转次数","frequency":64.81619429096602,"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.6175686944495291,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[1319]连通网络的操作次数","frequency":6.126293813912077,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5885505481120584,"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.616962062399297,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5926055926055926,"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.7554399543234156,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.27337559962882,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5926646859952873,"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.7282473015639915,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.018255598477773,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47498931167165453,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":6.717188864301861,"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.6918114797261716,"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.4585163299528867,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":16.183442713396072,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7708144796380091,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.717188864301861,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37842296271857473,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":13.222450728632962,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.535399673735726,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[1331]数组序号转换","frequency":16.7954628814756,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6846211552888222,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.5605738976163455,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5427579365079365,"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.4898032521786003,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":49.132108606911764,"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.5848268661910562,"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.4236111111111111,"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.7062303636062983,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":38.392431737912304,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6403744285610623,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":5.018255598477773,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.397187530730652,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":6.126293813912077,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5724267669981188,"acs":0,"articleLive":2,"columnArticles":94,"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.4800593031875463,"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.8205366683816836,"acs":0,"articleLive":2,"columnArticles":633,"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.5433983479652295,"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.5937722600997253,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1344]时钟指针的夹角","frequency":6.717188864301861,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3668957468879668,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":6.126293813912077,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4359282809188291,"acs":0,"articleLive":2,"columnArticles":262,"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.7388479441427463,"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.3031638750122441,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1348]推文计数","frequency":7.982643366845061,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5039774610540272,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":6.717188864301861,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.848310492729365,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":6.126293813912077,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7550245414621545,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.018255598477773,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4421778084079945,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.717188864301861,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28252367229312475,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.64371688866175,"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.2855982124720699,"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.6617221418234442,"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.7315086137497987,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.183442713396072,"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.5286301369863013,"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.4877960257689865,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.5605738976163455,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5466478190630049,"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.5035374481580873,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1360]日期之间隔几天","frequency":34.11174318737981,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4010698166824539,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1361]验证二叉树","frequency":5.5605738976163455,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5230784871899146,"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.3626145199784433,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":34.79947650804195,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6750157861502841,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.5605738976163455,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8251175667848062,"acs":0,"articleLive":2,"columnArticles":1077,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.27337559962882,"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.5364356743318831,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":18.094047193227674,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4177247191011236,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":16.7954628814756,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5207277065314644,"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.608415013148458,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":5.5605738976163455,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7904626428701391,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1370]上升下降字符串","frequency":5.018255598477773,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799004700027647,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.4533539470012,"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.5134559535333979,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.5605738976163455,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3981278511760175,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":29.771219133044468,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7393560404470463,"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.5725123619860462,"acs":0,"articleLive":2,"columnArticles":169,"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.5023680417324456,"acs":0,"articleLive":2,"columnArticles":151,"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.32535390488309207,"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.8620049504950495,"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.8367598684210527,"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.7274062861722019,"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.7319212526801377,"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.691046414046866,"acs":0,"articleLive":2,"columnArticles":170,"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.32369900533371776,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":9.375798529801575,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5420070011668612,"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.7030628694250403,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1385]两个数组间的距离值","frequency":5.5605738976163455,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3106289340361292,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":20.23036191390926,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6943939504108194,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":19.505000983338796,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5373134328358209,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":34.11174318737981,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307876251681363,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.183442713396072,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3524799727288222,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4003195673549656,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":20.23036191390926,"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.4008982197933012,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1392]最长快乐前缀","frequency":5.5605738976163455,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8573629760070438,"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.6640865020149224,"acs":0,"articleLive":2,"columnArticles":267,"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.7500268730517038,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.5605738976163455,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4121809225257501,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1396]设计地铁系统","frequency":19.505000983338796,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.36937941285767373,"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.7703375760929718,"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.6685005868544601,"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.6045272969374168,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.5605738976163455,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4177298004579653,"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.7515478009166198,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":5.5605738976163455,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915268903088392,"acs":0,"articleLive":2,"columnArticles":357,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.7954628814756,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49252485918920796,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":6.717188864301861,"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.5059949809461846,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1405]最长快乐字符串","frequency":17.431734517438745,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5693009848666827,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":6.717188864301861,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6678470254957507,"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.614409984871407,"acs":0,"articleLive":2,"columnArticles":197,"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.8050778879223144,"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.47598622213556896,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1410]HTML 实体解析器","frequency":7.982643366845061,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5491985912455977,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":45.09699522101154,"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.5501258389261745,"acs":0,"articleLive":2,"columnArticles":64,"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.6920179727765297,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.183442713396072,"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.6021550283995991,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.27337559962882,"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.6841602039732285,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.126293813912077,"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.4083184257602862,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":20.23036191390926,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5182418845159437,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.126293813912077,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7328074721644787,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1418]点菜展示表","frequency":49.33480470459832,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4185394772298572,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":34.79947650804195,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5935775213246363,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.63396138377883,"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.7483669412098836,"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.5406701085238648,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1422]分割字符串的最大得分","frequency":29.771219133044468,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5545169324319953,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":5.5605738976163455,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3975337280996276,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1424]对角线遍历 II","frequency":17.431734517438745,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43416219270980505,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.717188864301861,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7057318321392017,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":8.661896872488112,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6571613739468568,"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.592891760904685,"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.5004549590536852,"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.5783879539415412,"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.8463027613733999,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.5605738976163455,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39262877442273536,"acs":0,"articleLive":2,"columnArticles":97,"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.64257512612415,"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.45485455232338495,"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.6199465156520372,"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.7834142364842331,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5890450912909059,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":6.126293813912077,"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.4827073924411695,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":36.06764328403421,"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.5608555162332667,"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.6975916803503011,"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.6474719101123596,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1441]用栈操作构建数组","frequency":6.717188864301861,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7917126056596839,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":53.194615449151314,"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.4104132477994928,"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.5247687564234327,"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.8583788706739527,"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.5725148108410691,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6170371953826421,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7131950335466954,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":4.497741382272873,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6277276582620094,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":35.513575061270465,"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.8022831667116995,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":5.018255598477773,"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.5214013950538998,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":6.717188864301861,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49799265396771164,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.3352351801640365,"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.36308040770101924,"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.40255698544873414,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":16.7954628814756,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6333423545331529,"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.5194200530937308,"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.6361861373250894,"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.44093483289463187,"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.5934246575342466,"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.7441709844559585,"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.49969381506429883,"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.42633992548008026,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1462]课程表 IV","frequency":5.5605738976163455,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5901565995525727,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":10.101159460372038,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7687885377260135,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1464]数组中两元素的最大乘积","frequency":16.7954628814756,"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.3077572087944811,"acs":0,"articleLive":2,"columnArticles":78,"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.4846597103254945,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":17.431734517438745,"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.6140350877192983,"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.7115191146881288,"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.8030990173847317,"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.843522852532869,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[1470]重新排列数组","frequency":42.08612690382681,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5426651735722284,"acs":0,"articleLive":2,"columnArticles":103,"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.6158934921028695,"acs":0,"articleLive":2,"columnArticles":124,"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.6749277519922936,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":48.06912922707036,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7194552529182879,"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.7238836542400655,"acs":0,"articleLive":2,"columnArticles":223,"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.865249704799611,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1476]子矩形查询","frequency":18.784393512347606,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28888888888888886,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":17.431734517438745,"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.5755074726745483,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":27.09454954407483,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5734200743494424,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":6.126293813912077,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.869539320996529,"acs":0,"articleLive":2,"columnArticles":1274,"formTitle":"[1480]一维数组的动态和","frequency":31.192584180879035,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5120104438642298,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1481]不同整数的最少数目","frequency":34.11174318737981,"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.5870733008229199,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":47.89480770437785,"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.2994881340158213,"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.8053475935828877,"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.6605301914580265,"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.8586615949184985,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":47.89480770437785,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3079279500061267,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1487]保证文件名唯一","frequency":24.27337559962882,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23542254467284698,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1488]避免洪水泛滥","frequency":60.912645678109975,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6928709755507141,"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.8568111455108359,"acs":0,"articleLive":2,"columnArticles":28,"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.671759928419024,"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.6658211794546608,"acs":0,"articleLive":2,"columnArticles":74,"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.5660758706467661,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.27337559962882,"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.3661257606490872,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":28.693957820014365,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5422921478060047,"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.5384343076767473,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1496]判断路径是否相交","frequency":5.5605738976163455,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39087361152806965,"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.3331583437233414,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":20.23036191390926,"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.3772350632359355,"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.3003533568904594,"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.5911239896294037,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":23.63396138377883,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7169322077847244,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[1502]判断能否形成等差数列","frequency":33.44858233523286,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5119439366240097,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":17.431734517438745,"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.5933678076007551,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1504]统计全 1 子矩形","frequency":33.44858233523286,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.360884619680554,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":34.28130602249608,"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.8423566878980892,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":29.11716714389944,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5882905447714465,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1507]转变日期格式","frequency":29.771219133044468,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5531756379214007,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1508]子数组和排序后的区间和","frequency":6.717188864301861,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5445714285714286,"acs":0,"articleLive":2,"columnArticles":72,"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.5778947368421052,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":29.11716714389944,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6814220982920879,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.126293813912077,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.848730622002552,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[1512]好数对的数目","frequency":5.018255598477773,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37892610906051954,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":5.018255598477773,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31602737956864263,"acs":0,"articleLive":2,"columnArticles":130,"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.34117129985715855,"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.575682382133995,"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.7304932735426009,"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.674535506984753,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[1518]换酒问题","frequency":24.27337559962882,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2956892312735617,"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.3318230277185501,"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.395674687785562,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":12.277242252083424,"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.7034632034632035,"acs":0,"articleLive":2,"columnArticles":24,"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.5780736848390756,"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.4253677138187761,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.183442713396072,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6603628929210325,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.126293813912077,"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.6124546553808948,"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.5075847709696609,"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.7844290657439447,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[1528]重新排列字符串","frequency":15.594060827695694,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6888276947285602,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1529]灯泡开关 IV","frequency":6.126293813912077,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5661165241598728,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":16.7954628814756,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32431450880697293,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.84704592621567,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6178251392589005,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":6.126293813912077,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6137931034482759,"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.7893847669998593,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.5605738976163455,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4527139296593741,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1535]找出数组游戏的赢家","frequency":6.717188864301861,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4391891891891892,"acs":0,"articleLive":2,"columnArticles":76,"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.36481512464447047,"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.6042780748663101,"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.5381726304288446,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[1539]第 k 个缺失的正整数","frequency":37.69846188927235,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3166233939151854,"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.4582699847963511,"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.38111005991800695,"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.5474695959199686,"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.5444895857175555,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[1544]整理字符串","frequency":34.11174318737981,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5522455427668698,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":17.431734517438745,"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.4107914255440541,"acs":0,"articleLive":2,"columnArticles":76,"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.5346548004314995,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":27.09454954407483,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7127659574468085,"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.667528735632184,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":5.5605738976163455,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6603486046290122,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.5605738976163455,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8173127193965195,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.5605738976163455,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5075101097631427,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":16.7954628814756,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29423924490034714,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":60.22109842839297,"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.7053701015965167,"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.4346326836581709,"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.5793394862670966,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[1556]千位分隔数","frequency":45.09699522101154,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7628231859883235,"acs":0,"articleLive":2,"columnArticles":97,"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.621875,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":6.717188864301861,"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.36677358699258933,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":9.375798529801575,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5735542779844437,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.717188864301861,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7793401467864737,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.183442713396072,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30983316108076187,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":9.375798529801575,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37805593584979463,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":42.17824861879155,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5873642645607108,"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.7249940319885414,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":6.126293813912077,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4460772969220088,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.5605738976163455,"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.395257801140812,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":24.27337559962882,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4548736462093863,"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.4716361931551805,"acs":0,"articleLive":2,"columnArticles":44,"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.8972904851921865,"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.7571929824561403,"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.804751843387521,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1572]矩阵对角线元素的和","frequency":16.7954628814756,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29565572654228517,"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.3260281770314501,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":25.62736124123482,"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.5980361596009975,"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.47602934408922337,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":5.018255598477773,"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.3240411357609469,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.375798529801575,"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.5802827707145989,"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.6196126937497585,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":21.0193139246888,"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.6301020408163265,"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.808812729498164,"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.6715728715728716,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.126293813912077,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6860865381056372,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":25.62736124123482,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6663680910480004,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[1584]连接所有点的最小费用","frequency":18.784393512347606,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4293030912749223,"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.6197916666666666,"acs":0,"articleLive":2,"columnArticles":22,"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.8243174924165824,"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.8387753519215109,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[1588]所有奇数长度子数组的和","frequency":21.636286392235128,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2943574168797954,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":7.3352351801640365,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26437480985701245,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1590]使数组和能被 P 整除","frequency":6.717188864301861,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5810955961331902,"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.44461538461538463,"acs":0,"articleLive":2,"columnArticles":123,"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.5295251623376623,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.5605738976163455,"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.31334504621495685,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":6.717188864301861,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46188452886778303,"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.7623828647925034,"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.6650717703349283,"acs":0,"articleLive":2,"columnArticles":18,"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.671179641469224,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.5605738976163455,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4191597008358997,"acs":0,"articleLive":2,"columnArticles":67,"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.6813303407467863,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":17.431734517438745,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48408087380897047,"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.7818831942789034,"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.844928713228659,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1603]设计停车系统","frequency":60.912645678109975,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4141160347190498,"acs":0,"articleLive":2,"columnArticles":60,"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.734630002235636,"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.3413327619455753,"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.5468400731558626,"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.6396281075254329,"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.5116777531411678,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1609]奇偶树","frequency":5.5605738976163455,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2705937573339592,"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.6096908442330559,"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.7348353552859619,"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.7253100597152045,"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.8211797724652934,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[1614]括号的最大嵌套深度","frequency":4.497741382272873,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4950115118956255,"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.2750925199057979,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.126293813912077,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6176258992805755,"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.5881188118811881,"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.6773266947529683,"acs":0,"articleLive":2,"columnArticles":124,"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.3698334361505244,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":9.375798529801575,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43759551706571576,"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.14682764258316042,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":17.431734517438745,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7831325301204819,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":6.126293813912077,"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.6277825220609166,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.7954628814756,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5421141888072357,"acs":0,"articleLive":2,"columnArticles":64,"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.3841066341066341,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.126293813912077,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3787661406025825,"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.8356164383561644,"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.5234654689839224,"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.7688251423750264,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1630]等差子数组","frequency":6.126293813912077,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4923224568138196,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":23.63396138377883,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31677704194260486,"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.6557756624646257,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.126293813912077,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5193591455273698,"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.5442142496210207,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":6.717188864301861,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7062009863368097,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.5605738976163455,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8053275514945021,"acs":0,"articleLive":2,"columnArticles":68,"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.7118028534370947,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":8.661896872488112,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.401572224041926,"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.6625192747381294,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1640]能否连接形成数组","frequency":5.5605738976163455,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7696985379738647,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.392431737912304,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45356104651162793,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":5.5605738976163455,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45020576131687245,"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.5381615598885794,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":18.784393512347606,"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.4142857142857143,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":6.717188864301861,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5378775947333606,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.576433709659078,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5123674911660777,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.27337559962882,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27772277227722775,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.505000983338796,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474518037793472,"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.7956043956043956,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":7.3352351801640365,"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.6871287128712872,"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.6597600872410033,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1652]拆炸弹","frequency":16.7954628814756,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5037583116507661,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":6.126293813912077,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2733758603323821,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":16.7954628814756,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38368580060422963,"acs":0,"articleLive":2,"columnArticles":31,"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.7811123630031752,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":5.018255598477773,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46484985245617083,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.126293813912077,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2970922882427307,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"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.4107198504206918,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":13.222450728632962,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7397260273972602,"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.7287166454891995,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":18.094047193227674,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8132625349600746,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.183442713396072,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725442156037057,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.62736124123482,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5450612833453496,"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.666579016565869,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":7.3352351801640365,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6811145510835913,"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.6004749183734046,"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.44174153420870765,"acs":0,"articleLive":2,"columnArticles":124,"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.7644193796462445,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1669]合并两个链表","frequency":16.7954628814756,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5293586269196026,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":5.5605738976163455,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46450544249881687,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":8.661896872488112,"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.8505299007416369,"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.35129197115154986,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":5.018255598477773,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36202002091737634,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":19.505000983338796,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43590189598190987,"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.7667731629392971,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":10.101159460372038,"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.39766081871345027,"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.8303215777713009,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":5.018255598477773,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49646174259177356,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":5.5605738976163455,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4617270975652479,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.126293813912077,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38355481727574753,"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.5269784172661871,"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.8943912448700411,"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.8276388818167931,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[1684]统计一致字符串的数目","frequency":24.27337559962882,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5960532973519986,"acs":0,"articleLive":2,"columnArticles":81,"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.4711556297532925,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.126293813912077,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39842381786339753,"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.8050124275062137,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1688]比赛中的配对次数","frequency":16.7954628814756,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8689646742452023,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1689]十-二进制数的最少数目","frequency":15.594060827695694,"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.5131063204311612,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1690]石子游戏 VII","frequency":6.126293813912077,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4858192205672312,"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.6411290322580645,"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.801071155317521,"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.6337813847324373,"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.4568092181579151,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1695]删除子数组的最大得分","frequency":5.018255598477773,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3970666666666667,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":23.017386824306058,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5256283883686546,"acs":0,"articleLive":2,"columnArticles":42,"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.544766708701135,"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.800792864222002,"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.7168185419968305,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.018255598477773,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6108670896372214,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1701]平均等待时间","frequency":17.431734517438745,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4747440845779493,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":18.784393512347606,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38955317809943363,"acs":0,"articleLive":2,"columnArticles":22,"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.7817494528814908,"acs":0,"articleLive":2,"columnArticles":180,"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.3471438317930906,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":17.431734517438745,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5831352258425395,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1706]球会落何处","frequency":16.7954628814756,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032595458127374,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":39.86152842853764,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6967278531524341,"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.712358337830545,"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.6928791789964113,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":23.63396138377883,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3592776263493474,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":50.524625007718235,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26474234106605277,"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.49701980388386846,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":45.77699202581343,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.637883008356546,"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.7335870599429115,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1715]苹果和橘子的个数","frequency":17.431734517438745,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6759314519566886,"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.43057247259439707,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4872258064516129,"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.36577992744860943,"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.869425487267709,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":56.72144306952094,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6470921807069497,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1721]交换链表中的节点","frequency":6.126293813912077,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5140094495110428,"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.507513964003901,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":72.9371157462153,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5576271186440678,"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.78762995329215,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.5605738976163455,"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.47744095875925274,"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.5747991109591383,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":7.982643366845061,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35563612392880684,"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.6246819338422391,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.126293813912077,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.530060120240481,"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.47636674259681094,"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.7924528301886793,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1732]找到最高海拔","frequency":29.771219133044468,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4582493843743004,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":9.375798529801575,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231820425554025,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":55.409905402038326,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4840764331210191,"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.4490566636517986,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.09699522101154,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3096424512632223,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":18.784393512347606,"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.6542903525046382,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":40.08097302202694,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4717048710601719,"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.7032085561497327,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":12.277242252083424,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8447261204164781,"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.7073023536511768,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.018255598477773,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6973035753523559,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":42.17824861879155,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36274976519177077,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":56.14876317436218,"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.4842089728453365,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":6.126293813912077,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5892857142857143,"acs":0,"articleLive":2,"columnArticles":28,"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.7052194543297746,"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.748809100604337,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":24.937244926792673,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5307739183424741,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.27337559962882,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4580119342162713,"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.4711406321575813,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":18.784393512347606,"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.6841487566933177,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":5.018255598477773,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6286334056399132,"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.4201007090740931,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":6.717188864301861,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39923954372623577,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":7.982643366845061,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8287153652392947,"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.9240091713069112,"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.6359455481972038,"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.4288044521205143,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1759]统计同构子字符串的数目","frequency":6.126293813912077,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5373986980204597,"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.4292508917954816,"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.6705882352941176,"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.6086956521739131,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1763]最长的美好子字符串","frequency":6.126293813912077,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4770877944325482,"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.5532286212914486,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":6.126293813912077,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37465790914066777,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":15.02585801200021,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7966101694915254,"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.7696005655708731,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1768]交替合并字符串","frequency":16.183442713396072,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8553250827958864,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.5605738976163455,"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.368738023542294,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":10.8265203909425,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36480411046885036,"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.5247349823321554,"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.8415894895541676,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":22.422190473341242,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.552977937695294,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":5.5605738976163455,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47365426197792193,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":18.094047193227674,"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.4612868047982552,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":27.876354625024913,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.778267716535433,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1777]每家商店的产品价格","frequency":65.53422772513046,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5753424657534246,"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.645935960591133,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":5.5605738976163455,"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.662736736485639,"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.5177533892834086,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":6.126293813912077,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2867756315007429,"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.7905604719764012,"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.4209805934398983,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":5.5605738976163455,"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.3482570442142778,"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.3403707518022657,"acs":0,"articleLive":2,"columnArticles":86,"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.6542948038176034,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":54.41949805387198,"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.6854838709677419,"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.7110762800417972,"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.6496640195479536,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.5605738976163455,"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.8092336737320862,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1791]找出星型图的中心节点","frequency":5.018255598477773,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5120926175561018,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":38.392431737912304,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41239130434782606,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":18.094047193227674,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.685,"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.7849037987173162,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":24.937244926792673,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48690110927543073,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1796]字符串中第二大的数字","frequency":5.5605738976163455,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5740407258623078,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1797]设计一个验证系统","frequency":17.431734517438745,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5193920335429769,"acs":0,"articleLive":2,"columnArticles":49,"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.5160550458715596,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":7.3352351801640365,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.683008194937994,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1800]最大升序子数组和","frequency":16.7954628814756,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37707844058243306,"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.2621328224776501,"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.40713166144200624,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":22.71720223657227,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5737226277372263,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":9.375798529801575,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4930652183670721,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.5605738976163455,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6643146478505161,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.34571948574115,"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.5843379809204319,"acs":0,"articleLive":2,"columnArticles":84,"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.2670800575794486,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":10.8265203909425,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.637117903930131,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1809]没有广告的剧集","frequency":24.937244926792673,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6830357142857143,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":27.876354625024913,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6618049225159526,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":6.126293813912077,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7948266942576306,"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.517864231838031,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1813]句子相似性 III","frequency":25.62736124123482,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3422213311948677,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.126293813912077,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30227703984819737,"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.7526873580620742,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1816]截断句子","frequency":5.5605738976163455,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6969878795151806,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.5605738976163455,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37423582706601577,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":46.48161132199868,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3657115104419621,"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.4971751412429379,"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.9018947368421053,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":24.937244926792673,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8129646646061315,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1822]数组元素积的符号","frequency":16.183442713396072,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7086481947942905,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1823]找出游戏的获胜者","frequency":16.7954628814756,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6607065358909817,"acs":0,"articleLive":2,"columnArticles":151,"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.28725630576054634,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":11.551881321512962,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43907156673114117,"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.7961234106872944,"acs":0,"articleLive":2,"columnArticles":134,"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.8697208303507517,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.183442713396072,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.678464518401127,"acs":0,"articleLive":2,"columnArticles":82,"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.48548199767711964,"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.7326923076923076,"acs":0,"articleLive":2,"columnArticles":22,"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.8228257355318461,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":23.63396138377883,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6849835401367435,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1833]雪糕的最大数量","frequency":29.11716714389944,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3507793074170659,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.154717435598055,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5082928224192165,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":11.551881321512962,"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.7203389830508474,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.8265203909425,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7949462365591398,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":5.5605738976163455,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.43004220681338556,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":57.41101373667228,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5767521987487533,"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.38812322659100124,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":10.101159460372038,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5150273224043715,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1841]联赛信息统计","frequency":24.27337559962882,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6950354609929078,"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.5094517958412098,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":5.5605738976163455,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8027770951093635,"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.569977880554997,"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.6337257810327246,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":40.754859727265256,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3601138699984185,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":6.717188864301861,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6857676154923005,"acs":0,"articleLive":2,"columnArticles":97,"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.3287228309682055,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":7.3352351801640365,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6051592524348512,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":7.982643366845061,"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.40115559224102354,"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.7074235807860262,"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.6461880088823094,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":6.717188864301861,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7934035087719298,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1854]人口最多的年份","frequency":24.27337559962882,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6892208749246332,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.63396138377883,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35575250559098814,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":18.784393512347606,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4520043336944745,"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.647982062780269,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":11.551881321512962,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7712993812470252,"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.7715482841181165,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1860]增长的内存泄露","frequency":5.5605738976163455,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6178908810487758,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":6.126293813912077,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3105875592587272,"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.9178780729127026,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":40.754859727265256,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38673982624599906,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":7.3352351801640365,"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.5157641877689921,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.596340449126698,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.0193139246888,"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.7523277467411545,"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.526829268292683,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":17.431734517438745,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7955216219684332,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1869]哪种连续子字符串更长","frequency":24.27337559962882,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45991244527829894,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.126293813912077,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763208086973107,"acs":0,"articleLive":2,"columnArticles":124,"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.6263630532392559,"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.8017641597028784,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":34.11174318737981,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8825757575757576,"acs":0,"articleLive":2,"columnArticles":14,"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.7397849462365591,"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.7288778446246403,"acs":0,"articleLive":2,"columnArticles":87,"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.8191916997120974,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1877]数组中最大数对和的最小值","frequency":53.194615449151314,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42933333333333334,"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.4087607807535179,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":7.3352351801640365,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.774014978834256,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.5605738976163455,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3524431543299468,"acs":0,"articleLive":2,"columnArticles":62,"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.2779171894604768,"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.3727849485889302,"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.6926444833625219,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":34.11174318737981,"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.517948717948718,"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.5721825178669598,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":16.7954628814756,"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.6407513696843203,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.717188864301861,"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.314618520675597,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":7.3352351801640365,"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.27390491452991456,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":18.094047193227674,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7021660649819494,"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.5106382978723404,"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.3344623200677392,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.126293813912077,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5914399862366907,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.09699522101154,"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.43251902282739285,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5298013245033113,"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.503680981595092,"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.5302909701954541,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.7954628814756,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30822558030845926,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":10.101159460372038,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6275922671353251,"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.42766827817032355,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":25.62736124123482,"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.6617480136208853,"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.42857142857142855,"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.6448892595681587,"acs":0,"articleLive":2,"columnArticles":98,"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.2764710806060099,"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.5713545713545714,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1905]统计子岛屿","frequency":5.5605738976163455,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42300297150847754,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":21.0193139246888,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6182707993474714,"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.6842105263157895,"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.32782515991471217,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":6.126293813912077,"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.6745411948457634,"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.5697151424287856,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1911]最大子序列交替和","frequency":16.183442713396072,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2917647058823529,"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.8436965202509983,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":6.126293813912077,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4407867206025945,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.431734517438745,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3905434015525759,"acs":0,"articleLive":2,"columnArticles":55,"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.5524614619592243,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":19.505000983338796,"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.2907303370786517,"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.47115384615384615,"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.38341968911917096,"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.9297662337662338,"acs":0,"articleLive":2,"columnArticles":78,"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.342957972409368,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.7954628814756,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36242365798778525,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.5605738976163455,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23736372646184342,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":26.34571948574115,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.4666666666666667,"acs":0,"articleLive":2,"columnArticles":3,"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.6970423661071143,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.449805057568714,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34588477366255144,"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.41041162227602906,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.5605738976163455,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3954867087397208,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":31.88795185911469,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9300866998708726,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1929]数组串联","frequency":16.183442713396072,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4753395282344532,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.7954628814756,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5539033457249071,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":7.982643366845061,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3268987341772152,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":20.23036191390926,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5684830633284241,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"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.7416974169741697,"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.7399552256392129,"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.4487527784638182,"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.2406894915790306,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.431734517438745,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3387096774193548,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":18.784393512347606,"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.8323529411764706,"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.7719521044992743,"acs":0,"articleLive":2,"columnArticles":77,"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.39182833627278074,"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.4046216583597644,"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.5698717948717948,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.126293813912077,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6619884293979001,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.5605738976163455,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30268691588785046,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.431734517438745,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5402041672493357,"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.5178571428571429,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.661896872488112,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.4966887417218543,"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.5432692307692307,"acs":0,"articleLive":2,"columnArticles":6,"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.7181467181467182,"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.5424423569598633,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1952]三除数","frequency":5.018255598477773,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3213919356111418,"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.4794487427466151,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":5.5605738976163455,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49346534653465346,"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.4357142857142857,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":21.84704592621567,"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.6101060511540861,"acs":0,"articleLive":2,"columnArticles":50,"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.42040673211781204,"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.40446051838456903,"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.2786471479050984,"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.5350276425447644,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":4.497741382272873,"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.4231479251946384,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1962]移除石子使总数最小","frequency":15.594060827695694,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6116919452216169,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":5.5605738976163455,"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.38152914458743376,"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.7654723127035831,"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.75,"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.7741801577418016,"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.3527255339496334,"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.27633124510571655,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":21.84704592621567,"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.4755813953488372,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":16.7954628814756,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5555555555555556,"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.4936708860759494,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":12.277242252083424,"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.5051546391752577,"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.7453834455789702,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":2.176082791711387,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3763425461835887,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1975]最大方阵和","frequency":13.947811659203424,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.27921141208527006,"acs":0,"articleLive":2,"columnArticles":30,"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.24059616749467708,"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.6010362694300518,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1978]","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8297221852984182,"acs":0,"articleLive":2,"columnArticles":66,"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.579229797979798,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1980]找出不同的二进制字符串","frequency":12.277242252083424,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2950980392156863,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":23.017386824306058,"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.45720984759671746,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1982]从子集的和还原数组","frequency":11.551881321512962,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6956521739130435,"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.5793033479878255,"acs":0,"articleLive":2,"columnArticles":55,"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.4066661286417561,"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.26214315266859745,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1986]完成任务的最少工作时间段","frequency":7.3352351801640365,"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.45043782837127844,"acs":0,"articleLive":2,"columnArticles":24,"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.6571428571428571,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1988]","frequency":25.62736124123482,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.3548387096774194,"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.6533333333333333,"acs":0,"articleLive":2,"columnArticles":4,"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.6642712777902537,"acs":0,"articleLive":2,"columnArticles":35,"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.5867568873852103,"acs":0,"articleLive":2,"columnArticles":48,"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.378076062639821,"acs":0,"articleLive":2,"columnArticles":40,"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.3525046382189239,"acs":0,"articleLive":2,"columnArticles":28,"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.5357186173438447,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.22525872219123752,"acs":0,"articleLive":2,"columnArticles":80,"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.3291382252559727,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1997]访问完所有房间的第一天","frequency":15.02585801200021,"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.4207165661582121,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1998]数组的最大公因数排序","frequency":30.449805057568714,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.8446350576224807,"acs":0,"articleLive":2,"columnArticles":620,"formTitle":"[LCP 01]猜数字","frequency":43.41774720360198,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6890520068717788,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[LCP 02]分式化简","frequency":28.48603299997492,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2182689018132056,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":23.017386824306058,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37610818933132983,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 04]覆盖","frequency":40.640882130761085,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19638602065131056,"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.8395190491183879,"acs":0,"articleLive":2,"columnArticles":646,"formTitle":"[LCP 06]拿硬币","frequency":34.11174318737981,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.770527977973925,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[LCP 07]传递信息","frequency":66.63175827085747,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2839005159719404,"acs":0,"articleLive":2,"columnArticles":100,"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.2688158009223005,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":62.67634598009314,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5840248962655602,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":18.094047193227674,"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.6850629255209408,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":6.126293813912077,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4064370262002926,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 12]小张刷题计划","frequency":41.4533539470012,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6134057733848268,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":7.3352351801640365,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.203453214513049,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":29.771219133044468,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5691340782122905,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":10.8265203909425,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2988691437802908,"acs":0,"articleLive":2,"columnArticles":14,"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.7983178734597812,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[LCP 17]速算机器人","frequency":29.771219133044468,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2849369988545246,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[LCP 18]早餐组合","frequency":34.11174318737981,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162076271186441,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":33.44858233523286,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.30335032774945375,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":18.784393512347606,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.32726484612050283,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":9.375798529801575,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3323872237359976,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[LCP 22]黑白方格画","frequency":50.524625007718235,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33677575107296137,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":16.7954628814756,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2730168843580758,"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.3260998810939358,"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.33484455958549225,"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.3265524625267666,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":25.62736124123482,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.27365505614594937,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[LCP 28]采购方案","frequency":27.286804992756892,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.17851035908855928,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[LCP 29]乐团站位","frequency":49.81605168619866,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34063094914332337,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[LCP 30]魔塔游戏","frequency":4.497741382272873,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2373988799004356,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":16.7954628814756,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3827054794520548,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":17.431734517438745,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2051373893465691,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[LCP 33]蓄水","frequency":29.771219133044468,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4631111111111111,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[LCP 34]二叉树染色","frequency":29.771219133044468,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.37964338781575035,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 35]电动车游城市","frequency":18.094047193227674,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.24439624005784527,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 36]最多牌组数","frequency":37.02908617571276,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.18504672897196262,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 37]最小矩形面积","frequency":34.28130602249608,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5340599455040872,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":20.23036191390926,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5402074252217045,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[LCS 01]下载插件","frequency":25.62736124123482,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6986622858483924,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[LCS 02]完成一半题目","frequency":17.431734517438745,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4170168067226891,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[LCS 03]主题空间","frequency":6.717188864301861,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786710239264686,"acs":0,"articleLive":2,"columnArticles":2708,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":95.2412466114497,"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.40301773822241127,"acs":0,"articleLive":2,"columnArticles":2010,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":74.14605711246726,"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.7619219018359701,"acs":0,"articleLive":2,"columnArticles":1863,"formTitle":"[剑指 Offer 05]替换空格","frequency":61.92612693316397,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523325725395719,"acs":0,"articleLive":2,"columnArticles":2001,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":75.55965969668803,"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.6964264481955807,"acs":0,"articleLive":2,"columnArticles":1409,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":81.71296529634347,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.717140867896489,"acs":0,"articleLive":2,"columnArticles":1587,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":89.71209805260229,"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.35927954527829875,"acs":0,"articleLive":2,"columnArticles":1811,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":56.891617058545194,"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.44242021977600676,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":70.51897044168722,"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.49326743338719387,"acs":0,"articleLive":2,"columnArticles":1576,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":81.19672142464296,"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.45314038113667915,"acs":0,"articleLive":2,"columnArticles":1086,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":62.47607008450393,"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.5257708755345487,"acs":0,"articleLive":2,"columnArticles":1662,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":76.15596047026474,"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.5686728133828381,"acs":0,"articleLive":2,"columnArticles":1266,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":64.9933255617794,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31132717549829847,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":38.392431737912304,"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.7463762496025313,"acs":0,"articleLive":2,"columnArticles":1228,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":51.40053346942231,"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.3389056315414402,"acs":0,"articleLive":2,"columnArticles":735,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":35.15311049539493,"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.7774493922782325,"acs":0,"articleLive":2,"columnArticles":1095,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":65.58650498475569,"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.5956547958277557,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":58.615928238671536,"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.3751826702427974,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":56.72144306952094,"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.23990737418870878,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":69.56461578061828,"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.6425209690005214,"acs":0,"articleLive":2,"columnArticles":1571,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":55.409905402038326,"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.7977007823726648,"acs":0,"articleLive":2,"columnArticles":2389,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":63.62702100509402,"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.7427424460819312,"acs":0,"articleLive":2,"columnArticles":1766,"formTitle":"[剑指 Offer 24]反转链表","frequency":93.52810594370469,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7287998271578265,"acs":0,"articleLive":2,"columnArticles":1139,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":79.16250021794193,"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.46550751240736965,"acs":0,"articleLive":2,"columnArticles":1138,"formTitle":"[剑指 Offer 26]树的子结构","frequency":69.08205550439399,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7913496630953468,"acs":0,"articleLive":2,"columnArticles":1355,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":64.9933255617794,"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.5803349748850777,"acs":0,"articleLive":2,"columnArticles":1050,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":49.58541719627019,"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.4400487683157559,"acs":0,"articleLive":2,"columnArticles":1437,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":82.49054404331886,"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.5724675417161831,"acs":0,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":54.613674571267666,"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.6143545213252791,"acs":0,"articleLive":2,"columnArticles":905,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":38.19154405126015,"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.6455263923295255,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":61.04928662671588,"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.6859377485550665,"acs":0,"articleLive":2,"columnArticles":1045,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":55.87690840547423,"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.5887798021754408,"acs":0,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":54.4655588544232,"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.5503621443865059,"acs":0,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.26755201022692,"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.5774118808351956,"acs":0,"articleLive":2,"columnArticles":835,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":63.96760238712464,"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.720673821172198,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":56.66729227171354,"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.6543777885322956,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":68.98690472401461,"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.5596588774513487,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":70.17699782235186,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5790185220546115,"acs":0,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":92.75343536429857,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.689658575517157,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":59.11895682166468,"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.5697925659414593,"acs":0,"articleLive":2,"columnArticles":1766,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":74.25117951356212,"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.5809343014266982,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":46.612506335453844,"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.6053831095394189,"acs":0,"articleLive":2,"columnArticles":1479,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":90.34848363720384,"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.48317157730029353,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":53.344912676000725,"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.4133841394518861,"acs":0,"articleLive":2,"columnArticles":444,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":49.58541719627019,"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.5621533801459452,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":65.34714075383448,"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.5379552162411684,"acs":0,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":69.0319205527274,"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.6890956576502041,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":54.07123716231773,"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.4646599981046557,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":69.56461578061828,"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.6514057411135553,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[剑指 Offer 49]丑数","frequency":68.04521240809358,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.613717931676193,"acs":0,"articleLive":2,"columnArticles":1010,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":64.41706097832508,"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.4813553761730555,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":91.0738445677743,"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.6480270181091206,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":66.82774247538966,"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.5388642213157935,"acs":0,"articleLive":2,"columnArticles":1523,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":58.391388591970184,"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.4470092059317038,"acs":0,"articleLive":2,"columnArticles":1412,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":57.46505646303098,"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.7554393336173588,"acs":0,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":47.697465233081225,"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.7894452868452143,"acs":0,"articleLive":2,"columnArticles":1229,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":61.521109348466766,"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.5871048826303769,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.11482045953906,"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.6993253973295389,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":63.47781444733709,"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.7992597978893985,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":48.96477832790934,"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.6637999748290473,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.48820145795808,"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.7063228922809657,"acs":0,"articleLive":2,"columnArticles":1822,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":60.467322118447406,"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.4413146556390326,"acs":0,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":58.12522309159364,"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.8566850529141684,"acs":0,"articleLive":2,"columnArticles":1720,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":53.61306400372832,"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.4438848388018326,"acs":0,"articleLive":2,"columnArticles":1159,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":75.77290339252512,"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.47453309361191337,"acs":0,"articleLive":2,"columnArticles":1042,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":45.09699522101154,"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.5597236110735746,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":59.55257549843934,"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.45965037459864433,"acs":0,"articleLive":2,"columnArticles":940,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":61.503519659114794,"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.6552552590031763,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":72.95307004215124,"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.6334804320657952,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":61.503519659114794,"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.8570714804817275,"acs":0,"articleLive":2,"columnArticles":1260,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":53.020696403014625,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5819338444384902,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.440004346103564,"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.5978484362122066,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":55.9516563579218,"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.2852960945238432,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":47.21264610252666,"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.693097084251988,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":48.36315695657654,"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.6999962289765442,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":62.3423813730798,"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.20662930204045887,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 001]整数除法","frequency":13.222450728632962,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5928656048440174,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.450721861140925,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7868325412356724,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":3.516484022321481,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6997661730319563,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":3.997587297058907,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7224041159962582,"acs":0,"articleLive":2,"columnArticles":58,"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.6700251889168766,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4642607357672402,"acs":0,"articleLive":2,"columnArticles":48,"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.520381071372794,"acs":0,"articleLive":2,"columnArticles":60,"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.5426727726894255,"acs":0,"articleLive":2,"columnArticles":49,"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.44130735000767224,"acs":0,"articleLive":2,"columnArticles":35,"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.5747599451303155,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":14.477510063836926,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6632548618219037,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5164247517188694,"acs":0,"articleLive":2,"columnArticles":44,"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.6489795918367347,"acs":0,"articleLive":2,"columnArticles":33,"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.5001009489198466,"acs":0,"articleLive":2,"columnArticles":49,"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.5306451612903226,"acs":0,"articleLive":2,"columnArticles":29,"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.5535260115606936,"acs":0,"articleLive":2,"columnArticles":36,"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.4761083743842365,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":15.02585801200021,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7093488541287741,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5388209920920202,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5189555981708217,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":12.74246225087164,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7118451025056948,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":3.053240749443787,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7723193741371376,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 024]反转链表","frequency":21.84704592621567,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6107466416744767,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":23.017386824306058,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.666860465116279,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 026]重排链表","frequency":16.183442713396072,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6217228464419475,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 027]回文链表","frequency":2.6067714007646106,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6048387096774194,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30013679890560874,"acs":0,"articleLive":2,"columnArticles":31,"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.5320476460578559,"acs":0,"articleLive":2,"columnArticles":17,"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.5889456572224803,"acs":0,"articleLive":2,"columnArticles":17,"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.5983847283406755,"acs":0,"articleLive":2,"columnArticles":31,"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.786046511627907,"acs":0,"articleLive":2,"columnArticles":29,"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.5741308793456033,"acs":0,"articleLive":2,"columnArticles":27,"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.700625,"acs":0,"articleLive":2,"columnArticles":22,"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.596642685851319,"acs":0,"articleLive":2,"columnArticles":29,"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.4565121412803532,"acs":0,"articleLive":2,"columnArticles":26,"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.7831102907245039,"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.5187246963562753,"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.5696920583468396,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":16.183442713396072,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7858892699657031,"acs":0,"articleLive":2,"columnArticles":36,"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.8619572261827608,"acs":0,"articleLive":2,"columnArticles":29,"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.6468468468468469,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6458149779735682,"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.8110787172011662,"acs":0,"articleLive":2,"columnArticles":38,"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.7206733298264072,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6959161147902869,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6818551668022783,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7449591280653951,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":15.02585801200021,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6230769230769231,"acs":0,"articleLive":2,"columnArticles":21,"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.417331206804891,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7366548042704626,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":2.6067714007646106,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6514067715784454,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8620188816267248,"acs":0,"articleLive":2,"columnArticles":30,"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.8869047619047619,"acs":0,"articleLive":2,"columnArticles":15,"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.7364077669902913,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.352258064516129,"acs":0,"articleLive":2,"columnArticles":8,"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.6,"acs":0,"articleLive":2,"columnArticles":11,"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.6283354510800508,"acs":0,"articleLive":2,"columnArticles":16,"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.6712871287128713,"acs":0,"articleLive":2,"columnArticles":30,"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.5294117647058824,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":3.516484022321481,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7141444114737884,"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.7196029776674938,"acs":0,"articleLive":2,"columnArticles":19,"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.6060606060606061,"acs":0,"articleLive":2,"columnArticles":11,"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.6220238095238095,"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.644640234948605,"acs":0,"articleLive":2,"columnArticles":17,"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.6485225505443235,"acs":0,"articleLive":2,"columnArticles":13,"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.5194664744051911,"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.7217300677436165,"acs":0,"articleLive":2,"columnArticles":25,"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.6765484383271573,"acs":0,"articleLive":2,"columnArticles":25,"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.5208333333333334,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":6.126293813912077,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42059980334316616,"acs":0,"articleLive":2,"columnArticles":35,"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.5520059435364042,"acs":0,"articleLive":2,"columnArticles":19,"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.5459825750242013,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 074]合并区间","frequency":16.183442713396072,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7130952380952381,"acs":0,"articleLive":2,"columnArticles":28,"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.6745134965473949,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5582201675816238,"acs":0,"articleLive":2,"columnArticles":34,"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.646416083916084,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8694624926166569,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 079]所有子集","frequency":3.997587297058907,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8077232502011263,"acs":0,"articleLive":2,"columnArticles":21,"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.7896092743666809,"acs":0,"articleLive":2,"columnArticles":32,"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.6475287069395906,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8597308488612836,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6785518376302797,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8610206297502715,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7691740412979351,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6352793471437539,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7427113702623906,"acs":0,"articleLive":2,"columnArticles":31,"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.6195536663124336,"acs":0,"articleLive":2,"columnArticles":17,"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.5204949729311679,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":4.497741382272873,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7460191082802548,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6424632352941176,"acs":0,"articleLive":2,"columnArticles":21,"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.5539070227497527,"acs":0,"articleLive":2,"columnArticles":10,"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.613941018766756,"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.6756689791873142,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":33.44858233523286,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5061855670103093,"acs":0,"articleLive":2,"columnArticles":10,"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.5215252152521526,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7573221757322176,"acs":0,"articleLive":2,"columnArticles":24,"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.6825787401574803,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":23.63396138377883,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7319679430097952,"acs":0,"articleLive":2,"columnArticles":25,"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.46516567544604925,"acs":0,"articleLive":2,"columnArticles":25,"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.5898174831892411,"acs":0,"articleLive":2,"columnArticles":11,"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.4978821717366192,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":24.937244926792673,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5561172901921132,"acs":0,"articleLive":2,"columnArticles":8,"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.6889699918896999,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5389527458492975,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.018255598477773,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5510996119016818,"acs":0,"articleLive":2,"columnArticles":8,"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.5651041666666666,"acs":0,"articleLive":2,"columnArticles":6,"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.6013143483023001,"acs":0,"articleLive":2,"columnArticles":17,"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.8453837597330367,"acs":0,"articleLive":2,"columnArticles":22,"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.6734104046242775,"acs":0,"articleLive":2,"columnArticles":11,"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.5880469583778015,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":6.126293813912077,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5761316872427984,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.7954628814756,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.40134907251264756,"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.26559865092748736,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 115]重建序列","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6451612903225806,"acs":0,"articleLive":2,"columnArticles":40,"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.6252723311546841,"acs":0,"articleLive":2,"columnArticles":10,"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.6968085106382979,"acs":0,"articleLive":2,"columnArticles":16,"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.4483910139647845,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.5605738976163455,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7214804742276802,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":76.4760808202096,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6505261397704335,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":45.91589140570294,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5800169348010161,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 01.03]URL化","frequency":40.08097302202694,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5511951020174067,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[面试题 01.04]回文排列","frequency":45.77699202581343,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.333578856152513,"acs":0,"articleLive":2,"columnArticles":531,"formTitle":"[面试题 01.05]一次编辑","frequency":39.43007732492623,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.473166476548346,"acs":0,"articleLive":2,"columnArticles":1141,"formTitle":"[面试题 01.06]字符串压缩","frequency":67.4781126523476,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7551586634317423,"acs":0,"articleLive":2,"columnArticles":941,"formTitle":"[面试题 01.07]旋转矩阵","frequency":54.00968496755861,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219965955139117,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[面试题 01.08]零矩阵","frequency":41.4533539470012,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5514409119875381,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 01.09]字符串轮转","frequency":29.771219133044468,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6839368388092416,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[面试题 02.01]移除重复节点","frequency":47.83180085519276,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.780347390870203,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":58.645171140667976,"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.853996508320209,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[面试题 02.03]删除中间节点","frequency":61.59414518357179,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6569656748082467,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[面试题 02.04]分割链表","frequency":47.21264610252666,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4664973679337619,"acs":0,"articleLive":2,"columnArticles":505,"formTitle":"[面试题 02.05]链表求和","frequency":73.42499810475532,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48337948354691224,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[面试题 02.06]回文链表","frequency":32.189666716451356,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6864176597114282,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 02.07]链表相交","frequency":27.876354625024913,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5314632606082829,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 02.08]环路检测","frequency":49.81605168619866,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5422888169572935,"acs":0,"articleLive":2,"columnArticles":166,"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.6134065227604283,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.41774720360198,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38682676498430574,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 03.03]堆盘子","frequency":29.11716714389944,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7120328023970982,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 03.04]化栈为队","frequency":35.757805382622024,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5446485368956743,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.05]栈排序","frequency":16.183442713396072,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5891131568414432,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.06]动物收容所","frequency":34.11174318737981,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.534586778178568,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.01]节点间通路","frequency":34.11174318737981,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7895107687248984,"acs":0,"articleLive":2,"columnArticles":409,"formTitle":"[面试题 04.02]最小高度树","frequency":47.21264610252666,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8051489670922869,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":35.757805382622024,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5840310246094741,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 04.04]检查平衡性","frequency":17.431734517438745,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3512490320360226,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":38.392431737912304,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5908531330789117,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 04.06]后继者","frequency":17.431734517438745,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168723538419962,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.771219133044468,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47846532805852054,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":24.937244926792673,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7177088613427952,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[面试题 04.10]检查子树","frequency":6.126293813912077,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48849659962378816,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.12]求和路径","frequency":34.11174318737981,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5066185996732947,"acs":0,"articleLive":2,"columnArticles":171,"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.6876574307304786,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":17.431734517438745,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3903091444075051,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 05.03]翻转数位","frequency":38.392431737912304,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3934947989442633,"acs":0,"articleLive":2,"columnArticles":132,"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.5273526077097506,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 05.06]整数转换","frequency":5.018255598477773,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7034359204043765,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":16.183442713396072,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5537855148628674,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":23.63396138377883,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36374125812531927,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[面试题 08.01]三步问题","frequency":45.29850824883108,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.361361237036577,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 08.02]迷路的机器人","frequency":36.38268815024056,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6767928812843261,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":5.5605738976163455,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8228681219851198,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.04]幂集","frequency":40.08097302202694,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6798026294002716,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[面试题 08.05]递归乘法","frequency":5.5605738976163455,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6564169193012849,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":53.90595227255533,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133197603852629,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":37.02908617571276,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7184312663597797,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":45.09699522101154,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8117728906582151,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.09]括号","frequency":63.21408872240231,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5593169944357134,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 08.10]颜色填充","frequency":16.183442713396072,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4945439510949013,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":45.09699522101154,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7599943160287987,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 08.12]八皇后","frequency":46.55349485552583,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5005023572146224,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":17.431734517438745,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5358200915701589,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.55425556551245,"acs":0,"articleLive":2,"columnArticles":2360,"formTitle":"[面试题 10.01]合并排序的数组","frequency":71.98173390257003,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7393216757584251,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":60.912645678109975,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3963843958135109,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":59.809917236862134,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534018047969603,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.27337559962882,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4563248080910976,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":43.41774720360198,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6306670516892867,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":7.3352351801640365,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6668183058866345,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":42.08612690382681,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8330418992534804,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[面试题 16.01]交换数字","frequency":29.771219133044468,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7659252043080587,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.02]单词频率","frequency":6.126293813912077,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44332587621178227,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":7.982643366845061,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46074747874233735,"acs":0,"articleLive":2,"columnArticles":152,"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.46423637416997193,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":29.771219133044468,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4242550386790162,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 16.06]最小差","frequency":34.79947650804195,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.733102253032929,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 16.07]最大数值","frequency":43.41774720360198,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3758480325644505,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":7.982643366845061,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.548353371667538,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6842796873919358,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.10]生存人数","frequency":16.7954628814756,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409534607685085,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[面试题 16.11]跳水板","frequency":23.63396138377883,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4327458256029685,"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.5503280524883981,"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.5029891462069767,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.126293813912077,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4520444458434323,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.16]部分排序","frequency":34.79947650804195,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.600903882424113,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[面试题 16.17]连续数列","frequency":40.754859727265256,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3442465314345895,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 16.18]模式匹配","frequency":34.79947650804195,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6099600368890256,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[面试题 16.19]水域大小","frequency":47.21264610252666,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7203983458519706,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[面试题 16.20]T9键盘","frequency":34.11174318737981,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4661734693877551,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":5.5605738976163455,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.581909767849321,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.982643366845061,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4718287550346201,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.24]数对和","frequency":24.27337559962882,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5446163266041167,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.99099340364926,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.387121864496236,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.26]计算器","frequency":59.36011642423902,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.597552993303459,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":16.7954628814756,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6449070525105405,"acs":0,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 17.04]消失的数字","frequency":37.02908617571276,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38716096698113206,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.431734517438745,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4488032575230907,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.5605738976163455,"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.4113571393962886,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 17.07]婴儿名字","frequency":34.11174318737981,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27209693705822957,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":40.754859727265256,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5503339404978749,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[面试题 17.09]第 k 个数","frequency":52.507913391402326,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5711846133942817,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 17.10]主要元素","frequency":59.809917236862134,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6867604810829235,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 17.11]单词距离","frequency":34.79947650804195,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6317829457364341,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":5.5605738976163455,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530774471950942,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":29.771219133044468,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.598519814086058,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[面试题 17.14]最小K个数","frequency":47.939168027777924,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.402266695359013,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.15]最长单词","frequency":31.154717435598055,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5191193410647935,"acs":0,"articleLive":2,"columnArticles":1127,"formTitle":"[面试题 17.16]按摩师","frequency":50.88870073928404,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4424975176683605,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.17]多次搜索","frequency":16.183442713396072,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44562776672868415,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.18]最短超串","frequency":24.937244926792673,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5819067501739735,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":34.79947650804195,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5720775287704422,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":16.7954628814756,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.635674202108377,"acs":0,"articleLive":2,"columnArticles":532,"formTitle":"[面试题 17.21]直方图的水量","frequency":88.2656324730788,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3714160070360598,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.08097302202694,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3797267518730718,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.23]最大黑方阵","frequency":5.5605738976163455,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5177301142487605,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.24]最大子矩阵","frequency":73.684259658545,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.49213161659513593,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":27.876354625024913,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3413223140495868,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.7954628814756,"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/MonotoneIncreasingDigits.md b/src/main/java/leetcode/editor/cn/doc/content/MonotoneIncreasingDigits.md
new file mode 100644
index 0000000..3efc5b0
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/MonotoneIncreasingDigits.md
@@ -0,0 +1,24 @@
+给定一个非负整数 N，找出小于或等于 N 的最大的整数，同时这个整数需要满足其各个位数上的数字是单调递增。
+
+（当且仅当每个相邻位数上的数字 x 和 y 满足 x <= y 时，我们称这个整数是单调递增的。）
+
+示例 1:
+
+输入: N = 10
+输出: 9
+
+
+示例 2:
+
+输入: N = 1234
+输出: 1234
+
+
+示例 3:
+
+输入: N = 332
+输出: 299
+
+
+说明: N 是在 [0, 10^9] 范围内的一个整数。
+
👍 205👎 0
\ No newline at end of file